/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:17:06,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:17:06,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:17:06,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:17:06,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:17:06,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:17:06,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:17:06,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:17:06,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:17:06,512 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:17:06,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:17:06,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:17:06,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:17:06,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:17:06,513 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:17:06,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:17:06,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:17:06,513 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:17:06,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:17:06,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:17:06,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:17:06,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:17:06,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:17:06,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:17:06,513 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:17:06,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:17:06,514 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:17:06,514 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:17:06,514 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:17:06,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:17:06,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:17:06,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:17:06,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:17:06,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:17:06,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:17:06,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:17:06,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:17:06,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:17:06,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:17:06,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:17:06,517 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:17:06,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:17:06,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:17:06,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:17:06,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:17:06,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:17:06,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:17:06,518 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:17:06,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:17:06,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:17:06,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:17:06,735 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:17:06,735 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:17:06,737 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-14 01:17:08,023 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bcdf9bc6/8d9a8304fef54d8a8fd1fe80aee3a571/FLAG97c7b25ab [2025-04-14 01:17:08,212 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:17:08,212 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2025-04-14 01:17:08,217 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bcdf9bc6/8d9a8304fef54d8a8fd1fe80aee3a571/FLAG97c7b25ab [2025-04-14 01:17:09,024 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bcdf9bc6/8d9a8304fef54d8a8fd1fe80aee3a571 [2025-04-14 01:17:09,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:17:09,027 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:17:09,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:17:09,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:17:09,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:17:09,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:17:09" (1/1) ... [2025-04-14 01:17:09,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30eae28a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:17:09, skipping insertion in model container [2025-04-14 01:17:09,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:17:09" (1/1) ... [2025-04-14 01:17:09,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:17:09,187 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-14 01:17:09,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:17:09,199 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:17:09,220 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-14 01:17:09,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:17:09,234 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:17:09,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:17:09 WrapperNode [2025-04-14 01:17:09,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:17:09,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:17:09,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:17:09,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:17:09,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:17:09" (1/1) ... [2025-04-14 01:17:09,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:17:09" (1/1) ... [2025-04-14 01:17:09,260 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 84 [2025-04-14 01:17:09,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:17:09,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:17:09,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:17:09,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:17:09,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:17:09" (1/1) ... [2025-04-14 01:17:09,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:17:09" (1/1) ... [2025-04-14 01:17:09,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:17:09" (1/1) ... [2025-04-14 01:17:09,291 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-14 01:17:09,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:17:09" (1/1) ... [2025-04-14 01:17:09,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:17:09" (1/1) ... [2025-04-14 01:17:09,296 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:17:09" (1/1) ... [2025-04-14 01:17:09,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:17:09" (1/1) ... [2025-04-14 01:17:09,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:17:09" (1/1) ... [2025-04-14 01:17:09,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:17:09" (1/1) ... [2025-04-14 01:17:09,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:17:09,306 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:17:09,306 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:17:09,306 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:17:09,307 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:17:09" (1/1) ... [2025-04-14 01:17:09,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:17:09,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:17:09,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 01:17:09,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-14 01:17:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:17:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:17:09,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:17:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:17:09,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:17:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:17:09,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:17:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:17:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:17:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:17:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:17:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:17:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:17:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:17:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:17:09,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:17:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:17:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:17:09,352 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:17:09,427 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:17:09,430 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:17:09,649 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:17:09,649 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:17:09,650 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:17:09,835 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:17:09,836 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:17:09,838 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:17:09,842 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:17:09,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:17:09 BoogieIcfgContainer [2025-04-14 01:17:09,843 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:17:09,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:17:09,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:17:09,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:17:09,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:17:09" (1/3) ... [2025-04-14 01:17:09,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7285eeb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:17:09, skipping insertion in model container [2025-04-14 01:17:09,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:17:09" (2/3) ... [2025-04-14 01:17:09,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7285eeb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:17:09, skipping insertion in model container [2025-04-14 01:17:09,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:17:09" (3/3) ... [2025-04-14 01:17:09,850 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2025-04-14 01:17:09,861 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:17:09,862 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-14 01:17:09,863 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:17:09,916 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:17:09,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2025-04-14 01:17:09,967 INFO L116 PetriNetUnfolderBase]: 7/29 cut-off events. [2025-04-14 01:17:09,970 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:17:09,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 7/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-14 01:17:09,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2025-04-14 01:17:09,977 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 74 flow [2025-04-14 01:17:09,982 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:17:09,989 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;@39bdd8fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:17:09,989 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:17:10,000 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:17:10,000 INFO L116 PetriNetUnfolderBase]: 7/27 cut-off events. [2025-04-14 01:17:10,000 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:17:10,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:10,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:10,003 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:10,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:10,007 INFO L85 PathProgramCache]: Analyzing trace with hash -809757656, now seen corresponding path program 1 times [2025-04-14 01:17:10,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:10,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098889137] [2025-04-14 01:17:10,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:17:10,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:10,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:17:10,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:17:10,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:17:10,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:10,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:10,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098889137] [2025-04-14 01:17:10,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098889137] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:10,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:10,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:17:10,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949238674] [2025-04-14 01:17:10,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:10,288 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:17:10,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:10,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:17:10,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:17:10,305 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:10,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:10,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:10,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:10,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:10,445 INFO L116 PetriNetUnfolderBase]: 511/703 cut-off events. [2025-04-14 01:17:10,445 INFO L117 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-04-14 01:17:10,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 703 events. 511/703 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1960 event pairs, 306 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 1304. Up to 701 conditions per place. [2025-04-14 01:17:10,452 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2025-04-14 01:17:10,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 126 flow [2025-04-14 01:17:10,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:17:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:17:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-14 01:17:10,463 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-14 01:17:10,464 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 74 flow. Second operand 3 states and 37 transitions. [2025-04-14 01:17:10,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 126 flow [2025-04-14 01:17:10,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:17:10,469 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 62 flow [2025-04-14 01:17:10,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2025-04-14 01:17:10,472 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2025-04-14 01:17:10,472 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 62 flow [2025-04-14 01:17:10,472 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:10,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:10,472 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:10,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:17:10,473 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:10,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:10,474 INFO L85 PathProgramCache]: Analyzing trace with hash -537765117, now seen corresponding path program 1 times [2025-04-14 01:17:10,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:10,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246513603] [2025-04-14 01:17:10,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:17:10,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:10,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:17:10,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:17:10,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:17:10,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:10,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:10,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:10,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246513603] [2025-04-14 01:17:10,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246513603] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:10,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:10,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:17:10,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112635138] [2025-04-14 01:17:10,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:10,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:17:10,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:10,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:17:10,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:17:10,582 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:10,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:10,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:10,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:10,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:10,687 INFO L116 PetriNetUnfolderBase]: 474/666 cut-off events. [2025-04-14 01:17:10,687 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-14 01:17:10,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 666 events. 474/666 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1870 event pairs, 306 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 1347. Up to 664 conditions per place. [2025-04-14 01:17:10,690 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 25 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-04-14 01:17:10,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 112 flow [2025-04-14 01:17:10,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:17:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:17:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-14 01:17:10,692 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-14 01:17:10,692 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 62 flow. Second operand 3 states and 36 transitions. [2025-04-14 01:17:10,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 112 flow [2025-04-14 01:17:10,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 111 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:17:10,693 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 61 flow [2025-04-14 01:17:10,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=28, PETRI_TRANSITIONS=26} [2025-04-14 01:17:10,694 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-04-14 01:17:10,694 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 61 flow [2025-04-14 01:17:10,694 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:10,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:10,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:10,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:17:10,694 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:10,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:10,694 INFO L85 PathProgramCache]: Analyzing trace with hash 833748358, now seen corresponding path program 1 times [2025-04-14 01:17:10,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:10,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059418876] [2025-04-14 01:17:10,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:17:10,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:10,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 01:17:10,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:17:10,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:17:10,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:10,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:10,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059418876] [2025-04-14 01:17:10,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059418876] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:10,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:10,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:17:10,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470880704] [2025-04-14 01:17:10,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:10,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:17:10,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:10,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:17:10,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:17:10,807 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:10,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:10,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:10,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:10,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:10,902 INFO L116 PetriNetUnfolderBase]: 474/667 cut-off events. [2025-04-14 01:17:10,902 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-14 01:17:10,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 667 events. 474/667 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1870 event pairs, 306 based on Foata normal form. 1/501 useless extension candidates. Maximal degree in co-relation 1347. Up to 667 conditions per place. [2025-04-14 01:17:10,907 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 25 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-04-14 01:17:10,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 117 flow [2025-04-14 01:17:10,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:17:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:17:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-14 01:17:10,908 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-14 01:17:10,908 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 61 flow. Second operand 3 states and 37 transitions. [2025-04-14 01:17:10,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 117 flow [2025-04-14 01:17:10,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:17:10,909 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 72 flow [2025-04-14 01:17:10,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2025-04-14 01:17:10,910 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2025-04-14 01:17:10,910 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 72 flow [2025-04-14 01:17:10,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:10,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:10,910 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:10,910 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:17:10,910 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:10,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:10,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1704734234, now seen corresponding path program 1 times [2025-04-14 01:17:10,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:10,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15129667] [2025-04-14 01:17:10,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:17:10,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:10,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:17:10,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:17:10,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:17:10,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:11,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:11,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15129667] [2025-04-14 01:17:11,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15129667] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:17:11,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240996509] [2025-04-14 01:17:11,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:17:11,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:17:11,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:17:11,676 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:17:11,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 01:17:11,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:17:11,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:17:11,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:17:11,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:11,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:17:11,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:17:11,809 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:17:12,142 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-14 01:17:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:12,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:17:13,506 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-14 01:17:13,511 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-14 01:17:13,648 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-14 01:17:13,653 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-14 01:17:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:13,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240996509] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:17:13,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:17:13,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 24 [2025-04-14 01:17:13,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525859862] [2025-04-14 01:17:13,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:17:13,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 01:17:13,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:13,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 01:17:13,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2025-04-14 01:17:13,710 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:13,710 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-14 01:17:13,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:13,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:13,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:15,935 INFO L116 PetriNetUnfolderBase]: 1364/2009 cut-off events. [2025-04-14 01:17:15,935 INFO L117 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-04-14 01:17:15,938 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 123. Compared 8812 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-14 01:17:15,945 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 172 selfloop transitions, 120 changer transitions 1/293 dead transitions. [2025-04-14 01:17:15,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 293 transitions, 1250 flow [2025-04-14 01:17:15,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-14 01:17:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-14 01:17:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 421 transitions. [2025-04-14 01:17:15,948 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3373397435897436 [2025-04-14 01:17:15,948 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 72 flow. Second operand 39 states and 421 transitions. [2025-04-14 01:17:15,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 293 transitions, 1250 flow [2025-04-14 01:17:15,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 293 transitions, 1246 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:17:15,952 INFO L231 Difference]: Finished difference. Result has 85 places, 156 transitions, 757 flow [2025-04-14 01:17:15,952 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-14 01:17:15,952 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2025-04-14 01:17:15,952 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 156 transitions, 757 flow [2025-04-14 01:17:15,955 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-14 01:17:15,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:15,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:15,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:17:16,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:17:16,163 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:16,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:16,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1605080768, now seen corresponding path program 2 times [2025-04-14 01:17:16,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:16,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541060844] [2025-04-14 01:17:16,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:17:16,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:16,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:16,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:17:16,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:17:16,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:16,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:16,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541060844] [2025-04-14 01:17:16,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541060844] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:16,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:16,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:17:16,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101288422] [2025-04-14 01:17:16,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:16,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:17:16,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:16,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:17:16,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:17:16,527 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:16,527 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-14 01:17:16,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:16,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:16,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:16,863 INFO L116 PetriNetUnfolderBase]: 1432/2128 cut-off events. [2025-04-14 01:17:16,864 INFO L117 PetriNetUnfolderBase]: For 6008/6008 co-relation queries the response was YES. [2025-04-14 01:17:16,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7738 conditions, 2128 events. 1432/2128 cut-off events. For 6008/6008 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9380 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-14 01:17:16,877 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 161 selfloop transitions, 54 changer transitions 1/216 dead transitions. [2025-04-14 01:17:16,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 216 transitions, 1468 flow [2025-04-14 01:17:16,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:17:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:17:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2025-04-14 01:17:16,879 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31875 [2025-04-14 01:17:16,880 INFO L175 Difference]: Start difference. First operand has 85 places, 156 transitions, 757 flow. Second operand 10 states and 102 transitions. [2025-04-14 01:17:16,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 216 transitions, 1468 flow [2025-04-14 01:17:16,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 216 transitions, 1460 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 01:17:16,901 INFO L231 Difference]: Finished difference. Result has 99 places, 190 transitions, 1132 flow [2025-04-14 01:17:16,901 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-14 01:17:16,902 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 68 predicate places. [2025-04-14 01:17:16,902 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 190 transitions, 1132 flow [2025-04-14 01:17:16,902 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:16,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:16,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:16,902 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:17:16,902 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:16,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:16,903 INFO L85 PathProgramCache]: Analyzing trace with hash -164979484, now seen corresponding path program 3 times [2025-04-14 01:17:16,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:16,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790647301] [2025-04-14 01:17:16,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:17:16,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:16,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:16,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:17:16,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:17:16,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:17,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:17,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790647301] [2025-04-14 01:17:17,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790647301] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:17,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:17,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:17:17,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144908389] [2025-04-14 01:17:17,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:17,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:17:17,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:17,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:17:17,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:17:17,363 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:17,363 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-14 01:17:17,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:17,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:17,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:17,846 INFO L116 PetriNetUnfolderBase]: 1614/2406 cut-off events. [2025-04-14 01:17:17,846 INFO L117 PetriNetUnfolderBase]: For 8316/8316 co-relation queries the response was YES. [2025-04-14 01:17:17,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9631 conditions, 2406 events. 1614/2406 cut-off events. For 8316/8316 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10968 event pairs, 105 based on Foata normal form. 1/2218 useless extension candidates. Maximal degree in co-relation 9094. Up to 2053 conditions per place. [2025-04-14 01:17:17,861 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 178 selfloop transitions, 105 changer transitions 4/287 dead transitions. [2025-04-14 01:17:17,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 287 transitions, 2276 flow [2025-04-14 01:17:17,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:17:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:17:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2025-04-14 01:17:17,863 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3385416666666667 [2025-04-14 01:17:17,863 INFO L175 Difference]: Start difference. First operand has 99 places, 190 transitions, 1132 flow. Second operand 12 states and 130 transitions. [2025-04-14 01:17:17,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 287 transitions, 2276 flow [2025-04-14 01:17:17,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 287 transitions, 2169 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-04-14 01:17:17,888 INFO L231 Difference]: Finished difference. Result has 116 places, 248 transitions, 1846 flow [2025-04-14 01:17:17,888 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=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1846, PETRI_PLACES=116, PETRI_TRANSITIONS=248} [2025-04-14 01:17:17,888 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2025-04-14 01:17:17,890 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 248 transitions, 1846 flow [2025-04-14 01:17:17,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:17,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:17,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:17,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:17:17,890 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:17,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:17,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1533124464, now seen corresponding path program 4 times [2025-04-14 01:17:17,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:17,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308230087] [2025-04-14 01:17:17,891 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:17:17,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:17,899 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:17,918 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:17:17,918 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:17:17,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:18,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:18,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308230087] [2025-04-14 01:17:18,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308230087] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:18,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:18,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:17:18,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527101186] [2025-04-14 01:17:18,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:18,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:17:18,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:18,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:17:18,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:17:18,420 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:18,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 248 transitions, 1846 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:18,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:18,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:18,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:18,986 INFO L116 PetriNetUnfolderBase]: 1709/2553 cut-off events. [2025-04-14 01:17:18,986 INFO L117 PetriNetUnfolderBase]: For 10589/10589 co-relation queries the response was YES. [2025-04-14 01:17:18,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11232 conditions, 2553 events. 1709/2553 cut-off events. For 10589/10589 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 11757 event pairs, 176 based on Foata normal form. 1/2353 useless extension candidates. Maximal degree in co-relation 11114. Up to 2185 conditions per place. [2025-04-14 01:17:19,003 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 202 selfloop transitions, 126 changer transitions 4/332 dead transitions. [2025-04-14 01:17:19,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 332 transitions, 3061 flow [2025-04-14 01:17:19,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:17:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:17:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2025-04-14 01:17:19,004 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.328125 [2025-04-14 01:17:19,004 INFO L175 Difference]: Start difference. First operand has 116 places, 248 transitions, 1846 flow. Second operand 12 states and 126 transitions. [2025-04-14 01:17:19,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 332 transitions, 3061 flow [2025-04-14 01:17:19,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 332 transitions, 3010 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-04-14 01:17:19,040 INFO L231 Difference]: Finished difference. Result has 134 places, 294 transitions, 2666 flow [2025-04-14 01:17:19,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2666, PETRI_PLACES=134, PETRI_TRANSITIONS=294} [2025-04-14 01:17:19,041 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2025-04-14 01:17:19,041 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 294 transitions, 2666 flow [2025-04-14 01:17:19,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:19,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:19,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:19,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:17:19,042 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:19,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:19,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1219146180, now seen corresponding path program 5 times [2025-04-14 01:17:19,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:19,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447252524] [2025-04-14 01:17:19,042 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:17:19,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:19,047 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:19,055 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:17:19,055 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:17:19,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:19,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:19,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447252524] [2025-04-14 01:17:19,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447252524] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:17:19,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749347353] [2025-04-14 01:17:19,498 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:17:19,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:17:19,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:17:19,501 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:17:19,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:17:19,545 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:19,564 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:17:19,564 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:17:19,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:19,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:17:19,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:17:19,587 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:17:19,754 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-14 01:17:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:19,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:17:20,874 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-14 01:17:20,877 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-14 01:17:20,957 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-14 01:17:20,960 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-14 01:17:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:21,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749347353] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:17:21,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:17:21,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2025-04-14 01:17:21,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286598904] [2025-04-14 01:17:21,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:17:21,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 01:17:21,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:21,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 01:17:21,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2025-04-14 01:17:21,152 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:21,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 294 transitions, 2666 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-14 01:17:21,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:21,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:21,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:23,732 INFO L116 PetriNetUnfolderBase]: 2197/3315 cut-off events. [2025-04-14 01:17:23,732 INFO L117 PetriNetUnfolderBase]: For 15489/15489 co-relation queries the response was YES. [2025-04-14 01:17:23,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15544 conditions, 3315 events. 2197/3315 cut-off events. For 15489/15489 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 16574 event pairs, 92 based on Foata normal form. 2/3046 useless extension candidates. Maximal degree in co-relation 15406. Up to 1775 conditions per place. [2025-04-14 01:17:23,754 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 192 selfloop transitions, 338 changer transitions 5/535 dead transitions. [2025-04-14 01:17:23,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 535 transitions, 5346 flow [2025-04-14 01:17:23,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-14 01:17:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-14 01:17:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 344 transitions. [2025-04-14 01:17:23,756 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2986111111111111 [2025-04-14 01:17:23,756 INFO L175 Difference]: Start difference. First operand has 134 places, 294 transitions, 2666 flow. Second operand 36 states and 344 transitions. [2025-04-14 01:17:23,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 535 transitions, 5346 flow [2025-04-14 01:17:23,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 535 transitions, 5209 flow, removed 67 selfloop flow, removed 1 redundant places. [2025-04-14 01:17:23,825 INFO L231 Difference]: Finished difference. Result has 182 places, 438 transitions, 4824 flow [2025-04-14 01:17:23,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2549, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=4824, PETRI_PLACES=182, PETRI_TRANSITIONS=438} [2025-04-14 01:17:23,826 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 151 predicate places. [2025-04-14 01:17:23,826 INFO L485 AbstractCegarLoop]: Abstraction has has 182 places, 438 transitions, 4824 flow [2025-04-14 01:17:23,826 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-14 01:17:23,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:23,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:23,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 01:17:24,031 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-14 01:17:24,031 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:24,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:24,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1249954436, now seen corresponding path program 6 times [2025-04-14 01:17:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:24,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505867139] [2025-04-14 01:17:24,032 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:17:24,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:24,037 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:24,042 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:17:24,042 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:17:24,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:24,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:24,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505867139] [2025-04-14 01:17:24,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505867139] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:24,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:24,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:17:24,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115965967] [2025-04-14 01:17:24,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:24,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:17:24,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:24,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:17:24,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:17:24,444 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:24,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 438 transitions, 4824 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:24,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:24,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:24,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:24,953 INFO L116 PetriNetUnfolderBase]: 2249/3414 cut-off events. [2025-04-14 01:17:24,953 INFO L117 PetriNetUnfolderBase]: For 20974/20974 co-relation queries the response was YES. [2025-04-14 01:17:24,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19143 conditions, 3414 events. 2249/3414 cut-off events. For 20974/20974 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 17333 event pairs, 183 based on Foata normal form. 1/3158 useless extension candidates. Maximal degree in co-relation 18980. Up to 3084 conditions per place. [2025-04-14 01:17:24,977 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 356 selfloop transitions, 126 changer transitions 4/486 dead transitions. [2025-04-14 01:17:24,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 486 transitions, 6070 flow [2025-04-14 01:17:24,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:17:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:17:24,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2025-04-14 01:17:24,981 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34375 [2025-04-14 01:17:24,981 INFO L175 Difference]: Start difference. First operand has 182 places, 438 transitions, 4824 flow. Second operand 10 states and 110 transitions. [2025-04-14 01:17:24,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 486 transitions, 6070 flow [2025-04-14 01:17:25,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 486 transitions, 5573 flow, removed 193 selfloop flow, removed 5 redundant places. [2025-04-14 01:17:25,128 INFO L231 Difference]: Finished difference. Result has 189 places, 458 transitions, 4784 flow [2025-04-14 01:17:25,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4339, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4784, PETRI_PLACES=189, PETRI_TRANSITIONS=458} [2025-04-14 01:17:25,129 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 158 predicate places. [2025-04-14 01:17:25,129 INFO L485 AbstractCegarLoop]: Abstraction has has 189 places, 458 transitions, 4784 flow [2025-04-14 01:17:25,130 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:25,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:25,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:25,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:17:25,130 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:25,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:25,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1291405498, now seen corresponding path program 7 times [2025-04-14 01:17:25,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:25,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489081532] [2025-04-14 01:17:25,130 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:17:25,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:25,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:17:25,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:17:25,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:17:25,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:25,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:25,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489081532] [2025-04-14 01:17:25,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489081532] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:25,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:25,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:17:25,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024815585] [2025-04-14 01:17:25,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:25,507 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:17:25,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:25,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:17:25,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:17:25,508 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:25,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 458 transitions, 4784 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:25,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:25,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:25,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:26,110 INFO L116 PetriNetUnfolderBase]: 2295/3491 cut-off events. [2025-04-14 01:17:26,110 INFO L117 PetriNetUnfolderBase]: For 17920/17920 co-relation queries the response was YES. [2025-04-14 01:17:26,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19404 conditions, 3491 events. 2295/3491 cut-off events. For 17920/17920 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 17875 event pairs, 173 based on Foata normal form. 2/3234 useless extension candidates. Maximal degree in co-relation 19230. Up to 3194 conditions per place. [2025-04-14 01:17:26,137 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 384 selfloop transitions, 126 changer transitions 5/515 dead transitions. [2025-04-14 01:17:26,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 515 transitions, 6233 flow [2025-04-14 01:17:26,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:17:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:17:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 127 transitions. [2025-04-14 01:17:26,138 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30528846153846156 [2025-04-14 01:17:26,138 INFO L175 Difference]: Start difference. First operand has 189 places, 458 transitions, 4784 flow. Second operand 13 states and 127 transitions. [2025-04-14 01:17:26,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 515 transitions, 6233 flow [2025-04-14 01:17:26,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 515 transitions, 6079 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-04-14 01:17:26,296 INFO L231 Difference]: Finished difference. Result has 201 places, 486 transitions, 5313 flow [2025-04-14 01:17:26,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4638, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5313, PETRI_PLACES=201, PETRI_TRANSITIONS=486} [2025-04-14 01:17:26,298 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 170 predicate places. [2025-04-14 01:17:26,298 INFO L485 AbstractCegarLoop]: Abstraction has has 201 places, 486 transitions, 5313 flow [2025-04-14 01:17:26,298 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:26,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:26,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:26,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 01:17:26,299 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:26,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:26,299 INFO L85 PathProgramCache]: Analyzing trace with hash 254497382, now seen corresponding path program 8 times [2025-04-14 01:17:26,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:26,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661447889] [2025-04-14 01:17:26,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:17:26,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:26,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:26,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:17:26,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:17:26,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:26,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:26,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661447889] [2025-04-14 01:17:26,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661447889] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:26,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:26,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:17:26,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122920141] [2025-04-14 01:17:26,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:26,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:17:26,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:26,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:17:26,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:17:26,609 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:26,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 486 transitions, 5313 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:26,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:26,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:26,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:27,143 INFO L116 PetriNetUnfolderBase]: 2346/3584 cut-off events. [2025-04-14 01:17:27,143 INFO L117 PetriNetUnfolderBase]: For 20632/20632 co-relation queries the response was YES. [2025-04-14 01:17:27,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20631 conditions, 3584 events. 2346/3584 cut-off events. For 20632/20632 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 18588 event pairs, 215 based on Foata normal form. 1/3390 useless extension candidates. Maximal degree in co-relation 20442. Up to 3160 conditions per place. [2025-04-14 01:17:27,167 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 383 selfloop transitions, 150 changer transitions 4/537 dead transitions. [2025-04-14 01:17:27,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 537 transitions, 6718 flow [2025-04-14 01:17:27,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:17:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:17:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2025-04-14 01:17:27,168 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35625 [2025-04-14 01:17:27,168 INFO L175 Difference]: Start difference. First operand has 201 places, 486 transitions, 5313 flow. Second operand 10 states and 114 transitions. [2025-04-14 01:17:27,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 537 transitions, 6718 flow [2025-04-14 01:17:27,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 537 transitions, 6550 flow, removed 59 selfloop flow, removed 2 redundant places. [2025-04-14 01:17:27,313 INFO L231 Difference]: Finished difference. Result has 211 places, 503 transitions, 5703 flow [2025-04-14 01:17:27,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5145, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5703, PETRI_PLACES=211, PETRI_TRANSITIONS=503} [2025-04-14 01:17:27,314 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 180 predicate places. [2025-04-14 01:17:27,314 INFO L485 AbstractCegarLoop]: Abstraction has has 211 places, 503 transitions, 5703 flow [2025-04-14 01:17:27,314 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:27,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:27,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:27,314 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 01:17:27,315 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:27,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash 371550066, now seen corresponding path program 9 times [2025-04-14 01:17:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:27,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679830985] [2025-04-14 01:17:27,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:17:27,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:27,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:27,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:17:27,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:17:27,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:27,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:27,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679830985] [2025-04-14 01:17:27,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679830985] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:27,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:27,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:17:27,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601142952] [2025-04-14 01:17:27,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:27,624 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:17:27,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:27,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:17:27,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:17:27,625 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:27,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 503 transitions, 5703 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:27,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:27,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:27,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:28,185 INFO L116 PetriNetUnfolderBase]: 2477/3795 cut-off events. [2025-04-14 01:17:28,185 INFO L117 PetriNetUnfolderBase]: For 24168/24168 co-relation queries the response was YES. [2025-04-14 01:17:28,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22473 conditions, 3795 events. 2477/3795 cut-off events. For 24168/24168 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 20009 event pairs, 228 based on Foata normal form. 1/3605 useless extension candidates. Maximal degree in co-relation 22266. Up to 3324 conditions per place. [2025-04-14 01:17:28,208 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 402 selfloop transitions, 166 changer transitions 5/573 dead transitions. [2025-04-14 01:17:28,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 573 transitions, 7418 flow [2025-04-14 01:17:28,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:17:28,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:17:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2025-04-14 01:17:28,210 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.365625 [2025-04-14 01:17:28,210 INFO L175 Difference]: Start difference. First operand has 211 places, 503 transitions, 5703 flow. Second operand 10 states and 117 transitions. [2025-04-14 01:17:28,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 573 transitions, 7418 flow [2025-04-14 01:17:28,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 573 transitions, 7206 flow, removed 27 selfloop flow, removed 5 redundant places. [2025-04-14 01:17:28,363 INFO L231 Difference]: Finished difference. Result has 218 places, 535 transitions, 6286 flow [2025-04-14 01:17:28,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5491, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6286, PETRI_PLACES=218, PETRI_TRANSITIONS=535} [2025-04-14 01:17:28,365 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 187 predicate places. [2025-04-14 01:17:28,365 INFO L485 AbstractCegarLoop]: Abstraction has has 218 places, 535 transitions, 6286 flow [2025-04-14 01:17:28,366 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:28,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:28,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:28,366 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 01:17:28,367 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:28,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash 784986006, now seen corresponding path program 10 times [2025-04-14 01:17:28,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:28,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711336967] [2025-04-14 01:17:28,367 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:17:28,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:28,371 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:28,381 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:17:28,382 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:17:28,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:28,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:28,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711336967] [2025-04-14 01:17:28,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711336967] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:28,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:28,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:17:28,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434163570] [2025-04-14 01:17:28,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:28,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:17:28,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:28,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:17:28,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:17:28,765 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:28,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 535 transitions, 6286 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:28,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:28,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:28,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:29,481 INFO L116 PetriNetUnfolderBase]: 2494/3821 cut-off events. [2025-04-14 01:17:29,482 INFO L117 PetriNetUnfolderBase]: For 26714/26714 co-relation queries the response was YES. [2025-04-14 01:17:29,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23437 conditions, 3821 events. 2494/3821 cut-off events. For 26714/26714 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 20184 event pairs, 242 based on Foata normal form. 1/3639 useless extension candidates. Maximal degree in co-relation 23232. Up to 3537 conditions per place. [2025-04-14 01:17:29,511 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 447 selfloop transitions, 120 changer transitions 5/572 dead transitions. [2025-04-14 01:17:29,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 572 transitions, 7628 flow [2025-04-14 01:17:29,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:17:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:17:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2025-04-14 01:17:29,512 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.346875 [2025-04-14 01:17:29,512 INFO L175 Difference]: Start difference. First operand has 218 places, 535 transitions, 6286 flow. Second operand 10 states and 111 transitions. [2025-04-14 01:17:29,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 572 transitions, 7628 flow [2025-04-14 01:17:29,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 572 transitions, 7339 flow, removed 63 selfloop flow, removed 6 redundant places. [2025-04-14 01:17:29,677 INFO L231 Difference]: Finished difference. Result has 224 places, 545 transitions, 6389 flow [2025-04-14 01:17:29,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5997, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6389, PETRI_PLACES=224, PETRI_TRANSITIONS=545} [2025-04-14 01:17:29,678 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 193 predicate places. [2025-04-14 01:17:29,678 INFO L485 AbstractCegarLoop]: Abstraction has has 224 places, 545 transitions, 6389 flow [2025-04-14 01:17:29,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:29,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:29,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:29,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 01:17:29,678 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:29,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:29,679 INFO L85 PathProgramCache]: Analyzing trace with hash -60211666, now seen corresponding path program 11 times [2025-04-14 01:17:29,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:29,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13154937] [2025-04-14 01:17:29,679 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:17:29,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:29,683 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:29,688 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:17:29,688 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:17:29,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:30,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:30,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:30,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13154937] [2025-04-14 01:17:30,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13154937] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:17:30,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790562815] [2025-04-14 01:17:30,070 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:17:30,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:17:30,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:17:30,072 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:17:30,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 01:17:30,110 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:30,124 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:17:30,124 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:17:30,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:30,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:17:30,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:17:30,145 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:17:30,288 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:17:30,288 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-14 01:17:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:30,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:17:31,297 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-14 01:17:31,299 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-14 01:17:31,368 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-14 01:17:31,373 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-14 01:17:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:31,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790562815] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:17:31,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:17:31,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 24 [2025-04-14 01:17:31,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62580070] [2025-04-14 01:17:31,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:17:31,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 01:17:31,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:31,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 01:17:31,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2025-04-14 01:17:31,435 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:31,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 545 transitions, 6389 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-14 01:17:31,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:31,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:31,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:34,513 INFO L116 PetriNetUnfolderBase]: 3431/5219 cut-off events. [2025-04-14 01:17:34,514 INFO L117 PetriNetUnfolderBase]: For 38677/38677 co-relation queries the response was YES. [2025-04-14 01:17:34,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32485 conditions, 5219 events. 3431/5219 cut-off events. For 38677/38677 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 28971 event pairs, 148 based on Foata normal form. 1/4980 useless extension candidates. Maximal degree in co-relation 32263. Up to 2205 conditions per place. [2025-04-14 01:17:34,555 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 265 selfloop transitions, 711 changer transitions 7/983 dead transitions. [2025-04-14 01:17:34,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 983 transitions, 12825 flow [2025-04-14 01:17:34,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-14 01:17:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-04-14 01:17:34,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 413 transitions. [2025-04-14 01:17:34,567 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31478658536585363 [2025-04-14 01:17:34,567 INFO L175 Difference]: Start difference. First operand has 224 places, 545 transitions, 6389 flow. Second operand 41 states and 413 transitions. [2025-04-14 01:17:34,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 983 transitions, 12825 flow [2025-04-14 01:17:34,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 983 transitions, 12622 flow, removed 35 selfloop flow, removed 4 redundant places. [2025-04-14 01:17:34,861 INFO L231 Difference]: Finished difference. Result has 277 places, 852 transitions, 12150 flow [2025-04-14 01:17:34,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6220, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=429, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=12150, PETRI_PLACES=277, PETRI_TRANSITIONS=852} [2025-04-14 01:17:34,861 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 246 predicate places. [2025-04-14 01:17:34,861 INFO L485 AbstractCegarLoop]: Abstraction has has 277 places, 852 transitions, 12150 flow [2025-04-14 01:17:34,862 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-14 01:17:34,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:34,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:34,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 01:17:35,063 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:17:35,063 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:35,063 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:35,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1042480096, now seen corresponding path program 12 times [2025-04-14 01:17:35,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:35,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343813289] [2025-04-14 01:17:35,064 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:17:35,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:35,067 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:35,071 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:17:35,071 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:17:35,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:35,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:35,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343813289] [2025-04-14 01:17:35,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343813289] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:35,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:35,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:17:35,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568962319] [2025-04-14 01:17:35,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:35,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:17:35,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:35,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:17:35,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:17:35,379 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:35,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 852 transitions, 12150 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:35,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:35,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:35,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:36,513 INFO L116 PetriNetUnfolderBase]: 3666/5569 cut-off events. [2025-04-14 01:17:36,513 INFO L117 PetriNetUnfolderBase]: For 58653/58653 co-relation queries the response was YES. [2025-04-14 01:17:36,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41353 conditions, 5569 events. 3666/5569 cut-off events. For 58653/58653 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 31229 event pairs, 230 based on Foata normal form. 1/5310 useless extension candidates. Maximal degree in co-relation 41115. Up to 4395 conditions per place. [2025-04-14 01:17:36,557 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 564 selfloop transitions, 431 changer transitions 4/999 dead transitions. [2025-04-14 01:17:36,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 999 transitions, 15952 flow [2025-04-14 01:17:36,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 01:17:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 01:17:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2025-04-14 01:17:36,558 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.345703125 [2025-04-14 01:17:36,558 INFO L175 Difference]: Start difference. First operand has 277 places, 852 transitions, 12150 flow. Second operand 16 states and 177 transitions. [2025-04-14 01:17:36,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 999 transitions, 15952 flow [2025-04-14 01:17:37,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 999 transitions, 14725 flow, removed 580 selfloop flow, removed 7 redundant places. [2025-04-14 01:17:37,292 INFO L231 Difference]: Finished difference. Result has 292 places, 945 transitions, 14113 flow [2025-04-14 01:17:37,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=11162, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=852, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=340, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=14113, PETRI_PLACES=292, PETRI_TRANSITIONS=945} [2025-04-14 01:17:37,293 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 261 predicate places. [2025-04-14 01:17:37,293 INFO L485 AbstractCegarLoop]: Abstraction has has 292 places, 945 transitions, 14113 flow [2025-04-14 01:17:37,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:37,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:37,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:37,293 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 01:17:37,293 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:37,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:37,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1493330998, now seen corresponding path program 13 times [2025-04-14 01:17:37,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:37,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497010633] [2025-04-14 01:17:37,294 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:17:37,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:37,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:17:37,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:17:37,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:17:37,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:37,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:37,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:37,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497010633] [2025-04-14 01:17:37,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497010633] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:17:37,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132229553] [2025-04-14 01:17:37,650 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:17:37,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:17:37,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:17:37,652 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:17:37,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 01:17:37,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:17:37,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:17:37,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:17:37,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:37,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:17:37,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:17:37,731 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:17:37,867 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:17:37,868 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-14 01:17:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:37,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:17:39,035 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-14 01:17:39,037 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-14 01:17:39,084 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-14 01:17:39,087 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-14 01:17:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:39,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132229553] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:17:39,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:17:39,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 24 [2025-04-14 01:17:39,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848056196] [2025-04-14 01:17:39,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:17:39,113 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 01:17:39,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:39,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 01:17:39,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2025-04-14 01:17:39,114 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:39,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 945 transitions, 14113 flow. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:39,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:39,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:39,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:43,437 INFO L116 PetriNetUnfolderBase]: 5328/8043 cut-off events. [2025-04-14 01:17:43,437 INFO L117 PetriNetUnfolderBase]: For 76252/76252 co-relation queries the response was YES. [2025-04-14 01:17:43,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59670 conditions, 8043 events. 5328/8043 cut-off events. For 76252/76252 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 47757 event pairs, 115 based on Foata normal form. 1/7639 useless extension candidates. Maximal degree in co-relation 59411. Up to 3758 conditions per place. [2025-04-14 01:17:43,519 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 275 selfloop transitions, 1360 changer transitions 4/1639 dead transitions. [2025-04-14 01:17:43,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 1639 transitions, 26058 flow [2025-04-14 01:17:43,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-14 01:17:43,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-04-14 01:17:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 530 transitions. [2025-04-14 01:17:43,521 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3247549019607843 [2025-04-14 01:17:43,521 INFO L175 Difference]: Start difference. First operand has 292 places, 945 transitions, 14113 flow. Second operand 51 states and 530 transitions. [2025-04-14 01:17:43,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 1639 transitions, 26058 flow [2025-04-14 01:17:44,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 1639 transitions, 25839 flow, removed 98 selfloop flow, removed 2 redundant places. [2025-04-14 01:17:44,531 INFO L231 Difference]: Finished difference. Result has 356 places, 1504 transitions, 26020 flow [2025-04-14 01:17:44,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=13950, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=832, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=26020, PETRI_PLACES=356, PETRI_TRANSITIONS=1504} [2025-04-14 01:17:44,532 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 325 predicate places. [2025-04-14 01:17:44,532 INFO L485 AbstractCegarLoop]: Abstraction has has 356 places, 1504 transitions, 26020 flow [2025-04-14 01:17:44,532 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:44,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:44,533 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:44,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 01:17:44,733 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-14 01:17:44,733 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:44,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:44,734 INFO L85 PathProgramCache]: Analyzing trace with hash 648606366, now seen corresponding path program 14 times [2025-04-14 01:17:44,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:44,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401342303] [2025-04-14 01:17:44,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:17:44,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:44,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:44,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:17:44,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:17:44,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:44,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:44,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401342303] [2025-04-14 01:17:44,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401342303] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:44,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:44,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:17:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133434469] [2025-04-14 01:17:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:44,996 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:17:44,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:44,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:17:44,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:17:44,997 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:44,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 1504 transitions, 26020 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:44,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:44,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:44,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:47,096 INFO L116 PetriNetUnfolderBase]: 5319/8028 cut-off events. [2025-04-14 01:17:47,096 INFO L117 PetriNetUnfolderBase]: For 93945/93945 co-relation queries the response was YES. [2025-04-14 01:17:47,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69027 conditions, 8028 events. 5319/8028 cut-off events. For 93945/93945 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 47514 event pairs, 376 based on Foata normal form. 1/7631 useless extension candidates. Maximal degree in co-relation 68758. Up to 7757 conditions per place. [2025-04-14 01:17:47,194 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1382 selfloop transitions, 143 changer transitions 4/1529 dead transitions. [2025-04-14 01:17:47,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 1529 transitions, 29284 flow [2025-04-14 01:17:47,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:17:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:17:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2025-04-14 01:17:47,195 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2025-04-14 01:17:47,195 INFO L175 Difference]: Start difference. First operand has 356 places, 1504 transitions, 26020 flow. Second operand 11 states and 108 transitions. [2025-04-14 01:17:47,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 1529 transitions, 29284 flow [2025-04-14 01:17:49,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 1529 transitions, 26977 flow, removed 937 selfloop flow, removed 14 redundant places. [2025-04-14 01:17:49,305 INFO L231 Difference]: Finished difference. Result has 355 places, 1509 transitions, 24138 flow [2025-04-14 01:17:49,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=23704, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=24138, PETRI_PLACES=355, PETRI_TRANSITIONS=1509} [2025-04-14 01:17:49,306 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 324 predicate places. [2025-04-14 01:17:49,306 INFO L485 AbstractCegarLoop]: Abstraction has has 355 places, 1509 transitions, 24138 flow [2025-04-14 01:17:49,306 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:49,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:49,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:49,306 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 01:17:49,306 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:49,307 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:49,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2047222922, now seen corresponding path program 15 times [2025-04-14 01:17:49,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:49,307 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010485549] [2025-04-14 01:17:49,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:17:49,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:49,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:49,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:17:49,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:17:49,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:49,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:49,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:49,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010485549] [2025-04-14 01:17:49,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010485549] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:49,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:49,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:17:49,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891868009] [2025-04-14 01:17:49,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:49,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:17:49,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:49,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:17:49,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:17:49,525 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:49,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 1509 transitions, 24138 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:49,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:49,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:49,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:51,426 INFO L116 PetriNetUnfolderBase]: 5401/8168 cut-off events. [2025-04-14 01:17:51,426 INFO L117 PetriNetUnfolderBase]: For 56724/56724 co-relation queries the response was YES. [2025-04-14 01:17:51,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62862 conditions, 8168 events. 5401/8168 cut-off events. For 56724/56724 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 48647 event pairs, 366 based on Foata normal form. 1/7677 useless extension candidates. Maximal degree in co-relation 62662. Up to 7802 conditions per place. [2025-04-14 01:17:51,632 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1404 selfloop transitions, 165 changer transitions 3/1572 dead transitions. [2025-04-14 01:17:51,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 1572 transitions, 27839 flow [2025-04-14 01:17:51,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:17:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:17:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 126 transitions. [2025-04-14 01:17:51,633 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30288461538461536 [2025-04-14 01:17:51,633 INFO L175 Difference]: Start difference. First operand has 355 places, 1509 transitions, 24138 flow. Second operand 13 states and 126 transitions. [2025-04-14 01:17:51,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 1572 transitions, 27839 flow [2025-04-14 01:17:52,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 1572 transitions, 27524 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-04-14 01:17:52,685 INFO L231 Difference]: Finished difference. Result has 367 places, 1536 transitions, 24675 flow [2025-04-14 01:17:52,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=23823, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=24675, PETRI_PLACES=367, PETRI_TRANSITIONS=1536} [2025-04-14 01:17:52,686 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 336 predicate places. [2025-04-14 01:17:52,686 INFO L485 AbstractCegarLoop]: Abstraction has has 367 places, 1536 transitions, 24675 flow [2025-04-14 01:17:52,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:52,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:52,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:52,686 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 01:17:52,686 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:52,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:52,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1467625852, now seen corresponding path program 16 times [2025-04-14 01:17:52,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:52,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916788940] [2025-04-14 01:17:52,687 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:17:52,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:52,692 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:52,698 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:17:52,698 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:17:52,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:52,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:52,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916788940] [2025-04-14 01:17:52,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916788940] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:52,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:52,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:17:52,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918439316] [2025-04-14 01:17:52,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:52,958 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:17:52,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:52,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:17:52,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:17:52,958 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:52,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 1536 transitions, 24675 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:52,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:52,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:52,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:55,178 INFO L116 PetriNetUnfolderBase]: 5437/8222 cut-off events. [2025-04-14 01:17:55,178 INFO L117 PetriNetUnfolderBase]: For 59892/59892 co-relation queries the response was YES. [2025-04-14 01:17:55,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64099 conditions, 8222 events. 5437/8222 cut-off events. For 59892/59892 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 48962 event pairs, 414 based on Foata normal form. 1/7727 useless extension candidates. Maximal degree in co-relation 63909. Up to 7922 conditions per place. [2025-04-14 01:17:55,270 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1439 selfloop transitions, 129 changer transitions 4/1572 dead transitions. [2025-04-14 01:17:55,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 1572 transitions, 28133 flow [2025-04-14 01:17:55,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:17:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:17:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2025-04-14 01:17:55,271 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.325 [2025-04-14 01:17:55,271 INFO L175 Difference]: Start difference. First operand has 367 places, 1536 transitions, 24675 flow. Second operand 10 states and 104 transitions. [2025-04-14 01:17:55,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 1572 transitions, 28133 flow [2025-04-14 01:17:56,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 1572 transitions, 27844 flow, removed 45 selfloop flow, removed 5 redundant places. [2025-04-14 01:17:56,592 INFO L231 Difference]: Finished difference. Result has 373 places, 1550 transitions, 24886 flow [2025-04-14 01:17:56,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=24386, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=24886, PETRI_PLACES=373, PETRI_TRANSITIONS=1550} [2025-04-14 01:17:56,594 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 342 predicate places. [2025-04-14 01:17:56,594 INFO L485 AbstractCegarLoop]: Abstraction has has 373 places, 1550 transitions, 24886 flow [2025-04-14 01:17:56,594 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:56,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:56,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:56,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 01:17:56,594 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:56,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:56,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1827203358, now seen corresponding path program 17 times [2025-04-14 01:17:56,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:56,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96102585] [2025-04-14 01:17:56,595 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:17:56,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:56,598 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:56,602 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:17:56,602 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:17:56,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:56,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:56,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96102585] [2025-04-14 01:17:56,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96102585] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:17:56,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826446814] [2025-04-14 01:17:56,882 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:17:56,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:17:56,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:17:56,884 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:17:56,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 01:17:56,920 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:17:56,933 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:17:56,933 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:17:56,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:56,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:17:56,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:17:56,946 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:17:57,039 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 54 treesize of output 30 [2025-04-14 01:17:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:57,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:17:57,927 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-14 01:17:57,928 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-14 01:17:58,014 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-14 01:17:58,017 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-14 01:17:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:17:58,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826446814] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:17:58,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:17:58,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 21 [2025-04-14 01:17:58,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750969167] [2025-04-14 01:17:58,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:17:58,049 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 01:17:58,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:58,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 01:17:58,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2025-04-14 01:17:58,049 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:58,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 1550 transitions, 24886 flow. Second operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:58,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:58,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:58,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:00,969 INFO L116 PetriNetUnfolderBase]: 5629/8598 cut-off events. [2025-04-14 01:18:00,969 INFO L117 PetriNetUnfolderBase]: For 62233/62233 co-relation queries the response was YES. [2025-04-14 01:18:01,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66522 conditions, 8598 events. 5629/8598 cut-off events. For 62233/62233 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 52726 event pairs, 234 based on Foata normal form. 1/8067 useless extension candidates. Maximal degree in co-relation 66331. Up to 6090 conditions per place. [2025-04-14 01:18:01,048 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 1075 selfloop transitions, 669 changer transitions 5/1749 dead transitions. [2025-04-14 01:18:01,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 1749 transitions, 30641 flow [2025-04-14 01:18:01,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-14 01:18:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-14 01:18:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 223 transitions. [2025-04-14 01:18:01,049 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3029891304347826 [2025-04-14 01:18:01,049 INFO L175 Difference]: Start difference. First operand has 373 places, 1550 transitions, 24886 flow. Second operand 23 states and 223 transitions. [2025-04-14 01:18:01,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 1749 transitions, 30641 flow [2025-04-14 01:18:02,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 1749 transitions, 30371 flow, removed 74 selfloop flow, removed 4 redundant places. [2025-04-14 01:18:02,322 INFO L231 Difference]: Finished difference. Result has 401 places, 1647 transitions, 28080 flow [2025-04-14 01:18:02,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=24654, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=577, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=920, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=28080, PETRI_PLACES=401, PETRI_TRANSITIONS=1647} [2025-04-14 01:18:02,323 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 370 predicate places. [2025-04-14 01:18:02,323 INFO L485 AbstractCegarLoop]: Abstraction has has 401 places, 1647 transitions, 28080 flow [2025-04-14 01:18:02,324 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:02,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:02,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:02,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 01:18:02,528 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-14 01:18:02,528 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:18:02,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:02,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1504973700, now seen corresponding path program 18 times [2025-04-14 01:18:02,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:02,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730275860] [2025-04-14 01:18:02,528 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:18:02,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:02,532 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:02,534 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:02,534 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:18:02,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:02,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:02,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730275860] [2025-04-14 01:18:02,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730275860] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:02,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:02,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:02,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749363291] [2025-04-14 01:18:02,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:02,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:02,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:02,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:02,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:02,860 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:02,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 1647 transitions, 28080 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:02,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:02,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:02,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:05,374 INFO L116 PetriNetUnfolderBase]: 5880/8966 cut-off events. [2025-04-14 01:18:05,374 INFO L117 PetriNetUnfolderBase]: For 78881/78881 co-relation queries the response was YES. [2025-04-14 01:18:05,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74542 conditions, 8966 events. 5880/8966 cut-off events. For 78881/78881 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 55243 event pairs, 305 based on Foata normal form. 1/8403 useless extension candidates. Maximal degree in co-relation 74340. Up to 7089 conditions per place. [2025-04-14 01:18:05,460 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 1158 selfloop transitions, 682 changer transitions 7/1847 dead transitions. [2025-04-14 01:18:05,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 1847 transitions, 34432 flow [2025-04-14 01:18:05,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 01:18:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 01:18:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 187 transitions. [2025-04-14 01:18:05,461 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34375 [2025-04-14 01:18:05,461 INFO L175 Difference]: Start difference. First operand has 401 places, 1647 transitions, 28080 flow. Second operand 17 states and 187 transitions. [2025-04-14 01:18:05,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 1847 transitions, 34432 flow [2025-04-14 01:18:07,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 1847 transitions, 33825 flow, removed 196 selfloop flow, removed 10 redundant places. [2025-04-14 01:18:07,070 INFO L231 Difference]: Finished difference. Result has 417 places, 1782 transitions, 32328 flow [2025-04-14 01:18:07,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=27527, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=563, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=32328, PETRI_PLACES=417, PETRI_TRANSITIONS=1782} [2025-04-14 01:18:07,071 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 386 predicate places. [2025-04-14 01:18:07,071 INFO L485 AbstractCegarLoop]: Abstraction has has 417 places, 1782 transitions, 32328 flow [2025-04-14 01:18:07,071 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:07,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:07,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:07,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 01:18:07,071 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:18:07,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:07,072 INFO L85 PathProgramCache]: Analyzing trace with hash -279580762, now seen corresponding path program 19 times [2025-04-14 01:18:07,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:07,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302902175] [2025-04-14 01:18:07,072 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:18:07,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:07,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:18:07,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:07,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:07,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:07,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:07,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302902175] [2025-04-14 01:18:07,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302902175] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:07,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103211781] [2025-04-14 01:18:07,468 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:18:07,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:07,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:07,469 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:18:07,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 01:18:07,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:18:07,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:07,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:07,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:07,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:18:07,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:07,541 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:18:07,680 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-14 01:18:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:07,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:08,830 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-14 01:18:08,833 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-14 01:18:08,929 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 98 [2025-04-14 01:18:08,932 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-14 01:18:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:08,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103211781] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:08,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:08,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 25 [2025-04-14 01:18:08,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154738658] [2025-04-14 01:18:08,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:08,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 01:18:08,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:08,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 01:18:08,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2025-04-14 01:18:08,958 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:08,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 1782 transitions, 32328 flow. Second operand has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:08,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:08,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:08,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:12,934 INFO L116 PetriNetUnfolderBase]: 6501/9932 cut-off events. [2025-04-14 01:18:12,935 INFO L117 PetriNetUnfolderBase]: For 98276/98276 co-relation queries the response was YES. [2025-04-14 01:18:13,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85513 conditions, 9932 events. 6501/9932 cut-off events. For 98276/98276 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 62255 event pairs, 183 based on Foata normal form. 1/9295 useless extension candidates. Maximal degree in co-relation 85302. Up to 5152 conditions per place. [2025-04-14 01:18:13,047 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1017 selfloop transitions, 1092 changer transitions 6/2115 dead transitions. [2025-04-14 01:18:13,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 2115 transitions, 41024 flow [2025-04-14 01:18:13,047 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 01:18:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 01:18:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 249 transitions. [2025-04-14 01:18:13,048 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31125 [2025-04-14 01:18:13,048 INFO L175 Difference]: Start difference. First operand has 417 places, 1782 transitions, 32328 flow. Second operand 25 states and 249 transitions. [2025-04-14 01:18:13,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 2115 transitions, 41024 flow [2025-04-14 01:18:15,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 2115 transitions, 40396 flow, removed 206 selfloop flow, removed 6 redundant places. [2025-04-14 01:18:15,335 INFO L231 Difference]: Finished difference. Result has 444 places, 1988 transitions, 38492 flow [2025-04-14 01:18:15,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=31800, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1782, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=902, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=774, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=38492, PETRI_PLACES=444, PETRI_TRANSITIONS=1988} [2025-04-14 01:18:15,337 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 413 predicate places. [2025-04-14 01:18:15,337 INFO L485 AbstractCegarLoop]: Abstraction has has 444 places, 1988 transitions, 38492 flow [2025-04-14 01:18:15,337 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:15,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:15,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:15,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 01:18:15,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:15,538 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:18:15,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:15,539 INFO L85 PathProgramCache]: Analyzing trace with hash 368696362, now seen corresponding path program 20 times [2025-04-14 01:18:15,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:15,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436481545] [2025-04-14 01:18:15,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:18:15,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:15,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:15,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:15,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:18:15,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:15,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:15,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436481545] [2025-04-14 01:18:15,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436481545] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:15,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:15,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:18:15,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328667085] [2025-04-14 01:18:15,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:15,771 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:18:15,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:15,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:18:15,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:18:15,771 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:15,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 1988 transitions, 38492 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:15,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:15,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:15,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:19,162 INFO L116 PetriNetUnfolderBase]: 6533/9979 cut-off events. [2025-04-14 01:18:19,162 INFO L117 PetriNetUnfolderBase]: For 116230/116230 co-relation queries the response was YES. [2025-04-14 01:18:19,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93540 conditions, 9979 events. 6533/9979 cut-off events. For 116230/116230 co-relation queries the response was YES. Maximal size of possible extension queue 843. Compared 62551 event pairs, 480 based on Foata normal form. 1/9336 useless extension candidates. Maximal degree in co-relation 93314. Up to 9654 conditions per place. [2025-04-14 01:18:19,277 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1883 selfloop transitions, 133 changer transitions 1/2017 dead transitions. [2025-04-14 01:18:19,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 2017 transitions, 42826 flow [2025-04-14 01:18:19,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:18:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:18:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2025-04-14 01:18:19,278 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.315625 [2025-04-14 01:18:19,278 INFO L175 Difference]: Start difference. First operand has 444 places, 1988 transitions, 38492 flow. Second operand 10 states and 101 transitions. [2025-04-14 01:18:19,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 2017 transitions, 42826 flow [2025-04-14 01:18:21,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 2017 transitions, 42003 flow, removed 275 selfloop flow, removed 12 redundant places. [2025-04-14 01:18:21,816 INFO L231 Difference]: Finished difference. Result has 444 places, 1997 transitions, 38166 flow [2025-04-14 01:18:21,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=37695, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1988, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1855, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=38166, PETRI_PLACES=444, PETRI_TRANSITIONS=1997} [2025-04-14 01:18:21,818 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 413 predicate places. [2025-04-14 01:18:21,818 INFO L485 AbstractCegarLoop]: Abstraction has has 444 places, 1997 transitions, 38166 flow [2025-04-14 01:18:21,818 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:21,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:21,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-14 01:18:21,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-14 01:18:21,818 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:18:21,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1621910454, now seen corresponding path program 21 times [2025-04-14 01:18:21,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:21,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460973922] [2025-04-14 01:18:21,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:18:21,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:21,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:21,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:21,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:18:21,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:22,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:22,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460973922] [2025-04-14 01:18:22,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460973922] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:22,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:22,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:22,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902511071] [2025-04-14 01:18:22,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:22,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:22,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:22,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:22,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:22,138 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:22,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 1997 transitions, 38166 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:22,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:22,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:22,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:25,892 INFO L116 PetriNetUnfolderBase]: 6967/10633 cut-off events. [2025-04-14 01:18:25,892 INFO L117 PetriNetUnfolderBase]: For 114386/114386 co-relation queries the response was YES. [2025-04-14 01:18:25,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98317 conditions, 10633 events. 6967/10633 cut-off events. For 114386/114386 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 67361 event pairs, 458 based on Foata normal form. 2/9971 useless extension candidates. Maximal degree in co-relation 97855. Up to 9130 conditions per place. [2025-04-14 01:18:26,018 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 1529 selfloop transitions, 714 changer transitions 4/2247 dead transitions. [2025-04-14 01:18:26,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 2247 transitions, 46789 flow [2025-04-14 01:18:26,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-14 01:18:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-14 01:18:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 225 transitions. [2025-04-14 01:18:26,019 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30570652173913043 [2025-04-14 01:18:26,019 INFO L175 Difference]: Start difference. First operand has 444 places, 1997 transitions, 38166 flow. Second operand 23 states and 225 transitions. [2025-04-14 01:18:26,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 2247 transitions, 46789 flow [2025-04-14 01:18:28,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 2247 transitions, 46433 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-04-14 01:18:28,789 INFO L231 Difference]: Finished difference. Result has 468 places, 2197 transitions, 44140 flow [2025-04-14 01:18:28,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=37825, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1997, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=532, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=44140, PETRI_PLACES=468, PETRI_TRANSITIONS=2197} [2025-04-14 01:18:28,791 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 437 predicate places. [2025-04-14 01:18:28,791 INFO L485 AbstractCegarLoop]: Abstraction has has 468 places, 2197 transitions, 44140 flow [2025-04-14 01:18:28,792 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:28,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:28,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:28,792 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-14 01:18:28,793 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:18:28,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1868998926, now seen corresponding path program 22 times [2025-04-14 01:18:28,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:28,794 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882812405] [2025-04-14 01:18:28,794 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:18:28,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:28,799 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:28,804 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:28,804 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:18:28,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:29,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:29,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882812405] [2025-04-14 01:18:29,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882812405] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:29,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:29,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:18:29,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667819003] [2025-04-14 01:18:29,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:29,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:18:29,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:29,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:18:29,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:18:29,098 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:29,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 2197 transitions, 44140 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:29,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:29,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:29,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:33,503 INFO L116 PetriNetUnfolderBase]: 7609/11622 cut-off events. [2025-04-14 01:18:33,503 INFO L117 PetriNetUnfolderBase]: For 136087/136087 co-relation queries the response was YES. [2025-04-14 01:18:33,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113126 conditions, 11622 events. 7609/11622 cut-off events. For 136087/136087 co-relation queries the response was YES. Maximal size of possible extension queue 989. Compared 74783 event pairs, 448 based on Foata normal form. 1/10902 useless extension candidates. Maximal degree in co-relation 112626. Up to 9404 conditions per place. [2025-04-14 01:18:33,645 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 1695 selfloop transitions, 855 changer transitions 7/2557 dead transitions. [2025-04-14 01:18:33,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 2557 transitions, 56508 flow [2025-04-14 01:18:33,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-14 01:18:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-14 01:18:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2025-04-14 01:18:33,646 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3179347826086957 [2025-04-14 01:18:33,646 INFO L175 Difference]: Start difference. First operand has 468 places, 2197 transitions, 44140 flow. Second operand 23 states and 234 transitions. [2025-04-14 01:18:33,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 2557 transitions, 56508 flow [2025-04-14 01:18:37,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 2557 transitions, 55594 flow, removed 280 selfloop flow, removed 14 redundant places. [2025-04-14 01:18:37,135 INFO L231 Difference]: Finished difference. Result has 484 places, 2469 transitions, 52439 flow [2025-04-14 01:18:37,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=43406, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=596, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=52439, PETRI_PLACES=484, PETRI_TRANSITIONS=2469} [2025-04-14 01:18:37,137 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 453 predicate places. [2025-04-14 01:18:37,137 INFO L485 AbstractCegarLoop]: Abstraction has has 484 places, 2469 transitions, 52439 flow [2025-04-14 01:18:37,137 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:37,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:37,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:37,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-14 01:18:37,137 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:18:37,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:37,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1706739126, now seen corresponding path program 23 times [2025-04-14 01:18:37,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:37,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886856585] [2025-04-14 01:18:37,138 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:18:37,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:37,144 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:37,148 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:37,148 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:37,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:37,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:37,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886856585] [2025-04-14 01:18:37,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886856585] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:37,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999928844] [2025-04-14 01:18:37,475 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:18:37,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:37,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:37,477 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:18:37,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 01:18:37,514 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:37,526 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:37,526 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:37,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:37,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:18:37,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:37,545 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:18:37,705 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-14 01:18:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:37,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:38,711 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-14 01:18:38,716 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-14 01:18:38,811 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-14 01:18:38,814 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-14 01:18:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:38,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999928844] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:38,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:38,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 25 [2025-04-14 01:18:38,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510763353] [2025-04-14 01:18:38,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:38,849 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 01:18:38,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:38,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 01:18:38,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2025-04-14 01:18:38,850 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:38,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 2469 transitions, 52439 flow. Second operand has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:38,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:38,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:38,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:44,908 INFO L116 PetriNetUnfolderBase]: 7693/11756 cut-off events. [2025-04-14 01:18:44,908 INFO L117 PetriNetUnfolderBase]: For 152044/152044 co-relation queries the response was YES. [2025-04-14 01:18:45,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118435 conditions, 11756 events. 7693/11756 cut-off events. For 152044/152044 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 75878 event pairs, 179 based on Foata normal form. 3/11036 useless extension candidates. Maximal degree in co-relation 117943. Up to 6342 conditions per place. [2025-04-14 01:18:45,058 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1182 selfloop transitions, 1474 changer transitions 2/2658 dead transitions. [2025-04-14 01:18:45,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 2658 transitions, 60052 flow [2025-04-14 01:18:45,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 01:18:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-04-14 01:18:45,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 343 transitions. [2025-04-14 01:18:45,060 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30625 [2025-04-14 01:18:45,060 INFO L175 Difference]: Start difference. First operand has 484 places, 2469 transitions, 52439 flow. Second operand 35 states and 343 transitions. [2025-04-14 01:18:45,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 2658 transitions, 60052 flow [2025-04-14 01:18:48,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 2658 transitions, 59657 flow, removed 114 selfloop flow, removed 4 redundant places. [2025-04-14 01:18:48,690 INFO L231 Difference]: Finished difference. Result has 521 places, 2534 transitions, 56820 flow [2025-04-14 01:18:48,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52018, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1410, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1040, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=56820, PETRI_PLACES=521, PETRI_TRANSITIONS=2534} [2025-04-14 01:18:48,692 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 490 predicate places. [2025-04-14 01:18:48,692 INFO L485 AbstractCegarLoop]: Abstraction has has 521 places, 2534 transitions, 56820 flow [2025-04-14 01:18:48,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:48,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:48,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:48,699 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-14 01:18:48,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:48,893 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:18:48,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:48,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1561354322, now seen corresponding path program 24 times [2025-04-14 01:18:48,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:48,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008813806] [2025-04-14 01:18:48,894 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:18:48,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:48,898 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:48,902 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:48,902 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:18:48,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:49,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:49,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008813806] [2025-04-14 01:18:49,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008813806] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:49,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:49,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:49,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143012766] [2025-04-14 01:18:49,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:49,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:49,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:49,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:49,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:49,146 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:49,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 2534 transitions, 56820 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:49,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:49,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:49,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:54,934 INFO L116 PetriNetUnfolderBase]: 8714/13302 cut-off events. [2025-04-14 01:18:54,934 INFO L117 PetriNetUnfolderBase]: For 187865/187865 co-relation queries the response was YES. [2025-04-14 01:18:55,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141126 conditions, 13302 events. 8714/13302 cut-off events. For 187865/187865 co-relation queries the response was YES. Maximal size of possible extension queue 1156. Compared 87073 event pairs, 534 based on Foata normal form. 2/12479 useless extension candidates. Maximal degree in co-relation 140604. Up to 10948 conditions per place. [2025-04-14 01:18:55,251 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 2032 selfloop transitions, 986 changer transitions 4/3022 dead transitions. [2025-04-14 01:18:55,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 3022 transitions, 72509 flow [2025-04-14 01:18:55,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 01:18:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 01:18:55,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 211 transitions. [2025-04-14 01:18:55,253 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3296875 [2025-04-14 01:18:55,253 INFO L175 Difference]: Start difference. First operand has 521 places, 2534 transitions, 56820 flow. Second operand 20 states and 211 transitions. [2025-04-14 01:18:55,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 3022 transitions, 72509 flow [2025-04-14 01:19:00,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 3022 transitions, 71332 flow, removed 352 selfloop flow, removed 15 redundant places. [2025-04-14 01:19:00,467 INFO L231 Difference]: Finished difference. Result has 533 places, 2909 transitions, 67419 flow [2025-04-14 01:19:00,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=55782, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=652, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=67419, PETRI_PLACES=533, PETRI_TRANSITIONS=2909} [2025-04-14 01:19:00,469 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 502 predicate places. [2025-04-14 01:19:00,469 INFO L485 AbstractCegarLoop]: Abstraction has has 533 places, 2909 transitions, 67419 flow [2025-04-14 01:19:00,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:00,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:00,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:00,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-14 01:19:00,469 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:00,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:00,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1555084280, now seen corresponding path program 25 times [2025-04-14 01:19:00,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:00,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787009124] [2025-04-14 01:19:00,470 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:19:00,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:00,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:19:00,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:00,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:00,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:00,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:00,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787009124] [2025-04-14 01:19:00,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787009124] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:00,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995770038] [2025-04-14 01:19:00,740 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:19:00,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:00,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:00,742 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:19:00,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 01:19:00,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:19:00,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:00,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:00,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:00,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:19:00,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:00,809 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:19:00,966 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-14 01:19:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:01,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:02,061 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-14 01:19:02,063 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-14 01:19:02,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 76 treesize of output 66 [2025-04-14 01:19:02,124 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-14 01:19:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:02,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995770038] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:02,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:02,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 24 [2025-04-14 01:19:02,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694516316] [2025-04-14 01:19:02,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:02,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 01:19:02,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:02,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 01:19:02,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2025-04-14 01:19:02,150 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:02,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 2909 transitions, 67419 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-14 01:19:02,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:02,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:02,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:11,309 INFO L116 PetriNetUnfolderBase]: 10287/15691 cut-off events. [2025-04-14 01:19:11,309 INFO L117 PetriNetUnfolderBase]: For 237793/237793 co-relation queries the response was YES. [2025-04-14 01:19:11,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168868 conditions, 15691 events. 10287/15691 cut-off events. For 237793/237793 co-relation queries the response was YES. Maximal size of possible extension queue 1416. Compared 106117 event pairs, 188 based on Foata normal form. 8/14760 useless extension candidates. Maximal degree in co-relation 168316. Up to 7178 conditions per place. [2025-04-14 01:19:11,568 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 943 selfloop transitions, 2657 changer transitions 1/3601 dead transitions. [2025-04-14 01:19:11,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 3601 transitions, 87484 flow [2025-04-14 01:19:11,568 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-14 01:19:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-14 01:19:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 416 transitions. [2025-04-14 01:19:11,570 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.325 [2025-04-14 01:19:11,570 INFO L175 Difference]: Start difference. First operand has 533 places, 2909 transitions, 67419 flow. Second operand 40 states and 416 transitions. [2025-04-14 01:19:11,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 3601 transitions, 87484 flow [2025-04-14 01:19:18,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 3601 transitions, 86580 flow, removed 260 selfloop flow, removed 12 redundant places. [2025-04-14 01:19:18,484 INFO L231 Difference]: Finished difference. Result has 570 places, 3446 transitions, 86558 flow [2025-04-14 01:19:18,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=65718, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2879, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=86558, PETRI_PLACES=570, PETRI_TRANSITIONS=3446} [2025-04-14 01:19:18,487 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 539 predicate places. [2025-04-14 01:19:18,487 INFO L485 AbstractCegarLoop]: Abstraction has has 570 places, 3446 transitions, 86558 flow [2025-04-14 01:19:18,487 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-14 01:19:18,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:18,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:18,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 01:19:18,687 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,SelfDestructingSolverStorable27 [2025-04-14 01:19:18,688 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:18,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:18,688 INFO L85 PathProgramCache]: Analyzing trace with hash 590067990, now seen corresponding path program 26 times [2025-04-14 01:19:18,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:18,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938423695] [2025-04-14 01:19:18,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:19:18,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:18,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:18,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:19:18,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:19:18,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:19:19,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:19,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938423695] [2025-04-14 01:19:19,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938423695] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:19,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:19,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:19:19,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566646039] [2025-04-14 01:19:19,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:19,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:19:19,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:19,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:19:19,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:19:19,076 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:19,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 3446 transitions, 86558 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:19,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:19,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:19,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:27,377 INFO L116 PetriNetUnfolderBase]: 10624/16201 cut-off events. [2025-04-14 01:19:27,378 INFO L117 PetriNetUnfolderBase]: For 284768/284768 co-relation queries the response was YES. [2025-04-14 01:19:27,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190892 conditions, 16201 events. 10624/16201 cut-off events. For 284768/284768 co-relation queries the response was YES. Maximal size of possible extension queue 1462. Compared 109922 event pairs, 543 based on Foata normal form. 2/15224 useless extension candidates. Maximal degree in co-relation 190340. Up to 11301 conditions per place. [2025-04-14 01:19:27,589 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 1937 selfloop transitions, 1727 changer transitions 5/3669 dead transitions. [2025-04-14 01:19:27,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 3669 transitions, 98134 flow [2025-04-14 01:19:27,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 01:19:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 01:19:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2025-04-14 01:19:27,591 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3352272727272727 [2025-04-14 01:19:27,591 INFO L175 Difference]: Start difference. First operand has 570 places, 3446 transitions, 86558 flow. Second operand 22 states and 236 transitions. [2025-04-14 01:19:27,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 3669 transitions, 98134 flow [2025-04-14 01:19:36,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 3669 transitions, 97599 flow, removed 238 selfloop flow, removed 7 redundant places. [2025-04-14 01:19:36,507 INFO L231 Difference]: Finished difference. Result has 592 places, 3592 transitions, 96013 flow [2025-04-14 01:19:36,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=86043, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1590, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=96013, PETRI_PLACES=592, PETRI_TRANSITIONS=3592} [2025-04-14 01:19:36,511 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 561 predicate places. [2025-04-14 01:19:36,511 INFO L485 AbstractCegarLoop]: Abstraction has has 592 places, 3592 transitions, 96013 flow [2025-04-14 01:19:36,511 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:36,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:36,511 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:36,511 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-14 01:19:36,511 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:36,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:36,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1963122332, now seen corresponding path program 27 times [2025-04-14 01:19:36,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:36,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597175018] [2025-04-14 01:19:36,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:19:36,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:36,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:19:36,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-14 01:19:36,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:19:36,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:19:36,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:36,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597175018] [2025-04-14 01:19:36,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597175018] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:36,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:36,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:19:36,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445406077] [2025-04-14 01:19:36,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:36,718 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:19:36,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:36,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:19:36,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:19:36,718 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:36,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 3592 transitions, 96013 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:36,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:36,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:36,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:46,319 INFO L116 PetriNetUnfolderBase]: 10847/16597 cut-off events. [2025-04-14 01:19:46,319 INFO L117 PetriNetUnfolderBase]: For 345769/345769 co-relation queries the response was YES. [2025-04-14 01:19:46,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204334 conditions, 16597 events. 10847/16597 cut-off events. For 345769/345769 co-relation queries the response was YES. Maximal size of possible extension queue 1509. Compared 113876 event pairs, 401 based on Foata normal form. 3/15600 useless extension candidates. Maximal degree in co-relation 203763. Up to 15135 conditions per place. [2025-04-14 01:19:46,555 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 3174 selfloop transitions, 601 changer transitions 9/3784 dead transitions. [2025-04-14 01:19:46,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 3784 transitions, 108096 flow [2025-04-14 01:19:46,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:19:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:19:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2025-04-14 01:19:46,556 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.390625 [2025-04-14 01:19:46,557 INFO L175 Difference]: Start difference. First operand has 592 places, 3592 transitions, 96013 flow. Second operand 10 states and 125 transitions. [2025-04-14 01:19:46,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 3784 transitions, 108096 flow [2025-04-14 01:19:57,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 3784 transitions, 107602 flow, removed 133 selfloop flow, removed 10 redundant places. [2025-04-14 01:19:57,599 INFO L231 Difference]: Finished difference. Result has 594 places, 3726 transitions, 100971 flow [2025-04-14 01:19:57,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=95519, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=488, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=100971, PETRI_PLACES=594, PETRI_TRANSITIONS=3726} [2025-04-14 01:19:57,602 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 563 predicate places. [2025-04-14 01:19:57,602 INFO L485 AbstractCegarLoop]: Abstraction has has 594 places, 3726 transitions, 100971 flow [2025-04-14 01:19:57,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:57,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:57,602 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:57,602 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-14 01:19:57,602 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:57,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:57,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1790105280, now seen corresponding path program 28 times [2025-04-14 01:19:57,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:57,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452524841] [2025-04-14 01:19:57,603 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:57,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:57,606 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:19:57,609 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:19:57,609 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:19:57,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:57,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:57,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:57,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452524841] [2025-04-14 01:19:57,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452524841] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:57,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250244344] [2025-04-14 01:19:57,636 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:57,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:57,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:57,638 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:19:57,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 01:19:57,680 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:19:57,695 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:19:57,695 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:19:57,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:57,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:19:57,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:57,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:57,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:57,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250244344] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:57,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:19:57,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-04-14 01:19:57,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910054528] [2025-04-14 01:19:57,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:57,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:19:57,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:57,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:19:57,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:19:57,753 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:57,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 3726 transitions, 100971 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:57,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:57,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:57,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:08,416 INFO L116 PetriNetUnfolderBase]: 12377/18780 cut-off events. [2025-04-14 01:20:08,416 INFO L117 PetriNetUnfolderBase]: For 414638/414638 co-relation queries the response was YES. [2025-04-14 01:20:08,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230717 conditions, 18780 events. 12377/18780 cut-off events. For 414638/414638 co-relation queries the response was YES. Maximal size of possible extension queue 1630. Compared 129060 event pairs, 2857 based on Foata normal form. 214/18103 useless extension candidates. Maximal degree in co-relation 230260. Up to 9825 conditions per place. [2025-04-14 01:20:08,692 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 4174 selfloop transitions, 297 changer transitions 0/4471 dead transitions. [2025-04-14 01:20:08,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 4471 transitions, 126600 flow [2025-04-14 01:20:08,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:20:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:20:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-04-14 01:20:08,693 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-04-14 01:20:08,693 INFO L175 Difference]: Start difference. First operand has 594 places, 3726 transitions, 100971 flow. Second operand 6 states and 87 transitions. [2025-04-14 01:20:08,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 4471 transitions, 126600 flow [2025-04-14 01:20:21,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 4471 transitions, 125948 flow, removed 216 selfloop flow, removed 6 redundant places. [2025-04-14 01:20:21,641 INFO L231 Difference]: Finished difference. Result has 595 places, 3513 transitions, 94946 flow [2025-04-14 01:20:21,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=90190, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3078, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94946, PETRI_PLACES=595, PETRI_TRANSITIONS=3513} [2025-04-14 01:20:21,644 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 564 predicate places. [2025-04-14 01:20:21,644 INFO L485 AbstractCegarLoop]: Abstraction has has 595 places, 3513 transitions, 94946 flow [2025-04-14 01:20:21,644 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:21,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:21,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:21,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 01:20:21,845 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:21,845 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:21,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:21,846 INFO L85 PathProgramCache]: Analyzing trace with hash -853947411, now seen corresponding path program 1 times [2025-04-14 01:20:21,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:21,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020204490] [2025-04-14 01:20:21,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:21,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:21,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:21,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:21,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:21,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:21,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:21,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:21,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020204490] [2025-04-14 01:20:21,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020204490] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:21,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685782115] [2025-04-14 01:20:21,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:21,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:21,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:21,881 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:20:21,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 01:20:21,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:21,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:21,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:21,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:21,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:20:21,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:21,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:21,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:21,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685782115] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:20:21,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:20:21,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-14 01:20:21,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276520562] [2025-04-14 01:20:21,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:20:21,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:21,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:21,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:21,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:21,990 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:21,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 3513 transitions, 94946 flow. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:21,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:21,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:21,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:29,550 INFO L116 PetriNetUnfolderBase]: 8318/12900 cut-off events. [2025-04-14 01:20:29,551 INFO L117 PetriNetUnfolderBase]: For 294450/294450 co-relation queries the response was YES. [2025-04-14 01:20:29,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152977 conditions, 12900 events. 8318/12900 cut-off events. For 294450/294450 co-relation queries the response was YES. Maximal size of possible extension queue 1185. Compared 87039 event pairs, 2009 based on Foata normal form. 291/12645 useless extension candidates. Maximal degree in co-relation 152588. Up to 6874 conditions per place. [2025-04-14 01:20:29,744 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 3044 selfloop transitions, 58 changer transitions 9/3111 dead transitions. [2025-04-14 01:20:29,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 3111 transitions, 86186 flow [2025-04-14 01:20:29,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:20:29,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:20:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2025-04-14 01:20:29,745 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2025-04-14 01:20:29,745 INFO L175 Difference]: Start difference. First operand has 595 places, 3513 transitions, 94946 flow. Second operand 6 states and 82 transitions. [2025-04-14 01:20:29,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 3111 transitions, 86186 flow [2025-04-14 01:20:36,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 3111 transitions, 84767 flow, removed 533 selfloop flow, removed 23 redundant places. [2025-04-14 01:20:36,741 INFO L231 Difference]: Finished difference. Result has 554 places, 2741 transitions, 70602 flow [2025-04-14 01:20:36,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=69909, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2716, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70602, PETRI_PLACES=554, PETRI_TRANSITIONS=2741} [2025-04-14 01:20:36,743 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 523 predicate places. [2025-04-14 01:20:36,744 INFO L485 AbstractCegarLoop]: Abstraction has has 554 places, 2741 transitions, 70602 flow [2025-04-14 01:20:36,744 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:36,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:36,744 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:36,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-14 01:20:36,944 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,SelfDestructingSolverStorable31 [2025-04-14 01:20:36,944 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:36,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:36,945 INFO L85 PathProgramCache]: Analyzing trace with hash -405121821, now seen corresponding path program 1 times [2025-04-14 01:20:36,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:36,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370236915] [2025-04-14 01:20:36,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:36,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:36,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:36,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:36,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:36,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:36,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:36,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370236915] [2025-04-14 01:20:36,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370236915] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:36,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771383504] [2025-04-14 01:20:36,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:36,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:36,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:36,982 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:20:36,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-14 01:20:37,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:37,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:37,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:37,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:37,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 01:20:37,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:37,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:37,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:37,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771383504] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:20:37,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:20:37,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 01:20:37,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979954487] [2025-04-14 01:20:37,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:20:37,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:20:37,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:37,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:20:37,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:20:37,130 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:37,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 2741 transitions, 70602 flow. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:37,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:37,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:37,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:42,412 INFO L116 PetriNetUnfolderBase]: 7103/11094 cut-off events. [2025-04-14 01:20:42,412 INFO L117 PetriNetUnfolderBase]: For 239692/239692 co-relation queries the response was YES. [2025-04-14 01:20:42,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133017 conditions, 11094 events. 7103/11094 cut-off events. For 239692/239692 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 73564 event pairs, 1936 based on Foata normal form. 312/11020 useless extension candidates. Maximal degree in co-relation 132735. Up to 9090 conditions per place. [2025-04-14 01:20:42,564 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 2586 selfloop transitions, 88 changer transitions 81/2755 dead transitions. [2025-04-14 01:20:42,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 2755 transitions, 76697 flow [2025-04-14 01:20:42,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:20:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:20:42,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2025-04-14 01:20:42,565 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-14 01:20:42,565 INFO L175 Difference]: Start difference. First operand has 554 places, 2741 transitions, 70602 flow. Second operand 6 states and 74 transitions. [2025-04-14 01:20:42,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 2755 transitions, 76697 flow [2025-04-14 01:20:47,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 2755 transitions, 76379 flow, removed 130 selfloop flow, removed 9 redundant places. [2025-04-14 01:20:47,823 INFO L231 Difference]: Finished difference. Result has 546 places, 2562 transitions, 66884 flow [2025-04-14 01:20:47,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=67512, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=66884, PETRI_PLACES=546, PETRI_TRANSITIONS=2562} [2025-04-14 01:20:47,825 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 515 predicate places. [2025-04-14 01:20:47,825 INFO L485 AbstractCegarLoop]: Abstraction has has 546 places, 2562 transitions, 66884 flow [2025-04-14 01:20:47,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:47,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:47,825 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:47,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-14 01:20:48,026 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,SelfDestructingSolverStorable32 [2025-04-14 01:20:48,027 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:48,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:48,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2002431373, now seen corresponding path program 1 times [2025-04-14 01:20:48,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:48,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910706803] [2025-04-14 01:20:48,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:48,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:48,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:48,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:48,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:48,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:48,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:48,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910706803] [2025-04-14 01:20:48,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910706803] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:48,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726560920] [2025-04-14 01:20:48,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:48,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:48,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:48,068 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:20:48,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-14 01:20:48,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:48,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:48,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:48,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:48,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:20:48,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:48,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:48,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726560920] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:20:48,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:20:48,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 01:20:48,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600849010] [2025-04-14 01:20:48,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:20:48,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:20:48,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:48,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:20:48,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:20:48,201 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:48,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 2562 transitions, 66884 flow. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:48,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:48,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:48,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:52,463 INFO L116 PetriNetUnfolderBase]: 6377/9674 cut-off events. [2025-04-14 01:20:52,464 INFO L117 PetriNetUnfolderBase]: For 214629/214629 co-relation queries the response was YES. [2025-04-14 01:20:52,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120871 conditions, 9674 events. 6377/9674 cut-off events. For 214629/214629 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 59256 event pairs, 1671 based on Foata normal form. 186/9582 useless extension candidates. Maximal degree in co-relation 120639. Up to 9090 conditions per place. [2025-04-14 01:20:52,589 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 2261 selfloop transitions, 3 changer transitions 187/2451 dead transitions. [2025-04-14 01:20:52,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 2451 transitions, 69268 flow [2025-04-14 01:20:52,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:20:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:20:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2025-04-14 01:20:52,590 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3802083333333333 [2025-04-14 01:20:52,590 INFO L175 Difference]: Start difference. First operand has 546 places, 2562 transitions, 66884 flow. Second operand 6 states and 73 transitions. [2025-04-14 01:20:52,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 2451 transitions, 69268 flow [2025-04-14 01:20:57,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 2451 transitions, 68390 flow, removed 180 selfloop flow, removed 20 redundant places. [2025-04-14 01:20:57,223 INFO L231 Difference]: Finished difference. Result has 521 places, 2264 transitions, 58819 flow [2025-04-14 01:20:57,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62604, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=58819, PETRI_PLACES=521, PETRI_TRANSITIONS=2264} [2025-04-14 01:20:57,225 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 490 predicate places. [2025-04-14 01:20:57,225 INFO L485 AbstractCegarLoop]: Abstraction has has 521 places, 2264 transitions, 58819 flow [2025-04-14 01:20:57,225 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:57,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:57,225 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:57,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-14 01:20:57,425 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,SelfDestructingSolverStorable33 [2025-04-14 01:20:57,426 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:57,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:57,427 INFO L85 PathProgramCache]: Analyzing trace with hash -386197653, now seen corresponding path program 2 times [2025-04-14 01:20:57,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:57,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95468841] [2025-04-14 01:20:57,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:20:57,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:57,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:20:57,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-04-14 01:20:57,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:20:57,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:20:57,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:57,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95468841] [2025-04-14 01:20:57,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95468841] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:57,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:57,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:20:57,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50712113] [2025-04-14 01:20:57,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:57,457 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:20:57,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:57,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:20:57,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:20:57,457 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:57,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 2264 transitions, 58819 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:57,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:57,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:57,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:00,955 INFO L116 PetriNetUnfolderBase]: 6360/9440 cut-off events. [2025-04-14 01:21:00,955 INFO L117 PetriNetUnfolderBase]: For 194563/194563 co-relation queries the response was YES. [2025-04-14 01:21:01,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116236 conditions, 9440 events. 6360/9440 cut-off events. For 194563/194563 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 55590 event pairs, 359 based on Foata normal form. 8/9150 useless extension candidates. Maximal degree in co-relation 116053. Up to 5746 conditions per place. [2025-04-14 01:21:01,104 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 2168 selfloop transitions, 321 changer transitions 0/2489 dead transitions. [2025-04-14 01:21:01,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 2489 transitions, 68365 flow [2025-04-14 01:21:01,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:21:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:21:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-04-14 01:21:01,104 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2025-04-14 01:21:01,105 INFO L175 Difference]: Start difference. First operand has 521 places, 2264 transitions, 58819 flow. Second operand 6 states and 97 transitions. [2025-04-14 01:21:01,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 2489 transitions, 68365 flow [2025-04-14 01:21:05,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 2489 transitions, 67107 flow, removed 165 selfloop flow, removed 22 redundant places. [2025-04-14 01:21:05,491 INFO L231 Difference]: Finished difference. Result has 492 places, 2271 transitions, 58753 flow [2025-04-14 01:21:05,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=57635, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1943, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=58753, PETRI_PLACES=492, PETRI_TRANSITIONS=2271} [2025-04-14 01:21:05,497 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 461 predicate places. [2025-04-14 01:21:05,497 INFO L485 AbstractCegarLoop]: Abstraction has has 492 places, 2271 transitions, 58753 flow [2025-04-14 01:21:05,497 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:05,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:05,498 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:05,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-14 01:21:05,498 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:21:05,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash -146303313, now seen corresponding path program 3 times [2025-04-14 01:21:05,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:05,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405756153] [2025-04-14 01:21:05,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:21:05,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:05,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:05,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:05,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:21:05,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:05,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:05,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405756153] [2025-04-14 01:21:05,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405756153] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:05,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966929659] [2025-04-14 01:21:05,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:21:05,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:05,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:05,563 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:21:05,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-14 01:21:05,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:05,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:05,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:21:05,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:05,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:21:05,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:21:05,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:21:05,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966929659] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:05,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:21:05,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-14 01:21:05,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129830446] [2025-04-14 01:21:05,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:05,822 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:21:05,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:05,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:21:05,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:21:05,822 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:05,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 2271 transitions, 58753 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:05,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:05,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:05,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:09,359 INFO L116 PetriNetUnfolderBase]: 6402/9499 cut-off events. [2025-04-14 01:21:09,359 INFO L117 PetriNetUnfolderBase]: For 206303/206303 co-relation queries the response was YES. [2025-04-14 01:21:09,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116159 conditions, 9499 events. 6402/9499 cut-off events. For 206303/206303 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 55772 event pairs, 598 based on Foata normal form. 68/9251 useless extension candidates. Maximal degree in co-relation 115984. Up to 7078 conditions per place. [2025-04-14 01:21:09,480 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 2110 selfloop transitions, 239 changer transitions 0/2349 dead transitions. [2025-04-14 01:21:09,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 2349 transitions, 65254 flow [2025-04-14 01:21:09,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:21:09,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:21:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2025-04-14 01:21:09,481 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2025-04-14 01:21:09,481 INFO L175 Difference]: Start difference. First operand has 492 places, 2271 transitions, 58753 flow. Second operand 7 states and 78 transitions. [2025-04-14 01:21:09,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 2349 transitions, 65254 flow [2025-04-14 01:21:13,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 2349 transitions, 64381 flow, removed 40 selfloop flow, removed 5 redundant places. [2025-04-14 01:21:13,348 INFO L231 Difference]: Finished difference. Result has 490 places, 2263 transitions, 59040 flow [2025-04-14 01:21:13,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=57473, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2007, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=59040, PETRI_PLACES=490, PETRI_TRANSITIONS=2263} [2025-04-14 01:21:13,351 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 459 predicate places. [2025-04-14 01:21:13,351 INFO L485 AbstractCegarLoop]: Abstraction has has 490 places, 2263 transitions, 59040 flow [2025-04-14 01:21:13,351 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:13,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:13,351 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:13,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-14 01:21:13,551 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,SelfDestructingSolverStorable35 [2025-04-14 01:21:13,552 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:21:13,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:13,553 INFO L85 PathProgramCache]: Analyzing trace with hash -996852457, now seen corresponding path program 4 times [2025-04-14 01:21:13,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:13,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467190620] [2025-04-14 01:21:13,553 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:21:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:13,560 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:13,562 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-14 01:21:13,562 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:21:13,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:13,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:13,585 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467190620] [2025-04-14 01:21:13,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467190620] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:21:13,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:21:13,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:21:13,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289395248] [2025-04-14 01:21:13,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:13,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:21:13,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:13,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:21:13,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:21:13,586 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:13,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 2263 transitions, 59040 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:13,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:13,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:13,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:17,721 INFO L116 PetriNetUnfolderBase]: 6930/10223 cut-off events. [2025-04-14 01:21:17,721 INFO L117 PetriNetUnfolderBase]: For 216656/216656 co-relation queries the response was YES. [2025-04-14 01:21:17,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124824 conditions, 10223 events. 6930/10223 cut-off events. For 216656/216656 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 60251 event pairs, 212 based on Foata normal form. 12/9881 useless extension candidates. Maximal degree in co-relation 124646. Up to 4945 conditions per place. [2025-04-14 01:21:17,861 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 2253 selfloop transitions, 461 changer transitions 0/2714 dead transitions. [2025-04-14 01:21:17,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 2714 transitions, 74107 flow [2025-04-14 01:21:17,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:21:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:21:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2025-04-14 01:21:17,863 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4618055555555556 [2025-04-14 01:21:17,863 INFO L175 Difference]: Start difference. First operand has 490 places, 2263 transitions, 59040 flow. Second operand 9 states and 133 transitions. [2025-04-14 01:21:17,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 2714 transitions, 74107 flow [2025-04-14 01:21:21,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 2714 transitions, 73959 flow, removed 51 selfloop flow, removed 4 redundant places. [2025-04-14 01:21:22,022 INFO L231 Difference]: Finished difference. Result has 500 places, 2362 transitions, 62594 flow [2025-04-14 01:21:22,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58950, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=374, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1856, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=62594, PETRI_PLACES=500, PETRI_TRANSITIONS=2362} [2025-04-14 01:21:22,025 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 469 predicate places. [2025-04-14 01:21:22,026 INFO L485 AbstractCegarLoop]: Abstraction has has 500 places, 2362 transitions, 62594 flow [2025-04-14 01:21:22,026 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:22,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:22,026 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:22,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-14 01:21:22,026 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:21:22,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:22,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1909814205, now seen corresponding path program 5 times [2025-04-14 01:21:22,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:22,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144238817] [2025-04-14 01:21:22,027 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:21:22,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:22,032 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:22,034 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:22,035 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:22,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:22,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:22,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144238817] [2025-04-14 01:21:22,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144238817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:22,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243775146] [2025-04-14 01:21:22,063 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:21:22,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:22,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:22,065 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:21:22,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-14 01:21:22,115 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:22,130 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:22,130 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:22,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:22,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:21:22,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:22,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243775146] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:21:22,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:21:22,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-04-14 01:21:22,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111169573] [2025-04-14 01:21:22,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:21:22,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:21:22,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:22,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:21:22,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:21:22,176 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:22,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 2362 transitions, 62594 flow. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:22,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:22,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:22,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:26,956 INFO L116 PetriNetUnfolderBase]: 7263/10820 cut-off events. [2025-04-14 01:21:26,957 INFO L117 PetriNetUnfolderBase]: For 267092/267092 co-relation queries the response was YES. [2025-04-14 01:21:27,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133934 conditions, 10820 events. 7263/10820 cut-off events. For 267092/267092 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 65355 event pairs, 546 based on Foata normal form. 12/10750 useless extension candidates. Maximal degree in co-relation 133753. Up to 6787 conditions per place. [2025-04-14 01:21:27,105 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 2463 selfloop transitions, 210 changer transitions 0/2673 dead transitions. [2025-04-14 01:21:27,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 2673 transitions, 74277 flow [2025-04-14 01:21:27,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:21:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:21:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2025-04-14 01:21:27,107 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.421875 [2025-04-14 01:21:27,107 INFO L175 Difference]: Start difference. First operand has 500 places, 2362 transitions, 62594 flow. Second operand 8 states and 108 transitions. [2025-04-14 01:21:27,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 2673 transitions, 74277 flow [2025-04-14 01:21:32,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 2673 transitions, 73748 flow, removed 100 selfloop flow, removed 2 redundant places. [2025-04-14 01:21:32,207 INFO L231 Difference]: Finished difference. Result has 511 places, 2393 transitions, 63664 flow [2025-04-14 01:21:32,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62085, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=63664, PETRI_PLACES=511, PETRI_TRANSITIONS=2393} [2025-04-14 01:21:32,210 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 480 predicate places. [2025-04-14 01:21:32,210 INFO L485 AbstractCegarLoop]: Abstraction has has 511 places, 2393 transitions, 63664 flow [2025-04-14 01:21:32,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:32,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:32,210 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:32,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-14 01:21:32,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:32,411 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:21:32,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:32,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1720297377, now seen corresponding path program 6 times [2025-04-14 01:21:32,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:32,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550799913] [2025-04-14 01:21:32,412 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:21:32,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:32,418 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:32,422 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:32,422 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:21:32,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:32,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:32,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550799913] [2025-04-14 01:21:32,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550799913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:21:32,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:21:32,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:21:32,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136121691] [2025-04-14 01:21:32,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:32,458 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:21:32,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:32,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:21:32,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:21:32,458 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:32,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 2393 transitions, 63664 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:32,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:32,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:32,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:37,021 INFO L116 PetriNetUnfolderBase]: 7251/10804 cut-off events. [2025-04-14 01:21:37,022 INFO L117 PetriNetUnfolderBase]: For 283832/283832 co-relation queries the response was YES. [2025-04-14 01:21:37,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134972 conditions, 10804 events. 7251/10804 cut-off events. For 283832/283832 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 65446 event pairs, 1423 based on Foata normal form. 10/10732 useless extension candidates. Maximal degree in co-relation 134785. Up to 7922 conditions per place. [2025-04-14 01:21:37,180 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 2165 selfloop transitions, 326 changer transitions 7/2498 dead transitions. [2025-04-14 01:21:37,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 2498 transitions, 70976 flow [2025-04-14 01:21:37,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:21:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:21:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2025-04-14 01:21:37,181 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40625 [2025-04-14 01:21:37,181 INFO L175 Difference]: Start difference. First operand has 511 places, 2393 transitions, 63664 flow. Second operand 6 states and 78 transitions. [2025-04-14 01:21:37,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 2498 transitions, 70976 flow [2025-04-14 01:21:41,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 2498 transitions, 70867 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-04-14 01:21:41,938 INFO L231 Difference]: Finished difference. Result has 515 places, 2383 transitions, 63873 flow [2025-04-14 01:21:41,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=63430, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=326, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2063, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=63873, PETRI_PLACES=515, PETRI_TRANSITIONS=2383} [2025-04-14 01:21:41,940 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 484 predicate places. [2025-04-14 01:21:41,940 INFO L485 AbstractCegarLoop]: Abstraction has has 515 places, 2383 transitions, 63873 flow [2025-04-14 01:21:41,940 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:41,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:41,940 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:41,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-14 01:21:41,941 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:21:41,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:41,941 INFO L85 PathProgramCache]: Analyzing trace with hash 228796209, now seen corresponding path program 7 times [2025-04-14 01:21:41,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:41,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394199922] [2025-04-14 01:21:41,941 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:21:41,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:41,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:21:41,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:41,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:41,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:21:41,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:41,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394199922] [2025-04-14 01:21:41,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394199922] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:41,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844584639] [2025-04-14 01:21:41,985 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:21:41,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:41,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:41,987 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:21:41,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-14 01:21:42,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:21:42,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:42,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:42,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:42,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:21:42,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:21:42,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:21:42,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844584639] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:42,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:21:42,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-14 01:21:42,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622882324] [2025-04-14 01:21:42,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:42,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:21:42,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:42,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:21:42,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:21:42,121 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:42,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 2383 transitions, 63873 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:42,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:42,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:42,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:46,852 INFO L116 PetriNetUnfolderBase]: 7196/10691 cut-off events. [2025-04-14 01:21:46,852 INFO L117 PetriNetUnfolderBase]: For 274838/274838 co-relation queries the response was YES. [2025-04-14 01:21:46,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134142 conditions, 10691 events. 7196/10691 cut-off events. For 274838/274838 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 63704 event pairs, 1300 based on Foata normal form. 76/10685 useless extension candidates. Maximal degree in co-relation 133955. Up to 7528 conditions per place. [2025-04-14 01:21:46,986 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 2287 selfloop transitions, 111 changer transitions 0/2398 dead transitions. [2025-04-14 01:21:46,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 2398 transitions, 68611 flow [2025-04-14 01:21:46,986 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:21:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:21:46,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2025-04-14 01:21:46,987 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33035714285714285 [2025-04-14 01:21:46,987 INFO L175 Difference]: Start difference. First operand has 515 places, 2383 transitions, 63873 flow. Second operand 7 states and 74 transitions. [2025-04-14 01:21:46,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 2398 transitions, 68611 flow [2025-04-14 01:21:51,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 2398 transitions, 68115 flow, removed 90 selfloop flow, removed 3 redundant places. [2025-04-14 01:21:51,753 INFO L231 Difference]: Finished difference. Result has 516 places, 2351 transitions, 62891 flow [2025-04-14 01:21:51,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62339, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=62891, PETRI_PLACES=516, PETRI_TRANSITIONS=2351} [2025-04-14 01:21:51,755 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 485 predicate places. [2025-04-14 01:21:51,755 INFO L485 AbstractCegarLoop]: Abstraction has has 516 places, 2351 transitions, 62891 flow [2025-04-14 01:21:51,755 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:51,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:51,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-14 01:21:51,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-14 01:21:51,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-14 01:21:51,956 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:21:51,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:51,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1241131583, now seen corresponding path program 8 times [2025-04-14 01:21:51,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:51,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224483610] [2025-04-14 01:21:51,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:21:51,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:51,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:51,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:51,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:51,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:51,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:51,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224483610] [2025-04-14 01:21:51,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224483610] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:51,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718930771] [2025-04-14 01:21:51,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:21:51,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:51,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:51,996 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:21:51,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-14 01:21:52,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:52,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:52,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:52,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:52,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:21:52,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:52,097 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-14 01:21:52,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:21:52,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718930771] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:52,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:21:52,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2025-04-14 01:21:52,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195042995] [2025-04-14 01:21:52,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:52,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:21:52,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:52,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:21:52,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:21:52,144 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:52,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 2351 transitions, 62891 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:52,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:52,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:52,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:56,467 INFO L116 PetriNetUnfolderBase]: 7320/10741 cut-off events. [2025-04-14 01:21:56,468 INFO L117 PetriNetUnfolderBase]: For 296593/296593 co-relation queries the response was YES. [2025-04-14 01:21:56,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133691 conditions, 10741 events. 7320/10741 cut-off events. For 296593/296593 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 62435 event pairs, 806 based on Foata normal form. 158/10765 useless extension candidates. Maximal degree in co-relation 133520. Up to 5799 conditions per place. [2025-04-14 01:21:56,620 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 2086 selfloop transitions, 345 changer transitions 0/2431 dead transitions. [2025-04-14 01:21:56,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 2431 transitions, 69340 flow [2025-04-14 01:21:56,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:21:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:21:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2025-04-14 01:21:56,621 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35267857142857145 [2025-04-14 01:21:56,621 INFO L175 Difference]: Start difference. First operand has 516 places, 2351 transitions, 62891 flow. Second operand 7 states and 79 transitions. [2025-04-14 01:21:56,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 2431 transitions, 69340 flow [2025-04-14 01:22:01,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 510 places, 2431 transitions, 68903 flow, removed 128 selfloop flow, removed 6 redundant places. [2025-04-14 01:22:01,178 INFO L231 Difference]: Finished difference. Result has 513 places, 2269 transitions, 61982 flow [2025-04-14 01:22:01,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60182, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=331, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1914, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=61982, PETRI_PLACES=513, PETRI_TRANSITIONS=2269} [2025-04-14 01:22:01,182 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 482 predicate places. [2025-04-14 01:22:01,182 INFO L485 AbstractCegarLoop]: Abstraction has has 513 places, 2269 transitions, 61982 flow [2025-04-14 01:22:01,182 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:22:01,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:01,182 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:22:01,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-14 01:22:01,383 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:01,383 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:22:01,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:01,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1015429984, now seen corresponding path program 1 times [2025-04-14 01:22:01,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:01,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108286081] [2025-04-14 01:22:01,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:22:01,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:01,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:22:01,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:01,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:22:01,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:22:02,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:02,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108286081] [2025-04-14 01:22:02,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108286081] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:22:02,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578388271] [2025-04-14 01:22:02,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:22:02,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:02,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:22:02,125 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:22:02,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-14 01:22:02,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:22:02,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:02,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:22:02,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:02,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 01:22:02,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:22:02,744 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:02,744 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 158 treesize of output 72 [2025-04-14 01:22:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:22:02,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:22:02,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578388271] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:22:02,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:22:02,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 24 [2025-04-14 01:22:02,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406084224] [2025-04-14 01:22:02,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:22:02,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:22:02,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:02,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:22:02,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2025-04-14 01:22:02,874 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:22:02,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 2269 transitions, 61982 flow. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:22:02,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:02,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:22:02,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:08,238 INFO L116 PetriNetUnfolderBase]: 8213/12080 cut-off events. [2025-04-14 01:22:08,238 INFO L117 PetriNetUnfolderBase]: For 344504/344504 co-relation queries the response was YES. [2025-04-14 01:22:08,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151616 conditions, 12080 events. 8213/12080 cut-off events. For 344504/344504 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 71748 event pairs, 331 based on Foata normal form. 1/11917 useless extension candidates. Maximal degree in co-relation 151444. Up to 10500 conditions per place. [2025-04-14 01:22:08,413 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 2113 selfloop transitions, 365 changer transitions 2/2480 dead transitions. [2025-04-14 01:22:08,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 2480 transitions, 71394 flow [2025-04-14 01:22:08,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:22:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:22:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 170 transitions. [2025-04-14 01:22:08,415 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4427083333333333 [2025-04-14 01:22:08,415 INFO L175 Difference]: Start difference. First operand has 513 places, 2269 transitions, 61982 flow. Second operand 12 states and 170 transitions. [2025-04-14 01:22:08,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 2480 transitions, 71394 flow [2025-04-14 01:22:13,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 2480 transitions, 71207 flow, removed 88 selfloop flow, removed 4 redundant places. [2025-04-14 01:22:13,890 INFO L231 Difference]: Finished difference. Result has 525 places, 2334 transitions, 64518 flow [2025-04-14 01:22:13,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=61899, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=302, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1912, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=64518, PETRI_PLACES=525, PETRI_TRANSITIONS=2334} [2025-04-14 01:22:13,892 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 494 predicate places. [2025-04-14 01:22:13,892 INFO L485 AbstractCegarLoop]: Abstraction has has 525 places, 2334 transitions, 64518 flow [2025-04-14 01:22:13,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:22:13,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:13,892 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:22:13,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-14 01:22:14,095 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:14,096 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:22:14,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:14,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1433402204, now seen corresponding path program 2 times [2025-04-14 01:22:14,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:14,096 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572045460] [2025-04-14 01:22:14,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:22:14,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:14,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:14,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:14,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:22:14,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:22:15,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:15,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572045460] [2025-04-14 01:22:15,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572045460] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:22:15,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917941474] [2025-04-14 01:22:15,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:22:15,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:15,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:22:15,218 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:22:15,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-14 01:22:15,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:15,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:15,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:22:15,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:15,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:22:15,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:22:15,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:22:15,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:22:15,943 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:15,943 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 194 treesize of output 94 [2025-04-14 01:22:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:22:16,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:22:17,553 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:17,554 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-14 01:22:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:22:18,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917941474] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:22:18,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:22:18,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 29 [2025-04-14 01:22:18,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962035587] [2025-04-14 01:22:18,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:22:18,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-14 01:22:18,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:18,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-14 01:22:18,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2025-04-14 01:22:18,121 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:22:18,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 2334 transitions, 64518 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-14 01:22:18,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:18,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:22:18,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:27,958 INFO L116 PetriNetUnfolderBase]: 9433/13953 cut-off events. [2025-04-14 01:22:27,958 INFO L117 PetriNetUnfolderBase]: For 427551/427551 co-relation queries the response was YES. [2025-04-14 01:22:28,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175379 conditions, 13953 events. 9433/13953 cut-off events. For 427551/427551 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 85302 event pairs, 359 based on Foata normal form. 3/13758 useless extension candidates. Maximal degree in co-relation 175203. Up to 10106 conditions per place. [2025-04-14 01:22:28,215 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 1740 selfloop transitions, 1102 changer transitions 15/2857 dead transitions. [2025-04-14 01:22:28,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 2857 transitions, 80722 flow [2025-04-14 01:22:28,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-14 01:22:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-04-14 01:22:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 417 transitions. [2025-04-14 01:22:28,217 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3178353658536585 [2025-04-14 01:22:28,217 INFO L175 Difference]: Start difference. First operand has 525 places, 2334 transitions, 64518 flow. Second operand 41 states and 417 transitions. [2025-04-14 01:22:28,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 2857 transitions, 80722 flow [2025-04-14 01:22:34,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 2857 transitions, 79969 flow, removed 261 selfloop flow, removed 3 redundant places. [2025-04-14 01:22:34,757 INFO L231 Difference]: Finished difference. Result has 568 places, 2594 transitions, 73553 flow [2025-04-14 01:22:34,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=63957, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=900, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=73553, PETRI_PLACES=568, PETRI_TRANSITIONS=2594} [2025-04-14 01:22:34,758 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 537 predicate places. [2025-04-14 01:22:34,758 INFO L485 AbstractCegarLoop]: Abstraction has has 568 places, 2594 transitions, 73553 flow [2025-04-14 01:22:34,758 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-14 01:22:34,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:34,758 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:22:34,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-14 01:22:34,959 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:34,959 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:22:34,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:34,960 INFO L85 PathProgramCache]: Analyzing trace with hash -296239776, now seen corresponding path program 3 times [2025-04-14 01:22:34,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:34,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420952882] [2025-04-14 01:22:34,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:22:34,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:34,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:34,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:34,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:22:34,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:22:35,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:35,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420952882] [2025-04-14 01:22:35,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420952882] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:22:35,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367099889] [2025-04-14 01:22:35,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:22:35,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:35,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:22:35,650 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:22:35,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-14 01:22:35,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:35,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:35,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:22:35,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:35,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:22:35,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:22:36,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:22:36,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:22:36,139 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:36,139 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-14 01:22:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:22:36,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:22:37,840 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:37,840 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-14 01:22:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:22:38,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367099889] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:22:38,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:22:38,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 29 [2025-04-14 01:22:38,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429586004] [2025-04-14 01:22:38,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:22:38,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-14 01:22:38,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:38,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-14 01:22:38,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2025-04-14 01:22:38,496 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:22:38,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 2594 transitions, 73553 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-14 01:22:38,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:38,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:22:38,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:49,529 INFO L116 PetriNetUnfolderBase]: 9694/14351 cut-off events. [2025-04-14 01:22:49,529 INFO L117 PetriNetUnfolderBase]: For 466092/466092 co-relation queries the response was YES. [2025-04-14 01:22:49,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185063 conditions, 14351 events. 9694/14351 cut-off events. For 466092/466092 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 88008 event pairs, 313 based on Foata normal form. 3/14115 useless extension candidates. Maximal degree in co-relation 184881. Up to 10355 conditions per place. [2025-04-14 01:22:49,768 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1735 selfloop transitions, 1194 changer transitions 13/2942 dead transitions. [2025-04-14 01:22:49,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 2942 transitions, 85425 flow [2025-04-14 01:22:49,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-14 01:22:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-04-14 01:22:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 453 transitions. [2025-04-14 01:22:49,770 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32173295454545453 [2025-04-14 01:22:49,770 INFO L175 Difference]: Start difference. First operand has 568 places, 2594 transitions, 73553 flow. Second operand 44 states and 453 transitions. [2025-04-14 01:22:49,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 2942 transitions, 85425 flow [2025-04-14 01:22:56,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 2942 transitions, 83867 flow, removed 519 selfloop flow, removed 8 redundant places. [2025-04-14 01:22:56,636 INFO L231 Difference]: Finished difference. Result has 611 places, 2696 transitions, 76749 flow [2025-04-14 01:22:56,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=72082, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=76749, PETRI_PLACES=611, PETRI_TRANSITIONS=2696} [2025-04-14 01:22:56,638 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 580 predicate places. [2025-04-14 01:22:56,638 INFO L485 AbstractCegarLoop]: Abstraction has has 611 places, 2696 transitions, 76749 flow [2025-04-14 01:22:56,638 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-14 01:22:56,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:56,639 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:22:56,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-14 01:22:56,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:56,839 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:22:56,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:56,840 INFO L85 PathProgramCache]: Analyzing trace with hash -334495910, now seen corresponding path program 4 times [2025-04-14 01:22:56,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:56,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918573570] [2025-04-14 01:22:56,840 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:22:56,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:56,845 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:56,850 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:56,851 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:22:56,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:57,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:22:57,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:57,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918573570] [2025-04-14 01:22:57,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918573570] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:22:57,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92426728] [2025-04-14 01:22:57,852 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:22:57,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:57,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:22:57,854 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:22:57,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-14 01:22:57,907 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:57,923 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:57,923 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:22:57,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:57,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:22:57,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:22:58,705 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:58,706 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-14 01:22:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:22:59,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:23:00,140 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:23:00,140 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-14 01:23:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:23:00,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92426728] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:23:00,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:23:00,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 10] total 32 [2025-04-14 01:23:00,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852930107] [2025-04-14 01:23:00,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:23:00,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 01:23:00,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:23:00,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 01:23:00,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 01:23:00,661 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:23:00,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 2696 transitions, 76749 flow. Second operand has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:23:00,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:23:00,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:23:00,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:23:09,964 INFO L116 PetriNetUnfolderBase]: 9924/14709 cut-off events. [2025-04-14 01:23:09,965 INFO L117 PetriNetUnfolderBase]: For 489897/489897 co-relation queries the response was YES. [2025-04-14 01:23:10,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191994 conditions, 14709 events. 9924/14709 cut-off events. For 489897/489897 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 90585 event pairs, 454 based on Foata normal form. 2/14466 useless extension candidates. Maximal degree in co-relation 191800. Up to 13365 conditions per place. [2025-04-14 01:23:10,197 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 2394 selfloop transitions, 473 changer transitions 6/2873 dead transitions. [2025-04-14 01:23:10,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 2873 transitions, 85357 flow [2025-04-14 01:23:10,198 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 01:23:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 01:23:10,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 262 transitions. [2025-04-14 01:23:10,198 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3275 [2025-04-14 01:23:10,198 INFO L175 Difference]: Start difference. First operand has 611 places, 2696 transitions, 76749 flow. Second operand 25 states and 262 transitions. [2025-04-14 01:23:10,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 2873 transitions, 85357 flow [2025-04-14 01:23:17,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 2873 transitions, 83776 flow, removed 443 selfloop flow, removed 15 redundant places. [2025-04-14 01:23:17,414 INFO L231 Difference]: Finished difference. Result has 630 places, 2768 transitions, 78063 flow [2025-04-14 01:23:17,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=75187, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=406, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=78063, PETRI_PLACES=630, PETRI_TRANSITIONS=2768} [2025-04-14 01:23:17,415 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 599 predicate places. [2025-04-14 01:23:17,416 INFO L485 AbstractCegarLoop]: Abstraction has has 630 places, 2768 transitions, 78063 flow [2025-04-14 01:23:17,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:23:17,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:23:17,416 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:23:17,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-14 01:23:17,620 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,SelfDestructingSolverStorable44 [2025-04-14 01:23:17,620 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:23:17,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:23:17,621 INFO L85 PathProgramCache]: Analyzing trace with hash 162828938, now seen corresponding path program 5 times [2025-04-14 01:23:17,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:23:17,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593986442] [2025-04-14 01:23:17,621 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:23:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:23:17,626 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:23:17,633 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:23:17,634 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:23:17,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:23:18,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:23:18,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593986442] [2025-04-14 01:23:18,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593986442] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:23:18,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685419529] [2025-04-14 01:23:18,552 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:23:18,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:18,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:23:18,554 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:23:18,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-14 01:23:18,598 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:23:18,611 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:23:18,611 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:23:18,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:18,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-14 01:23:18,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:23:19,227 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:23:19,228 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 150 treesize of output 72 [2025-04-14 01:23:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:23:19,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:23:20,431 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:23:20,432 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-14 01:23:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:23:20,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685419529] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:23:20,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:23:20,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 35 [2025-04-14 01:23:20,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449012644] [2025-04-14 01:23:20,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:23:20,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-14 01:23:20,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:23:20,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-14 01:23:20,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2025-04-14 01:23:20,975 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:23:20,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 2768 transitions, 78063 flow. Second operand has 37 states, 37 states have (on average 4.891891891891892) internal successors, (181), 37 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:23:20,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:23:20,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:23:20,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:23:35,630 INFO L116 PetriNetUnfolderBase]: 10561/15723 cut-off events. [2025-04-14 01:23:35,630 INFO L117 PetriNetUnfolderBase]: For 538441/538441 co-relation queries the response was YES. [2025-04-14 01:23:35,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204593 conditions, 15723 events. 10561/15723 cut-off events. For 538441/538441 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 98451 event pairs, 521 based on Foata normal form. 2/15596 useless extension candidates. Maximal degree in co-relation 204389. Up to 12440 conditions per place. [2025-04-14 01:23:35,934 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 2122 selfloop transitions, 1042 changer transitions 6/3170 dead transitions. [2025-04-14 01:23:35,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 3170 transitions, 91716 flow [2025-04-14 01:23:35,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-14 01:23:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2025-04-14 01:23:35,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 599 transitions. [2025-04-14 01:23:35,936 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2879807692307692 [2025-04-14 01:23:35,936 INFO L175 Difference]: Start difference. First operand has 630 places, 2768 transitions, 78063 flow. Second operand 65 states and 599 transitions. [2025-04-14 01:23:35,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 3170 transitions, 91716 flow [2025-04-14 01:23:44,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 3170 transitions, 90689 flow, removed 255 selfloop flow, removed 8 redundant places. [2025-04-14 01:23:44,113 INFO L231 Difference]: Finished difference. Result has 704 places, 2912 transitions, 83846 flow [2025-04-14 01:23:44,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=77065, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2768, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=914, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1803, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=83846, PETRI_PLACES=704, PETRI_TRANSITIONS=2912} [2025-04-14 01:23:44,115 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 673 predicate places. [2025-04-14 01:23:44,115 INFO L485 AbstractCegarLoop]: Abstraction has has 704 places, 2912 transitions, 83846 flow [2025-04-14 01:23:44,115 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.891891891891892) internal successors, (181), 37 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:23:44,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:23:44,115 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:23:44,120 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-14 01:23:44,315 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,SelfDestructingSolverStorable45 [2025-04-14 01:23:44,316 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:23:44,316 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:23:44,316 INFO L85 PathProgramCache]: Analyzing trace with hash -863225932, now seen corresponding path program 6 times [2025-04-14 01:23:44,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:23:44,316 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908234397] [2025-04-14 01:23:44,316 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:23:44,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:23:44,321 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:23:44,326 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:23:44,326 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:23:44,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:44,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:23:44,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:23:44,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908234397] [2025-04-14 01:23:44,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908234397] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:23:44,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363810789] [2025-04-14 01:23:44,861 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:23:44,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:44,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:23:44,863 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:23:44,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-14 01:23:44,909 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:23:44,923 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:23:44,924 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:23:44,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:44,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:23:44,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:23:45,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:23:45,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:23:45,327 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:23:45,327 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 167 treesize of output 79 [2025-04-14 01:23:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:23:45,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:23:46,755 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:23:46,755 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 298 treesize of output 162 [2025-04-14 01:23:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:23:47,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363810789] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:23:47,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:23:47,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 30 [2025-04-14 01:23:47,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956672726] [2025-04-14 01:23:47,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:23:47,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-14 01:23:47,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:23:47,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-14 01:23:47,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2025-04-14 01:23:47,210 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:23:47,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 2912 transitions, 83846 flow. Second operand has 32 states, 32 states have (on average 4.75) internal successors, (152), 32 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:23:47,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:23:47,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:23:47,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:24:00,996 INFO L116 PetriNetUnfolderBase]: 11287/16908 cut-off events. [2025-04-14 01:24:00,997 INFO L117 PetriNetUnfolderBase]: For 621477/621477 co-relation queries the response was YES. [2025-04-14 01:24:01,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224857 conditions, 16908 events. 11287/16908 cut-off events. For 621477/621477 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 108223 event pairs, 381 based on Foata normal form. 2/16771 useless extension candidates. Maximal degree in co-relation 224635. Up to 11464 conditions per place. [2025-04-14 01:24:01,245 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 1814 selfloop transitions, 1586 changer transitions 10/3410 dead transitions. [2025-04-14 01:24:01,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 767 places, 3410 transitions, 99796 flow [2025-04-14 01:24:01,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-14 01:24:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2025-04-14 01:24:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 636 transitions. [2025-04-14 01:24:01,247 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.310546875 [2025-04-14 01:24:01,247 INFO L175 Difference]: Start difference. First operand has 704 places, 2912 transitions, 83846 flow. Second operand 64 states and 636 transitions. [2025-04-14 01:24:01,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 767 places, 3410 transitions, 99796 flow [2025-04-14 01:24:11,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 737 places, 3410 transitions, 97342 flow, removed 914 selfloop flow, removed 30 redundant places. [2025-04-14 01:24:11,268 INFO L231 Difference]: Finished difference. Result has 763 places, 3135 transitions, 92054 flow [2025-04-14 01:24:11,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=81828, PETRI_DIFFERENCE_MINUEND_PLACES=674, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1381, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=92054, PETRI_PLACES=763, PETRI_TRANSITIONS=3135} [2025-04-14 01:24:11,270 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 732 predicate places. [2025-04-14 01:24:11,270 INFO L485 AbstractCegarLoop]: Abstraction has has 763 places, 3135 transitions, 92054 flow [2025-04-14 01:24:11,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.75) internal successors, (152), 32 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:24:11,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:24:11,270 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:24:11,276 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-14 01:24:11,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:24:11,471 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:24:11,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:24:11,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1022892760, now seen corresponding path program 7 times [2025-04-14 01:24:11,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:24:11,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679635783] [2025-04-14 01:24:11,472 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:24:11,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:24:11,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:24:11,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:24:11,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:24:11,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:24:12,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:24:12,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679635783] [2025-04-14 01:24:12,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679635783] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:24:12,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394291753] [2025-04-14 01:24:12,381 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:24:12,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:24:12,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:24:12,383 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:24:12,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-14 01:24:12,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:24:12,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:24:12,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:24:12,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:12,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 01:24:12,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:24:12,485 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:24:13,014 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:24:13,014 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 135 treesize of output 71 [2025-04-14 01:24:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:24:13,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:24:15,688 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-14 01:24:15,692 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:24:15,692 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-14 01:24:15,873 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-14 01:24:15,879 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:24:15,879 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-14 01:24:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:24:16,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394291753] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:24:16,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:24:16,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 12] total 36 [2025-04-14 01:24:16,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970992262] [2025-04-14 01:24:16,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:24:16,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-14 01:24:16,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:24:16,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-14 01:24:16,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1239, Unknown=0, NotChecked=0, Total=1406 [2025-04-14 01:24:16,215 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:24:16,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 763 places, 3135 transitions, 92054 flow. Second operand has 38 states, 38 states have (on average 4.684210526315789) internal successors, (178), 38 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:24:16,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:24:16,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:24:16,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:24:31,377 INFO L116 PetriNetUnfolderBase]: 11858/17752 cut-off events. [2025-04-14 01:24:31,377 INFO L117 PetriNetUnfolderBase]: For 730877/730877 co-relation queries the response was YES. [2025-04-14 01:24:31,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240692 conditions, 17752 events. 11858/17752 cut-off events. For 730877/730877 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 113972 event pairs, 420 based on Foata normal form. 2/17624 useless extension candidates. Maximal degree in co-relation 240451. Up to 14476 conditions per place. [2025-04-14 01:24:31,705 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 2683 selfloop transitions, 730 changer transitions 6/3419 dead transitions. [2025-04-14 01:24:31,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 810 places, 3419 transitions, 103660 flow [2025-04-14 01:24:31,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-14 01:24:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-04-14 01:24:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 506 transitions. [2025-04-14 01:24:31,707 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31625 [2025-04-14 01:24:31,707 INFO L175 Difference]: Start difference. First operand has 763 places, 3135 transitions, 92054 flow. Second operand 50 states and 506 transitions. [2025-04-14 01:24:31,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 810 places, 3419 transitions, 103660 flow [2025-04-14 01:24:45,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 791 places, 3419 transitions, 101656 flow, removed 546 selfloop flow, removed 19 redundant places. [2025-04-14 01:24:45,516 INFO L231 Difference]: Finished difference. Result has 805 places, 3203 transitions, 93476 flow [2025-04-14 01:24:45,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=90132, PETRI_DIFFERENCE_MINUEND_PLACES=742, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=669, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=93476, PETRI_PLACES=805, PETRI_TRANSITIONS=3203} [2025-04-14 01:24:45,518 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 774 predicate places. [2025-04-14 01:24:45,518 INFO L485 AbstractCegarLoop]: Abstraction has has 805 places, 3203 transitions, 93476 flow [2025-04-14 01:24:45,518 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.684210526315789) internal successors, (178), 38 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:24:45,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:24:45,518 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-14 01:24:45,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-14 01:24:45,719 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:24:45,719 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:24:45,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:24:45,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1614266706, now seen corresponding path program 1 times [2025-04-14 01:24:45,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:24:45,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147953628] [2025-04-14 01:24:45,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:24:45,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:24:45,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:24:45,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:24:45,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:24:45,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:46,454 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-14 01:24:46,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:24:46,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147953628] [2025-04-14 01:24:46,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147953628] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:24:46,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780915108] [2025-04-14 01:24:46,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:24:46,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:24:46,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:24:46,457 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:24:46,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-14 01:24:46,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:24:46,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:24:46,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:24:46,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:46,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-14 01:24:46,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:24:46,554 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-14 01:24:47,065 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:24:47,065 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 155 treesize of output 77 [2025-04-14 01:24:47,105 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-14 01:24:47,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:24:53,085 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-14 01:24:53,091 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:24:53,092 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-14 01:24:53,225 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-14 01:24:53,233 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:24:53,233 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-14 01:24:53,699 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-14 01:24:53,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780915108] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:24:53,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:24:53,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 37 [2025-04-14 01:24:53,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085209234] [2025-04-14 01:24:53,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:24:53,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-14 01:24:53,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:24:53,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-14 01:24:53,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1332, Unknown=0, NotChecked=0, Total=1482 [2025-04-14 01:24:53,700 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:24:53,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 805 places, 3203 transitions, 93476 flow. Second operand has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 39 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:24:53,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:24:53,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:24:53,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:25:14,220 INFO L116 PetriNetUnfolderBase]: 14498/21676 cut-off events. [2025-04-14 01:25:14,221 INFO L117 PetriNetUnfolderBase]: For 932550/932550 co-relation queries the response was YES. [2025-04-14 01:25:15,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303775 conditions, 21676 events. 14498/21676 cut-off events. For 932550/932550 co-relation queries the response was YES. Maximal size of possible extension queue 1320. Compared 142147 event pairs, 793 based on Foata normal form. 2/21529 useless extension candidates. Maximal degree in co-relation 303524. Up to 15817 conditions per place. [2025-04-14 01:25:15,190 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 2577 selfloop transitions, 1744 changer transitions 3/4324 dead transitions. [2025-04-14 01:25:15,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 868 places, 4324 transitions, 133664 flow [2025-04-14 01:25:15,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-14 01:25:15,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2025-04-14 01:25:15,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 665 transitions. [2025-04-14 01:25:15,192 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32470703125 [2025-04-14 01:25:15,192 INFO L175 Difference]: Start difference. First operand has 805 places, 3203 transitions, 93476 flow. Second operand 64 states and 665 transitions. [2025-04-14 01:25:15,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 868 places, 4324 transitions, 133664 flow [2025-04-14 01:25:34,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 842 places, 4324 transitions, 131089 flow, removed 481 selfloop flow, removed 26 redundant places. [2025-04-14 01:25:34,763 INFO L231 Difference]: Finished difference. Result has 849 places, 3936 transitions, 119966 flow [2025-04-14 01:25:34,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=91745, PETRI_DIFFERENCE_MINUEND_PLACES=779, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1036, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=119966, PETRI_PLACES=849, PETRI_TRANSITIONS=3936} [2025-04-14 01:25:34,765 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 818 predicate places. [2025-04-14 01:25:34,765 INFO L485 AbstractCegarLoop]: Abstraction has has 849 places, 3936 transitions, 119966 flow [2025-04-14 01:25:34,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 39 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:25:34,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:25:34,766 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:25:34,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-14 01:25:34,966 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,SelfDestructingSolverStorable48 [2025-04-14 01:25:34,966 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:25:34,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:25:34,967 INFO L85 PathProgramCache]: Analyzing trace with hash 900798178, now seen corresponding path program 8 times [2025-04-14 01:25:34,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:25:34,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989766180] [2025-04-14 01:25:34,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:25:34,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:25:34,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:25:34,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:25:34,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:25:34,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:25:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:25:35,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:25:35,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989766180] [2025-04-14 01:25:35,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989766180] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:25:35,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636345183] [2025-04-14 01:25:35,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:25:35,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:25:35,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:25:35,637 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:25:35,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-14 01:25:35,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:25:35,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:25:35,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:25:35,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:25:35,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:25:35,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:25:36,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:25:36,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:25:36,113 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:25:36,113 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 154 treesize of output 74 [2025-04-14 01:25:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:25:36,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:25:37,594 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:25:37,594 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-14 01:25:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:25:38,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636345183] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:25:38,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:25:38,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-14 01:25:38,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475299991] [2025-04-14 01:25:38,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:25:38,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 01:25:38,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:25:38,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 01:25:38,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 01:25:38,093 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:25:38,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 849 places, 3936 transitions, 119966 flow. Second operand has 34 states, 34 states have (on average 4.794117647058823) internal successors, (163), 34 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:25:38,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:25:38,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:25:38,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:25:59,572 INFO L116 PetriNetUnfolderBase]: 15079/22542 cut-off events. [2025-04-14 01:25:59,572 INFO L117 PetriNetUnfolderBase]: For 980163/980163 co-relation queries the response was YES. [2025-04-14 01:25:59,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316615 conditions, 22542 events. 15079/22542 cut-off events. For 980163/980163 co-relation queries the response was YES. Maximal size of possible extension queue 1349. Compared 148681 event pairs, 565 based on Foata normal form. 2/22376 useless extension candidates. Maximal degree in co-relation 316358. Up to 15292 conditions per place. [2025-04-14 01:25:59,961 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 2316 selfloop transitions, 1981 changer transitions 11/4308 dead transitions. [2025-04-14 01:25:59,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 894 places, 4308 transitions, 135664 flow [2025-04-14 01:25:59,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-14 01:25:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-04-14 01:25:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 477 transitions. [2025-04-14 01:25:59,962 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32404891304347827 [2025-04-14 01:25:59,962 INFO L175 Difference]: Start difference. First operand has 849 places, 3936 transitions, 119966 flow. Second operand 46 states and 477 transitions. [2025-04-14 01:25:59,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 894 places, 4308 transitions, 135664 flow [2025-04-14 01:26:21,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 886 places, 4308 transitions, 132322 flow, removed 1243 selfloop flow, removed 8 redundant places. [2025-04-14 01:26:21,608 INFO L231 Difference]: Finished difference. Result has 893 places, 4061 transitions, 125422 flow [2025-04-14 01:26:21,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=116624, PETRI_DIFFERENCE_MINUEND_PLACES=841, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1871, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2038, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=125422, PETRI_PLACES=893, PETRI_TRANSITIONS=4061} [2025-04-14 01:26:21,611 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 862 predicate places. [2025-04-14 01:26:21,611 INFO L485 AbstractCegarLoop]: Abstraction has has 893 places, 4061 transitions, 125422 flow [2025-04-14 01:26:21,611 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.794117647058823) internal successors, (163), 34 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:21,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:21,612 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:26:21,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-14 01:26:21,812 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,SelfDestructingSolverStorable49 [2025-04-14 01:26:21,812 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:26:21,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:21,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1920041684, now seen corresponding path program 9 times [2025-04-14 01:26:21,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:21,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790342608] [2025-04-14 01:26:21,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:26:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:21,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:26:21,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:26:21,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:26:21,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:22,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:26:22,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:22,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790342608] [2025-04-14 01:26:22,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790342608] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:26:22,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24791592] [2025-04-14 01:26:22,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:26:22,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:26:22,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:26:22,532 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:26:22,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-14 01:26:22,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:26:22,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:26:22,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:26:22,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:22,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:26:22,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:26:23,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:26:23,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:26:23,038 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:26:23,039 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-14 01:26:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:26:23,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:26:24,631 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:26:24,632 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-14 01:26:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:26:25,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24791592] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:26:25,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:26:25,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 30 [2025-04-14 01:26:25,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652744985] [2025-04-14 01:26:25,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:26:25,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-14 01:26:25,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:25,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-14 01:26:25,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=855, Unknown=0, NotChecked=0, Total=992 [2025-04-14 01:26:25,161 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:26:25,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 893 places, 4061 transitions, 125422 flow. Second operand has 32 states, 32 states have (on average 4.78125) internal successors, (153), 32 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:25,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:25,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:26:25,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:48,066 INFO L116 PetriNetUnfolderBase]: 15300/22863 cut-off events. [2025-04-14 01:26:48,066 INFO L117 PetriNetUnfolderBase]: For 1030014/1030014 co-relation queries the response was YES. [2025-04-14 01:26:48,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325188 conditions, 22863 events. 15300/22863 cut-off events. For 1030014/1030014 co-relation queries the response was YES. Maximal size of possible extension queue 1365. Compared 151405 event pairs, 578 based on Foata normal form. 2/22693 useless extension candidates. Maximal degree in co-relation 324924. Up to 15350 conditions per place. [2025-04-14 01:26:48,715 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 2262 selfloop transitions, 2093 changer transitions 9/4364 dead transitions. [2025-04-14 01:26:48,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 4364 transitions, 139614 flow [2025-04-14 01:26:48,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-14 01:26:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-04-14 01:26:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 519 transitions. [2025-04-14 01:26:48,716 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3309948979591837 [2025-04-14 01:26:48,716 INFO L175 Difference]: Start difference. First operand has 893 places, 4061 transitions, 125422 flow. Second operand 49 states and 519 transitions. [2025-04-14 01:26:48,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 4364 transitions, 139614 flow [2025-04-14 01:27:11,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 4364 transitions, 136699 flow, removed 1093 selfloop flow, removed 9 redundant places. [2025-04-14 01:27:11,436 INFO L231 Difference]: Finished difference. Result has 940 places, 4140 transitions, 130244 flow [2025-04-14 01:27:11,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=122779, PETRI_DIFFERENCE_MINUEND_PLACES=882, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4061, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2020, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=130244, PETRI_PLACES=940, PETRI_TRANSITIONS=4140} [2025-04-14 01:27:11,439 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 909 predicate places. [2025-04-14 01:27:11,439 INFO L485 AbstractCegarLoop]: Abstraction has has 940 places, 4140 transitions, 130244 flow [2025-04-14 01:27:11,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.78125) internal successors, (153), 32 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:11,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:11,439 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:27:11,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-14 01:27:11,639 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,SelfDestructingSolverStorable50 [2025-04-14 01:27:11,640 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:27:11,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:11,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1622851420, now seen corresponding path program 10 times [2025-04-14 01:27:11,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:11,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937626802] [2025-04-14 01:27:11,641 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:27:11,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:11,647 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:27:11,652 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:27:11,652 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:27:11,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:27:12,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:12,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937626802] [2025-04-14 01:27:12,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937626802] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:27:12,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65911113] [2025-04-14 01:27:12,173 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:27:12,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:27:12,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:27:12,175 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:27:12,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-14 01:27:12,223 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:27:12,236 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:27:12,236 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:27:12,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:12,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:27:12,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:27:12,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:27:12,667 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:27:12,667 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-14 01:27:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:27:12,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:27:13,889 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:27:13,889 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-14 01:27:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:27:15,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65911113] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:27:15,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:27:15,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 31 [2025-04-14 01:27:15,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452761294] [2025-04-14 01:27:15,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:27:15,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 01:27:15,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:15,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 01:27:15,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=926, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 01:27:15,178 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:27:15,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 940 places, 4140 transitions, 130244 flow. Second operand has 33 states, 33 states have (on average 5.090909090909091) internal successors, (168), 33 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:15,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:15,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:27:15,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:38,970 INFO L116 PetriNetUnfolderBase]: 15817/23616 cut-off events. [2025-04-14 01:27:38,970 INFO L117 PetriNetUnfolderBase]: For 1091118/1091118 co-relation queries the response was YES. [2025-04-14 01:27:39,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340340 conditions, 23616 events. 15817/23616 cut-off events. For 1091118/1091118 co-relation queries the response was YES. Maximal size of possible extension queue 1403. Compared 156554 event pairs, 824 based on Foata normal form. 1/23404 useless extension candidates. Maximal degree in co-relation 340065. Up to 19288 conditions per place. [2025-04-14 01:27:39,666 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 3139 selfloop transitions, 1334 changer transitions 4/4477 dead transitions. [2025-04-14 01:27:39,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 982 places, 4477 transitions, 146222 flow [2025-04-14 01:27:39,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-14 01:27:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-04-14 01:27:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 449 transitions. [2025-04-14 01:27:39,667 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31889204545454547 [2025-04-14 01:27:39,667 INFO L175 Difference]: Start difference. First operand has 940 places, 4140 transitions, 130244 flow. Second operand 44 states and 449 transitions. [2025-04-14 01:27:39,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 982 places, 4477 transitions, 146222 flow [2025-04-14 01:28:03,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 966 places, 4477 transitions, 143615 flow, removed 673 selfloop flow, removed 16 redundant places. [2025-04-14 01:28:03,750 INFO L231 Difference]: Finished difference. Result has 983 places, 4308 transitions, 135654 flow [2025-04-14 01:28:03,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=127815, PETRI_DIFFERENCE_MINUEND_PLACES=923, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2881, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=135654, PETRI_PLACES=983, PETRI_TRANSITIONS=4308} [2025-04-14 01:28:03,752 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 952 predicate places. [2025-04-14 01:28:03,752 INFO L485 AbstractCegarLoop]: Abstraction has has 983 places, 4308 transitions, 135654 flow [2025-04-14 01:28:03,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.090909090909091) internal successors, (168), 33 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:28:03,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:28:03,752 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:28:03,758 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-14 01:28:03,953 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:28:03,953 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:28:03,954 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:28:03,954 INFO L85 PathProgramCache]: Analyzing trace with hash -843735882, now seen corresponding path program 11 times [2025-04-14 01:28:03,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:28:03,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224163966] [2025-04-14 01:28:03,955 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:28:03,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:28:03,959 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:28:03,965 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:28:03,966 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:28:03,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:28:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:28:04,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:28:04,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224163966] [2025-04-14 01:28:04,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224163966] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:28:04,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991266138] [2025-04-14 01:28:04,900 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:28:04,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:28:04,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:28:04,902 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:28:04,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-14 01:28:04,950 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:28:04,964 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:28:04,964 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:28:04,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:28:04,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-14 01:28:04,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:28:05,431 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-14 01:28:05,431 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-14 01:28:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:28:05,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:28:06,881 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:28:06,882 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 535 treesize of output 271 [2025-04-14 01:28:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:28:08,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991266138] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:28:08,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:28:08,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-14 01:28:08,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215255588] [2025-04-14 01:28:08,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:28:08,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 01:28:08,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:28:08,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 01:28:08,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 01:28:08,017 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:28:08,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 4308 transitions, 135654 flow. Second operand has 34 states, 34 states have (on average 5.029411764705882) internal successors, (171), 34 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-14 01:28:08,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:28:08,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:28:08,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:28:32,841 INFO L116 PetriNetUnfolderBase]: 16830/25091 cut-off events. [2025-04-14 01:28:32,842 INFO L117 PetriNetUnfolderBase]: For 1214083/1214083 co-relation queries the response was YES. [2025-04-14 01:28:33,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365565 conditions, 25091 events. 16830/25091 cut-off events. For 1214083/1214083 co-relation queries the response was YES. Maximal size of possible extension queue 1463. Compared 167383 event pairs, 803 based on Foata normal form. 2/24854 useless extension candidates. Maximal degree in co-relation 365274. Up to 18064 conditions per place. [2025-04-14 01:28:33,452 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 2758 selfloop transitions, 2063 changer transitions 6/4827 dead transitions. [2025-04-14 01:28:33,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1040 places, 4827 transitions, 156931 flow [2025-04-14 01:28:33,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-14 01:28:33,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2025-04-14 01:28:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 618 transitions. [2025-04-14 01:28:33,454 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3329741379310345 [2025-04-14 01:28:33,454 INFO L175 Difference]: Start difference. First operand has 983 places, 4308 transitions, 135654 flow. Second operand 58 states and 618 transitions. [2025-04-14 01:28:33,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1040 places, 4827 transitions, 156931 flow [2025-04-14 01:29:00,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1027 places, 4827 transitions, 152915 flow, removed 1319 selfloop flow, removed 13 redundant places. [2025-04-14 01:29:01,070 INFO L231 Difference]: Finished difference. Result has 1045 places, 4569 transitions, 145062 flow [2025-04-14 01:29:01,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=131925, PETRI_DIFFERENCE_MINUEND_PLACES=970, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1822, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=145062, PETRI_PLACES=1045, PETRI_TRANSITIONS=4569} [2025-04-14 01:29:01,072 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1014 predicate places. [2025-04-14 01:29:01,072 INFO L485 AbstractCegarLoop]: Abstraction has has 1045 places, 4569 transitions, 145062 flow [2025-04-14 01:29:01,073 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.029411764705882) internal successors, (171), 34 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-14 01:29:01,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:29:01,073 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:29:01,079 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-14 01:29:01,273 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:29:01,273 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:29:01,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:29:01,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1546514976, now seen corresponding path program 12 times [2025-04-14 01:29:01,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:29:01,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070030560] [2025-04-14 01:29:01,275 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:29:01,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:29:01,279 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:29:01,285 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:29:01,285 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:29:01,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:29:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:29:01,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:29:01,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070030560] [2025-04-14 01:29:01,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070030560] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:29:01,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210006783] [2025-04-14 01:29:01,900 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:29:01,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:29:01,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:29:01,902 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:29:01,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-14 01:29:01,951 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:29:01,964 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:29:01,964 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:29:01,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:29:01,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 01:29:01,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:29:02,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:29:02,350 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:29:02,350 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 157 treesize of output 87 [2025-04-14 01:29:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:29:03,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:29:04,092 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:29:04,093 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-14 01:29:04,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-14 01:29:04,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210006783] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:29:04,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:29:04,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 31 [2025-04-14 01:29:04,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689259723] [2025-04-14 01:29:04,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:29:04,651 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 01:29:04,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:29:04,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 01:29:04,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 01:29:04,652 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:29:04,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1045 places, 4569 transitions, 145062 flow. Second operand has 33 states, 33 states have (on average 4.757575757575758) internal successors, (157), 33 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:29:04,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:29:04,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:29:04,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:29:35,782 INFO L116 PetriNetUnfolderBase]: 18283/27206 cut-off events. [2025-04-14 01:29:35,782 INFO L117 PetriNetUnfolderBase]: For 1351196/1351196 co-relation queries the response was YES. [2025-04-14 01:29:36,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402989 conditions, 27206 events. 18283/27206 cut-off events. For 1351196/1351196 co-relation queries the response was YES. Maximal size of possible extension queue 1570. Compared 183200 event pairs, 560 based on Foata normal form. 3/26938 useless extension candidates. Maximal degree in co-relation 402679. Up to 18392 conditions per place. [2025-04-14 01:29:37,044 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 2593 selfloop transitions, 2816 changer transitions 15/5424 dead transitions. [2025-04-14 01:29:37,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1114 places, 5424 transitions, 177586 flow [2025-04-14 01:29:37,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-14 01:29:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2025-04-14 01:29:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 705 transitions. [2025-04-14 01:29:37,045 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31473214285714285 [2025-04-14 01:29:37,045 INFO L175 Difference]: Start difference. First operand has 1045 places, 4569 transitions, 145062 flow. Second operand 70 states and 705 transitions. [2025-04-14 01:29:37,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1114 places, 5424 transitions, 177586 flow Received shutdown request... [2025-04-14 01:30:04,042 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 01:30:04,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-14 01:30:04,080 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:30:04,080 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:30:04,242 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:30:04,243 WARN L610 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2025-04-14 01:30:04,244 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 01:30:04,244 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 01:30:04,244 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 01:30:04,245 INFO L422 BasicCegarLoop]: Path program histogram: [28, 12, 8, 1, 1, 1, 1, 1, 1] [2025-04-14 01:30:04,247 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:30:04,247 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:30:04,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:30:04 BasicIcfg [2025-04-14 01:30:04,250 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:30:04,251 INFO L158 Benchmark]: Toolchain (without parser) took 775224.13ms. Allocated memory was 155.2MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 109.4MB in the beginning and 1.1GB in the end (delta: -964.6MB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2025-04-14 01:30:04,251 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:30:04,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.03ms. Allocated memory is still 155.2MB. Free memory was 109.4MB in the beginning and 94.2MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:30:04,251 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.39ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 92.8MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:30:04,251 INFO L158 Benchmark]: Boogie Preprocessor took 44.25ms. Allocated memory is still 155.2MB. Free memory was 92.8MB in the beginning and 90.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:30:04,251 INFO L158 Benchmark]: IcfgBuilder took 536.94ms. Allocated memory is still 155.2MB. Free memory was 90.6MB in the beginning and 43.9MB in the end (delta: 46.8MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-14 01:30:04,252 INFO L158 Benchmark]: TraceAbstraction took 774404.72ms. Allocated memory was 155.2MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 43.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2025-04-14 01:30:04,252 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.03ms. Allocated memory is still 155.2MB. Free memory was 109.4MB in the beginning and 94.2MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.39ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 92.8MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.25ms. Allocated memory is still 155.2MB. Free memory was 92.8MB in the beginning and 90.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 536.94ms. Allocated memory is still 155.2MB. Free memory was 90.6MB in the beginning and 43.9MB in the end (delta: 46.8MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 774404.72ms. Allocated memory was 155.2MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 43.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 41 locations, 53 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 774.3s, OverallIterations: 54, TraceHistogramMax: 2, PathProgramHistogramMax: 28, EmptinessCheckTime: 0.0s, AutomataDifference: 695.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7524 SdHoareTripleChecker+Valid, 35.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7524 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 30.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1357 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59045 IncrementalHoareTripleChecker+Invalid, 60402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1357 mSolverCounterUnsat, 0 mSDtfsCounter, 59045 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2519 GetRequests, 836 SyntacticMatches, 44 SemanticMatches, 1639 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23111 ImplicationChecksByTransitivity, 72.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145062occurred in iteration=53, InterpolantAutomatonStates: 1197, 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, 70.2s InterpolantComputationTime, 1829 NumberOfCodeBlocks, 1809 NumberOfCodeBlocksAsserted, 124 NumberOfCheckSat, 2357 ConstructedInterpolants, 0 QuantifiedInterpolants, 104351 SizeOfPredicates, 341 NumberOfNonLiveVariables, 5311 ConjunctsInSsa, 657 ConjunctsInUnsatCore, 111 InterpolantComputations, 30 PerfectInterpolantSequences, 161/319 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