/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:53:45,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:53:45,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:53:45,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:53:45,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:53:45,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:53:45,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:53:45,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:53:45,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:53:45,699 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:53:45,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:53:45,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:53:45,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:53:45,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:53:45,701 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:53:45,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:53:45,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:53:45,701 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:53:45,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:53:45,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:53:45,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:53:45,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:53:45,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:53:45,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:53:45,702 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:53:45,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:53:45,702 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:53:45,702 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:53:45,702 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:53:45,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:53:45,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:53:45,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:53:45,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:53:45,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:53:45,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:53:45,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:53:45,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:53:45,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:53:45,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:53:45,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:53:45,703 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:53:45,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:53:45,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:53:45,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:53:45,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:53:45,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:53:45,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:53:45,703 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:53:45,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:53:45,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:53:45,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:53:45,904 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:53:45,904 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:53:45,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2025-04-13 20:53:47,132 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c0e5c76/094e478567f34907ae3eaf92fe585c53/FLAGc9adcd3da [2025-04-13 20:53:47,347 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:53:47,347 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2025-04-13 20:53:47,358 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c0e5c76/094e478567f34907ae3eaf92fe585c53/FLAGc9adcd3da [2025-04-13 20:53:48,182 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c0e5c76/094e478567f34907ae3eaf92fe585c53 [2025-04-13 20:53:48,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:53:48,185 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:53:48,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:53:48,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:53:48,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:53:48,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:53:48" (1/1) ... [2025-04-13 20:53:48,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1e87f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:53:48, skipping insertion in model container [2025-04-13 20:53:48,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:53:48" (1/1) ... [2025-04-13 20:53:48,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:53:48,363 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-queue-add-3.wvr.c[3451,3464] [2025-04-13 20:53:48,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:53:48,376 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:53:48,407 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-queue-add-3.wvr.c[3451,3464] [2025-04-13 20:53:48,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:53:48,422 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:53:48,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:53:48 WrapperNode [2025-04-13 20:53:48,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:53:48,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:53:48,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:53:48,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:53:48,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:53:48" (1/1) ... [2025-04-13 20:53:48,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:53:48" (1/1) ... [2025-04-13 20:53:48,462 INFO L138 Inliner]: procedures = 24, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 224 [2025-04-13 20:53:48,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:53:48,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:53:48,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:53:48,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:53:48,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:53:48" (1/1) ... [2025-04-13 20:53:48,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:53:48" (1/1) ... [2025-04-13 20:53:48,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:53:48" (1/1) ... [2025-04-13 20:53:48,490 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 2 writes are split as follows [0, 2]. [2025-04-13 20:53:48,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:53:48" (1/1) ... [2025-04-13 20:53:48,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:53:48" (1/1) ... [2025-04-13 20:53:48,496 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:53:48" (1/1) ... [2025-04-13 20:53:48,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:53:48" (1/1) ... [2025-04-13 20:53:48,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:53:48" (1/1) ... [2025-04-13 20:53:48,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:53:48" (1/1) ... [2025-04-13 20:53:48,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:53:48" (1/1) ... [2025-04-13 20:53:48,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:53:48,504 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:53:48,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:53:48,504 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:53:48,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:53:48" (1/1) ... [2025-04-13 20:53:48,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:53:48,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:53:48,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:53:48,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:53:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:53:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:53:48,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:53:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:53:48,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:53:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:53:48,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:53:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:53:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:53:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:53:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:53:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:53:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:53:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:53:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:53:48,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:53:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:53:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:53:48,545 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:53:48,622 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:53:48,624 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:53:48,888 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:53:48,888 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:53:48,888 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:53:49,158 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:53:49,160 INFO L313 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-13 20:53:49,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:53:49 BoogieIcfgContainer [2025-04-13 20:53:49,160 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:53:49,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:53:49,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:53:49,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:53:49,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:53:48" (1/3) ... [2025-04-13 20:53:49,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56198fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:53:49, skipping insertion in model container [2025-04-13 20:53:49,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:53:48" (2/3) ... [2025-04-13 20:53:49,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56198fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:53:49, skipping insertion in model container [2025-04-13 20:53:49,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:53:49" (3/3) ... [2025-04-13 20:53:49,168 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2025-04-13 20:53:49,178 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:53:49,179 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-3.wvr.c that has 4 procedures, 30 locations, 34 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-13 20:53:49,179 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:53:49,222 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:53:49,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 95 flow [2025-04-13 20:53:49,266 INFO L116 PetriNetUnfolderBase]: 8/34 cut-off events. [2025-04-13 20:53:49,267 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:53:49,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 8/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-13 20:53:49,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 37 transitions, 95 flow [2025-04-13 20:53:49,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 33 transitions, 84 flow [2025-04-13 20:53:49,277 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:53:49,284 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;@7f7e5620, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:53:49,284 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:53:49,297 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:53:49,297 INFO L116 PetriNetUnfolderBase]: 8/32 cut-off events. [2025-04-13 20:53:49,297 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:53:49,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:53:49,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-13 20:53:49,299 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:53:49,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:53:49,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1665610775, now seen corresponding path program 1 times [2025-04-13 20:53:49,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:53:49,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941947086] [2025-04-13 20:53:49,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:53:49,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:53:49,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:53:49,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:53:49,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:53:49,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:53:49,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:53:49,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941947086] [2025-04-13 20:53:49,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941947086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:53:49,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:53:49,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:53:49,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284646365] [2025-04-13 20:53:49,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:53:49,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 20:53:49,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:53:49,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 20:53:49,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 20:53:49,497 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:53:49,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:49,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:53:49,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:53:49,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:53:49,712 INFO L116 PetriNetUnfolderBase]: 831/1172 cut-off events. [2025-04-13 20:53:49,712 INFO L117 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-04-13 20:53:49,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2448 conditions, 1172 events. 831/1172 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3786 event pairs, 595 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 2264. Up to 1173 conditions per place. [2025-04-13 20:53:49,722 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 31 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2025-04-13 20:53:49,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 142 flow [2025-04-13 20:53:49,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 20:53:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 20:53:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2025-04-13 20:53:49,731 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2025-04-13 20:53:49,732 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 84 flow. Second operand 2 states and 39 transitions. [2025-04-13 20:53:49,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 142 flow [2025-04-13 20:53:49,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:53:49,740 INFO L231 Difference]: Finished difference. Result has 30 places, 31 transitions, 68 flow [2025-04-13 20:53:49,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=30, PETRI_TRANSITIONS=31} [2025-04-13 20:53:49,744 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2025-04-13 20:53:49,745 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 68 flow [2025-04-13 20:53:49,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:49,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:53:49,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:53:49,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:53:49,746 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:53:49,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:53:49,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2032189125, now seen corresponding path program 1 times [2025-04-13 20:53:49,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:53:49,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542721331] [2025-04-13 20:53:49,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:53:49,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:53:49,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:53:49,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:53:49,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:53:49,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:53:49,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:53:49,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542721331] [2025-04-13 20:53:49,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542721331] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:53:49,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:53:49,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:53:49,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343409529] [2025-04-13 20:53:49,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:53:49,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:53:49,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:53:49,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:53:49,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:53:49,989 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:53:49,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:49,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:53:49,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:53:49,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:53:50,182 INFO L116 PetriNetUnfolderBase]: 932/1343 cut-off events. [2025-04-13 20:53:50,182 INFO L117 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-04-13 20:53:50,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2736 conditions, 1343 events. 932/1343 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4599 event pairs, 682 based on Foata normal form. 74/1144 useless extension candidates. Maximal degree in co-relation 2733. Up to 1173 conditions per place. [2025-04-13 20:53:50,187 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 30 selfloop transitions, 2 changer transitions 18/50 dead transitions. [2025-04-13 20:53:50,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 50 transitions, 209 flow [2025-04-13 20:53:50,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:53:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:53:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2025-04-13 20:53:50,189 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3675675675675676 [2025-04-13 20:53:50,189 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 68 flow. Second operand 5 states and 68 transitions. [2025-04-13 20:53:50,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 50 transitions, 209 flow [2025-04-13 20:53:50,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 20:53:50,191 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 90 flow [2025-04-13 20:53:50,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-04-13 20:53:50,191 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-04-13 20:53:50,191 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 90 flow [2025-04-13 20:53:50,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:50,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:53:50,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:53:50,192 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:53:50,192 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:53:50,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:53:50,192 INFO L85 PathProgramCache]: Analyzing trace with hash 609050871, now seen corresponding path program 1 times [2025-04-13 20:53:50,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:53:50,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813661972] [2025-04-13 20:53:50,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:53:50,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:53:50,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:53:50,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:53:50,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:53:50,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:53:50,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:53:50,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813661972] [2025-04-13 20:53:50,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813661972] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:53:50,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:53:50,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:53:50,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633982145] [2025-04-13 20:53:50,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:53:50,332 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:53:50,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:53:50,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:53:50,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:53:50,333 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:53:50,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:50,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:53:50,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:53:50,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:53:50,495 INFO L116 PetriNetUnfolderBase]: 1051/1521 cut-off events. [2025-04-13 20:53:50,495 INFO L117 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2025-04-13 20:53:50,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3366 conditions, 1521 events. 1051/1521 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5425 event pairs, 775 based on Foata normal form. 77/1321 useless extension candidates. Maximal degree in co-relation 3359. Up to 1174 conditions per place. [2025-04-13 20:53:50,502 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 31 selfloop transitions, 2 changer transitions 18/51 dead transitions. [2025-04-13 20:53:50,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 51 transitions, 244 flow [2025-04-13 20:53:50,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:53:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:53:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-13 20:53:50,504 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2025-04-13 20:53:50,504 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 90 flow. Second operand 4 states and 64 transitions. [2025-04-13 20:53:50,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 51 transitions, 244 flow [2025-04-13 20:53:50,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 51 transitions, 232 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-13 20:53:50,505 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 98 flow [2025-04-13 20:53:50,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-04-13 20:53:50,506 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-04-13 20:53:50,506 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 98 flow [2025-04-13 20:53:50,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:50,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:53:50,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:53:50,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:53:50,506 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:53:50,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:53:50,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1857927114, now seen corresponding path program 1 times [2025-04-13 20:53:50,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:53:50,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085813753] [2025-04-13 20:53:50,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:53:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:53:50,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:53:50,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:53:50,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:53:50,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:53:50,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:53:50,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085813753] [2025-04-13 20:53:50,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085813753] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:53:50,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:53:50,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:53:50,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556942202] [2025-04-13 20:53:50,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:53:50,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:53:50,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:53:50,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:53:50,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:53:50,707 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:53:50,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 98 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:50,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:53:50,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:53:50,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:53:50,991 INFO L116 PetriNetUnfolderBase]: 1702/2426 cut-off events. [2025-04-13 20:53:50,991 INFO L117 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2025-04-13 20:53:50,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5581 conditions, 2426 events. 1702/2426 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9701 event pairs, 595 based on Foata normal form. 1/1957 useless extension candidates. Maximal degree in co-relation 5573. Up to 1050 conditions per place. [2025-04-13 20:53:51,003 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 78 selfloop transitions, 7 changer transitions 2/87 dead transitions. [2025-04-13 20:53:51,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 87 transitions, 416 flow [2025-04-13 20:53:51,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:53:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:53:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2025-04-13 20:53:51,006 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46846846846846846 [2025-04-13 20:53:51,006 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 98 flow. Second operand 6 states and 104 transitions. [2025-04-13 20:53:51,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 87 transitions, 416 flow [2025-04-13 20:53:51,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 87 transitions, 412 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:53:51,010 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 133 flow [2025-04-13 20:53:51,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2025-04-13 20:53:51,012 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2025-04-13 20:53:51,012 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 133 flow [2025-04-13 20:53:51,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:51,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:53:51,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:53:51,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:53:51,012 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:53:51,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:53:51,013 INFO L85 PathProgramCache]: Analyzing trace with hash -271203024, now seen corresponding path program 1 times [2025-04-13 20:53:51,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:53:51,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619796027] [2025-04-13 20:53:51,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:53:51,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:53:51,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:53:51,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:53:51,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:53:51,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:53:51,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:53:51,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619796027] [2025-04-13 20:53:51,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619796027] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:53:51,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107829443] [2025-04-13 20:53:51,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:53:51,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:53:51,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:53:51,176 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:53:51,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:53:51,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:53:51,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:53:51,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:53:51,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:51,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:53:51,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:53:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:53:51,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:53:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:53:51,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107829443] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:53:51,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:53:51,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:53:51,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428781562] [2025-04-13 20:53:51,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:53:51,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:53:51,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:53:51,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:53:51,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:53:51,435 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:53:51,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 133 flow. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:51,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:53:51,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:53:51,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:53:51,820 INFO L116 PetriNetUnfolderBase]: 3152/4541 cut-off events. [2025-04-13 20:53:51,820 INFO L117 PetriNetUnfolderBase]: For 2256/2256 co-relation queries the response was YES. [2025-04-13 20:53:51,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11651 conditions, 4541 events. 3152/4541 cut-off events. For 2256/2256 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21122 event pairs, 1553 based on Foata normal form. 204/4331 useless extension candidates. Maximal degree in co-relation 11640. Up to 2426 conditions per place. [2025-04-13 20:53:51,836 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 74 selfloop transitions, 6 changer transitions 9/89 dead transitions. [2025-04-13 20:53:51,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 500 flow [2025-04-13 20:53:51,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:53:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:53:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2025-04-13 20:53:51,837 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2025-04-13 20:53:51,837 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 133 flow. Second operand 7 states and 98 transitions. [2025-04-13 20:53:51,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 500 flow [2025-04-13 20:53:51,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 497 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:53:51,841 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 187 flow [2025-04-13 20:53:51,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2025-04-13 20:53:51,841 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2025-04-13 20:53:51,841 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 187 flow [2025-04-13 20:53:51,842 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:51,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:53:51,842 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, 1, 1, 1, 1, 1] [2025-04-13 20:53:51,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 20:53:52,046 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:53:52,046 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:53:52,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:53:52,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1710969246, now seen corresponding path program 1 times [2025-04-13 20:53:52,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:53:52,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873545965] [2025-04-13 20:53:52,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:53:52,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:53:52,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:53:52,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:53:52,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:53:52,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:52,114 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-13 20:53:52,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:53:52,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873545965] [2025-04-13 20:53:52,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873545965] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:53:52,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:53:52,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:53:52,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379373225] [2025-04-13 20:53:52,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:53:52,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:53:52,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:53:52,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:53:52,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:53:52,115 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:53:52,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:52,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:53:52,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:53:52,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:53:52,319 INFO L116 PetriNetUnfolderBase]: 2148/3167 cut-off events. [2025-04-13 20:53:52,319 INFO L117 PetriNetUnfolderBase]: For 2745/2745 co-relation queries the response was YES. [2025-04-13 20:53:52,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8826 conditions, 3167 events. 2148/3167 cut-off events. For 2745/2745 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13533 event pairs, 719 based on Foata normal form. 87/2994 useless extension candidates. Maximal degree in co-relation 8810. Up to 2461 conditions per place. [2025-04-13 20:53:52,332 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 53 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-04-13 20:53:52,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 55 transitions, 349 flow [2025-04-13 20:53:52,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:53:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:53:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-04-13 20:53:52,334 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2025-04-13 20:53:52,334 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 187 flow. Second operand 3 states and 55 transitions. [2025-04-13 20:53:52,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 55 transitions, 349 flow [2025-04-13 20:53:52,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 316 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-04-13 20:53:52,339 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 178 flow [2025-04-13 20:53:52,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2025-04-13 20:53:52,339 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2025-04-13 20:53:52,339 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 178 flow [2025-04-13 20:53:52,339 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:52,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:53:52,339 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, 1, 1, 1, 1, 1] [2025-04-13 20:53:52,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:53:52,340 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:53:52,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:53:52,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1479815322, now seen corresponding path program 2 times [2025-04-13 20:53:52,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:53:52,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859667896] [2025-04-13 20:53:52,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:53:52,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:53:52,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:53:52,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:53:52,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:53:52,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:53:52,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:53:52,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859667896] [2025-04-13 20:53:52,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859667896] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:53:52,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:53:52,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:53:52,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785491328] [2025-04-13 20:53:52,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:53:52,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:53:52,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:53:52,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:53:52,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:53:52,433 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:53:52,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:52,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:53:52,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:53:52,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:53:52,825 INFO L116 PetriNetUnfolderBase]: 4744/6929 cut-off events. [2025-04-13 20:53:52,825 INFO L117 PetriNetUnfolderBase]: For 3992/3992 co-relation queries the response was YES. [2025-04-13 20:53:52,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18455 conditions, 6929 events. 4744/6929 cut-off events. For 3992/3992 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 33450 event pairs, 1276 based on Foata normal form. 74/6359 useless extension candidates. Maximal degree in co-relation 18440. Up to 2565 conditions per place. [2025-04-13 20:53:52,855 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 86 selfloop transitions, 6 changer transitions 0/92 dead transitions. [2025-04-13 20:53:52,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 92 transitions, 539 flow [2025-04-13 20:53:52,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:53:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:53:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-04-13 20:53:52,856 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5878378378378378 [2025-04-13 20:53:52,856 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 178 flow. Second operand 4 states and 87 transitions. [2025-04-13 20:53:52,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 92 transitions, 539 flow [2025-04-13 20:53:52,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 92 transitions, 535 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:53:52,860 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 231 flow [2025-04-13 20:53:52,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2025-04-13 20:53:52,861 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2025-04-13 20:53:52,861 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 231 flow [2025-04-13 20:53:52,861 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:52,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:53:52,861 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, 1, 1, 1, 1, 1, 1] [2025-04-13 20:53:52,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:53:52,861 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:53:52,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:53:52,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1283095770, now seen corresponding path program 2 times [2025-04-13 20:53:52,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:53:52,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054293113] [2025-04-13 20:53:52,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:53:52,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:53:52,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:53:52,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-04-13 20:53:52,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:53:52,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:53:53,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:53:53,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054293113] [2025-04-13 20:53:53,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054293113] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:53:53,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:53:53,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:53:53,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401096508] [2025-04-13 20:53:53,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:53:53,020 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:53:53,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:53:53,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:53:53,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:53:53,020 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:53:53,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:53,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:53:53,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:53:53,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:53:53,459 INFO L116 PetriNetUnfolderBase]: 3802/5676 cut-off events. [2025-04-13 20:53:53,459 INFO L117 PetriNetUnfolderBase]: For 5445/5445 co-relation queries the response was YES. [2025-04-13 20:53:53,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16112 conditions, 5676 events. 3802/5676 cut-off events. For 5445/5445 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 27717 event pairs, 1032 based on Foata normal form. 18/5178 useless extension candidates. Maximal degree in co-relation 16095. Up to 3772 conditions per place. [2025-04-13 20:53:53,487 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 80 selfloop transitions, 9 changer transitions 0/89 dead transitions. [2025-04-13 20:53:53,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 89 transitions, 569 flow [2025-04-13 20:53:53,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:53:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:53:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2025-04-13 20:53:53,488 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40540540540540543 [2025-04-13 20:53:53,488 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 231 flow. Second operand 6 states and 90 transitions. [2025-04-13 20:53:53,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 89 transitions, 569 flow [2025-04-13 20:53:53,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 89 transitions, 546 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-13 20:53:53,499 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 270 flow [2025-04-13 20:53:53,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2025-04-13 20:53:53,501 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-04-13 20:53:53,501 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 270 flow [2025-04-13 20:53:53,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:53,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:53:53,502 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:53:53,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:53:53,502 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:53:53,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:53:53,503 INFO L85 PathProgramCache]: Analyzing trace with hash 263809816, now seen corresponding path program 1 times [2025-04-13 20:53:53,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:53:53,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046184153] [2025-04-13 20:53:53,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:53:53,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:53:53,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 20:53:53,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 20:53:53,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:53:53,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:53:53,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:53:53,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046184153] [2025-04-13 20:53:53,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046184153] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:53:53,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469599132] [2025-04-13 20:53:53,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:53:53,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:53:53,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:53:53,667 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:53:53,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:53:53,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 20:53:53,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 20:53:53,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:53:53,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:53,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:53:53,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:53:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:53:53,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:53:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:53:53,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469599132] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:53:53,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:53:53,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-04-13 20:53:53,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461610746] [2025-04-13 20:53:53,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:53:53,905 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:53:53,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:53:53,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:53:53,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:53:53,906 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:53:53,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 270 flow. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:53,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:53:53,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:53:53,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:53:54,293 INFO L116 PetriNetUnfolderBase]: 3124/4651 cut-off events. [2025-04-13 20:53:54,293 INFO L117 PetriNetUnfolderBase]: For 5626/5626 co-relation queries the response was YES. [2025-04-13 20:53:54,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14409 conditions, 4651 events. 3124/4651 cut-off events. For 5626/5626 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 21300 event pairs, 1474 based on Foata normal form. 29/4500 useless extension candidates. Maximal degree in co-relation 14390. Up to 4116 conditions per place. [2025-04-13 20:53:54,311 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 49 selfloop transitions, 5 changer transitions 39/93 dead transitions. [2025-04-13 20:53:54,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 93 transitions, 585 flow [2025-04-13 20:53:54,311 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:53:54,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:53:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2025-04-13 20:53:54,312 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32432432432432434 [2025-04-13 20:53:54,312 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 270 flow. Second operand 9 states and 108 transitions. [2025-04-13 20:53:54,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 93 transitions, 585 flow [2025-04-13 20:53:54,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 93 transitions, 582 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:53:54,319 INFO L231 Difference]: Finished difference. Result has 72 places, 47 transitions, 253 flow [2025-04-13 20:53:54,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=253, PETRI_PLACES=72, PETRI_TRANSITIONS=47} [2025-04-13 20:53:54,320 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2025-04-13 20:53:54,320 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 47 transitions, 253 flow [2025-04-13 20:53:54,320 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:54,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:53:54,320 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:53:54,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 20:53:54,520 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,SelfDestructingSolverStorable8 [2025-04-13 20:53:54,521 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:53:54,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:53:54,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1927190842, now seen corresponding path program 2 times [2025-04-13 20:53:54,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:53:54,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752674438] [2025-04-13 20:53:54,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:53:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:53:54,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:53:54,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:53:54,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:53:54,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:53:54,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:53:54,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752674438] [2025-04-13 20:53:54,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752674438] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:53:54,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559878663] [2025-04-13 20:53:54,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:53:54,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:53:54,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:53:54,663 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:53:54,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:53:54,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:53:54,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:53:54,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:53:54,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:54,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 20:53:54,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:53:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:53:54,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:53:54,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559878663] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:53:54,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:53:54,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-04-13 20:53:54,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520343070] [2025-04-13 20:53:54,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:53:54,786 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:53:54,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:53:54,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:53:54,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:53:54,787 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:53:54,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 47 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:54,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:53:54,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:53:54,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:53:55,308 INFO L116 PetriNetUnfolderBase]: 6564/9574 cut-off events. [2025-04-13 20:53:55,309 INFO L117 PetriNetUnfolderBase]: For 16196/16196 co-relation queries the response was YES. [2025-04-13 20:53:55,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30336 conditions, 9574 events. 6564/9574 cut-off events. For 16196/16196 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 49548 event pairs, 2094 based on Foata normal form. 229/9277 useless extension candidates. Maximal degree in co-relation 30314. Up to 3634 conditions per place. [2025-04-13 20:53:55,349 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 97 selfloop transitions, 8 changer transitions 4/109 dead transitions. [2025-04-13 20:53:55,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 768 flow [2025-04-13 20:53:55,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:53:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:53:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-04-13 20:53:55,350 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2025-04-13 20:53:55,350 INFO L175 Difference]: Start difference. First operand has 72 places, 47 transitions, 253 flow. Second operand 4 states and 89 transitions. [2025-04-13 20:53:55,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 768 flow [2025-04-13 20:53:55,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 746 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-04-13 20:53:55,360 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 288 flow [2025-04-13 20:53:55,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2025-04-13 20:53:55,362 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-04-13 20:53:55,362 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 288 flow [2025-04-13 20:53:55,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:55,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:53:55,362 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, 1, 1, 1, 1, 1, 1] [2025-04-13 20:53:55,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 20:53:55,563 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:53:55,563 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:53:55,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:53:55,563 INFO L85 PathProgramCache]: Analyzing trace with hash -370259014, now seen corresponding path program 1 times [2025-04-13 20:53:55,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:53:55,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261889487] [2025-04-13 20:53:55,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:53:55,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:53:55,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:53:55,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:53:55,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:53:55,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:53:55,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:53:55,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261889487] [2025-04-13 20:53:55,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261889487] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:53:55,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29404216] [2025-04-13 20:53:55,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:53:55,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:53:55,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:53:55,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:53:55,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:53:55,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:53:55,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:53:55,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:53:55,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:55,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:53:55,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:53:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:53:55,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:53:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:53:55,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29404216] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:53:55,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:53:55,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 20:53:55,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787792407] [2025-04-13 20:53:55,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:53:55,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:53:55,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:53:55,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:53:55,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:53:55,943 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:53:55,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 288 flow. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:55,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:53:55,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:53:55,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:53:56,618 INFO L116 PetriNetUnfolderBase]: 7747/11375 cut-off events. [2025-04-13 20:53:56,618 INFO L117 PetriNetUnfolderBase]: For 24106/24106 co-relation queries the response was YES. [2025-04-13 20:53:56,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38732 conditions, 11375 events. 7747/11375 cut-off events. For 24106/24106 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 58358 event pairs, 5354 based on Foata normal form. 195/10890 useless extension candidates. Maximal degree in co-relation 38711. Up to 9220 conditions per place. [2025-04-13 20:53:56,667 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 47 selfloop transitions, 3 changer transitions 44/94 dead transitions. [2025-04-13 20:53:56,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 723 flow [2025-04-13 20:53:56,668 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:53:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:53:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-04-13 20:53:56,669 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2025-04-13 20:53:56,669 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 288 flow. Second operand 6 states and 84 transitions. [2025-04-13 20:53:56,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 723 flow [2025-04-13 20:53:56,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 94 transitions, 659 flow, removed 32 selfloop flow, removed 1 redundant places. [2025-04-13 20:53:56,683 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 286 flow [2025-04-13 20:53:56,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2025-04-13 20:53:56,684 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 34 predicate places. [2025-04-13 20:53:56,684 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 286 flow [2025-04-13 20:53:56,684 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:56,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:53:56,684 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:53:56,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 20:53:56,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:53:56,885 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:53:56,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:53:56,885 INFO L85 PathProgramCache]: Analyzing trace with hash -521187907, now seen corresponding path program 2 times [2025-04-13 20:53:56,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:53:56,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156437726] [2025-04-13 20:53:56,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:53:56,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:53:56,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 20:53:56,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:53:56,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:53:56,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:53:58,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:53:58,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156437726] [2025-04-13 20:53:58,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156437726] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:53:58,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308512350] [2025-04-13 20:53:58,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:53:58,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:53:58,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:53:58,035 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:53:58,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:53:58,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 20:53:58,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:53:58,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:53:58,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:58,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 20:53:58,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:53:58,322 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 24 treesize of output 8 [2025-04-13 20:53:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:53:58,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:53:58,506 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:53:58,506 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 24 treesize of output 11 [2025-04-13 20:53:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:53:58,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308512350] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:53:58,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:53:58,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 10] total 32 [2025-04-13 20:53:58,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930387717] [2025-04-13 20:53:58,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:53:58,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 20:53:58,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:53:58,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 20:53:58,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 20:53:58,764 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:53:58,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 286 flow. Second operand has 33 states, 33 states have (on average 5.606060606060606) internal successors, (185), 33 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:53:58,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:53:58,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:53:58,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:54:03,266 INFO L116 PetriNetUnfolderBase]: 24551/36131 cut-off events. [2025-04-13 20:54:03,266 INFO L117 PetriNetUnfolderBase]: For 66368/66368 co-relation queries the response was YES. [2025-04-13 20:54:03,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118593 conditions, 36131 events. 24551/36131 cut-off events. For 66368/66368 co-relation queries the response was YES. Maximal size of possible extension queue 1155. Compared 226454 event pairs, 1230 based on Foata normal form. 1470/35523 useless extension candidates. Maximal degree in co-relation 118569. Up to 4771 conditions per place. [2025-04-13 20:54:03,424 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 635 selfloop transitions, 103 changer transitions 35/773 dead transitions. [2025-04-13 20:54:03,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 773 transitions, 5220 flow [2025-04-13 20:54:03,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 20:54:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-04-13 20:54:03,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 809 transitions. [2025-04-13 20:54:03,428 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3835941204362257 [2025-04-13 20:54:03,428 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 286 flow. Second operand 57 states and 809 transitions. [2025-04-13 20:54:03,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 773 transitions, 5220 flow [2025-04-13 20:54:03,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 773 transitions, 5166 flow, removed 23 selfloop flow, removed 4 redundant places. [2025-04-13 20:54:03,503 INFO L231 Difference]: Finished difference. Result has 150 places, 150 transitions, 1420 flow [2025-04-13 20:54:03,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=1420, PETRI_PLACES=150, PETRI_TRANSITIONS=150} [2025-04-13 20:54:03,504 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 115 predicate places. [2025-04-13 20:54:03,504 INFO L485 AbstractCegarLoop]: Abstraction has has 150 places, 150 transitions, 1420 flow [2025-04-13 20:54:03,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.606060606060606) internal successors, (185), 33 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:54:03,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:54:03,504 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:54:03,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:54:03,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 20:54:03,705 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:54:03,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:54:03,706 INFO L85 PathProgramCache]: Analyzing trace with hash -928568395, now seen corresponding path program 3 times [2025-04-13 20:54:03,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:54:03,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020293081] [2025-04-13 20:54:03,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:54:03,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:54:03,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-04-13 20:54:03,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 32 statements. [2025-04-13 20:54:03,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:54:03,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:54:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 20:54:03,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:54:03,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020293081] [2025-04-13 20:54:03,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020293081] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:54:03,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:54:03,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:54:03,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842706969] [2025-04-13 20:54:03,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:54:03,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:54:03,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:54:03,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:54:03,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:54:03,844 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:54:03,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 150 transitions, 1420 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:54:03,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:54:03,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:54:03,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:54:06,880 INFO L116 PetriNetUnfolderBase]: 21423/31542 cut-off events. [2025-04-13 20:54:06,880 INFO L117 PetriNetUnfolderBase]: For 275327/275327 co-relation queries the response was YES. [2025-04-13 20:54:07,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153601 conditions, 31542 events. 21423/31542 cut-off events. For 275327/275327 co-relation queries the response was YES. Maximal size of possible extension queue 991. Compared 192443 event pairs, 1868 based on Foata normal form. 1310/31030 useless extension candidates. Maximal degree in co-relation 153549. Up to 13991 conditions per place. [2025-04-13 20:54:07,085 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 173 selfloop transitions, 53 changer transitions 0/226 dead transitions. [2025-04-13 20:54:07,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 226 transitions, 2411 flow [2025-04-13 20:54:07,086 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:54:07,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:54:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2025-04-13 20:54:07,086 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-13 20:54:07,086 INFO L175 Difference]: Start difference. First operand has 150 places, 150 transitions, 1420 flow. Second operand 8 states and 111 transitions. [2025-04-13 20:54:07,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 226 transitions, 2411 flow [2025-04-13 20:54:08,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 226 transitions, 2154 flow, removed 99 selfloop flow, removed 10 redundant places. [2025-04-13 20:54:08,227 INFO L231 Difference]: Finished difference. Result has 146 places, 147 transitions, 1336 flow [2025-04-13 20:54:08,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1336, PETRI_PLACES=146, PETRI_TRANSITIONS=147} [2025-04-13 20:54:08,228 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 111 predicate places. [2025-04-13 20:54:08,228 INFO L485 AbstractCegarLoop]: Abstraction has has 146 places, 147 transitions, 1336 flow [2025-04-13 20:54:08,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:54:08,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:54:08,228 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:54:08,228 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:54:08,228 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:54:08,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:54:08,229 INFO L85 PathProgramCache]: Analyzing trace with hash 891601327, now seen corresponding path program 1 times [2025-04-13 20:54:08,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:54:08,229 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996067434] [2025-04-13 20:54:08,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:54:08,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:54:08,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 20:54:08,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:54:08,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:54:08,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:54:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:54:09,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:54:09,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996067434] [2025-04-13 20:54:09,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996067434] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:54:09,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360070551] [2025-04-13 20:54:09,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:54:09,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:54:09,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:54:09,457 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:54:09,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:54:09,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 20:54:09,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:54:09,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:54:09,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:54:09,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 20:54:09,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:54:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:54:09,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:54:14,028 WARN L849 $PredicateComparison]: unable to prove that (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse0 (select |c_#memory_int#1| ~q2~0.base))) (or (not (= (select .cse0 (+ ~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int#1| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (= c_~N~0 (+ c_~t~0 (select .cse0 (+ ~q2~0.offset (* c_~q2_front~0 4)))))))) is different from false [2025-04-13 20:54:14,131 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 20:54:14,131 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 46 treesize of output 87 [2025-04-13 20:54:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 1 not checked. [2025-04-13 20:54:14,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360070551] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:54:14,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:54:14,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 8] total 34 [2025-04-13 20:54:14,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456650408] [2025-04-13 20:54:14,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:54:14,292 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:54:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:54:14,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:54:14,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1096, Unknown=1, NotChecked=66, Total=1260 [2025-04-13 20:54:14,293 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:54:14,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 147 transitions, 1336 flow. Second operand has 36 states, 36 states have (on average 5.555555555555555) internal successors, (200), 36 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:54:14,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:54:14,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:54:14,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:54:19,316 INFO L116 PetriNetUnfolderBase]: 26566/39757 cut-off events. [2025-04-13 20:54:19,316 INFO L117 PetriNetUnfolderBase]: For 321496/321496 co-relation queries the response was YES. [2025-04-13 20:54:19,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194978 conditions, 39757 events. 26566/39757 cut-off events. For 321496/321496 co-relation queries the response was YES. Maximal size of possible extension queue 1308. Compared 261891 event pairs, 6587 based on Foata normal form. 34/37969 useless extension candidates. Maximal degree in co-relation 194929. Up to 22161 conditions per place. [2025-04-13 20:54:19,649 INFO L140 encePairwiseOnDemand]: 21/37 looper letters, 335 selfloop transitions, 87 changer transitions 75/497 dead transitions. [2025-04-13 20:54:19,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 497 transitions, 5115 flow [2025-04-13 20:54:19,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 20:54:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-13 20:54:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 339 transitions. [2025-04-13 20:54:19,651 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3054054054054054 [2025-04-13 20:54:19,651 INFO L175 Difference]: Start difference. First operand has 146 places, 147 transitions, 1336 flow. Second operand 30 states and 339 transitions. [2025-04-13 20:54:19,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 497 transitions, 5115 flow [2025-04-13 20:54:21,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 497 transitions, 4959 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-13 20:54:21,298 INFO L231 Difference]: Finished difference. Result has 184 places, 197 transitions, 2149 flow [2025-04-13 20:54:21,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1251, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2149, PETRI_PLACES=184, PETRI_TRANSITIONS=197} [2025-04-13 20:54:21,299 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 149 predicate places. [2025-04-13 20:54:21,299 INFO L485 AbstractCegarLoop]: Abstraction has has 184 places, 197 transitions, 2149 flow [2025-04-13 20:54:21,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.555555555555555) internal successors, (200), 36 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:54:21,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:54:21,299 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:54:21,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 20:54:21,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:54:21,504 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:54:21,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:54:21,504 INFO L85 PathProgramCache]: Analyzing trace with hash 895093865, now seen corresponding path program 2 times [2025-04-13 20:54:21,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:54:21,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997442551] [2025-04-13 20:54:21,504 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:54:21,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:54:21,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 20:54:21,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:54:21,533 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:54:21,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:54:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:54:22,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:54:22,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997442551] [2025-04-13 20:54:22,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997442551] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:54:22,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263592105] [2025-04-13 20:54:22,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:54:22,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:54:22,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:54:22,487 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:54:22,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:54:22,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 20:54:22,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:54:22,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:54:22,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:54:22,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 20:54:22,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:54:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:54:23,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:54:23,476 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 20:54:23,476 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 46 treesize of output 87 [2025-04-13 20:54:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:54:23,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263592105] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:54:23,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:54:23,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 43 [2025-04-13 20:54:23,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295591271] [2025-04-13 20:54:23,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:54:23,947 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 20:54:23,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:54:23,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 20:54:23,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1793, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 20:54:23,949 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:54:23,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 197 transitions, 2149 flow. Second operand has 45 states, 45 states have (on average 5.155555555555556) internal successors, (232), 45 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:54:23,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:54:23,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:54:23,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:54:33,076 INFO L116 PetriNetUnfolderBase]: 42004/62122 cut-off events. [2025-04-13 20:54:33,076 INFO L117 PetriNetUnfolderBase]: For 656436/656436 co-relation queries the response was YES. [2025-04-13 20:54:33,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334831 conditions, 62122 events. 42004/62122 cut-off events. For 656436/656436 co-relation queries the response was YES. Maximal size of possible extension queue 1838. Compared 432009 event pairs, 2021 based on Foata normal form. 6/59150 useless extension candidates. Maximal degree in co-relation 334768. Up to 23976 conditions per place. [2025-04-13 20:54:33,682 INFO L140 encePairwiseOnDemand]: 21/37 looper letters, 415 selfloop transitions, 258 changer transitions 88/761 dead transitions. [2025-04-13 20:54:33,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 761 transitions, 8067 flow [2025-04-13 20:54:33,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 20:54:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-04-13 20:54:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 584 transitions. [2025-04-13 20:54:33,685 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30948595654478006 [2025-04-13 20:54:33,685 INFO L175 Difference]: Start difference. First operand has 184 places, 197 transitions, 2149 flow. Second operand 51 states and 584 transitions. [2025-04-13 20:54:33,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 761 transitions, 8067 flow [2025-04-13 20:54:37,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 761 transitions, 7981 flow, removed 30 selfloop flow, removed 12 redundant places. [2025-04-13 20:54:37,213 INFO L231 Difference]: Finished difference. Result has 238 places, 363 transitions, 5224 flow [2025-04-13 20:54:37,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=5224, PETRI_PLACES=238, PETRI_TRANSITIONS=363} [2025-04-13 20:54:37,213 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 203 predicate places. [2025-04-13 20:54:37,213 INFO L485 AbstractCegarLoop]: Abstraction has has 238 places, 363 transitions, 5224 flow [2025-04-13 20:54:37,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 5.155555555555556) internal successors, (232), 45 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:54:37,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:54:37,214 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:54:37,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 20:54:37,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:54:37,414 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:54:37,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:54:37,415 INFO L85 PathProgramCache]: Analyzing trace with hash 515330041, now seen corresponding path program 3 times [2025-04-13 20:54:37,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:54:37,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556935224] [2025-04-13 20:54:37,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:54:37,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:54:37,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-04-13 20:54:37,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:54:37,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:54:37,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:54:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:54:38,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:54:38,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556935224] [2025-04-13 20:54:38,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556935224] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:54:38,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759376582] [2025-04-13 20:54:38,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:54:38,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:54:38,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:54:38,419 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:54:38,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 20:54:38,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-04-13 20:54:38,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:54:38,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:54:38,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:54:38,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 20:54:38,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:54:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:54:38,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:54:39,266 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 20:54:39,266 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 46 treesize of output 87 [2025-04-13 20:54:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:54:39,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759376582] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:54:39,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:54:39,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 13] total 44 [2025-04-13 20:54:39,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344198726] [2025-04-13 20:54:39,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:54:39,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 20:54:39,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:54:39,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 20:54:39,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1886, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 20:54:39,628 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:54:39,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 363 transitions, 5224 flow. Second operand has 46 states, 46 states have (on average 5.108695652173913) internal successors, (235), 46 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:54:39,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:54:39,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:54:39,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:54:52,535 INFO L116 PetriNetUnfolderBase]: 46514/69006 cut-off events. [2025-04-13 20:54:52,535 INFO L117 PetriNetUnfolderBase]: For 1139686/1139686 co-relation queries the response was YES. [2025-04-13 20:54:53,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455347 conditions, 69006 events. 46514/69006 cut-off events. For 1139686/1139686 co-relation queries the response was YES. Maximal size of possible extension queue 2106. Compared 491169 event pairs, 1993 based on Foata normal form. 11/69017 useless extension candidates. Maximal degree in co-relation 455269. Up to 22627 conditions per place. [2025-04-13 20:54:53,412 INFO L140 encePairwiseOnDemand]: 21/37 looper letters, 513 selfloop transitions, 368 changer transitions 132/1013 dead transitions. [2025-04-13 20:54:53,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 1013 transitions, 13183 flow [2025-04-13 20:54:53,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-04-13 20:54:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2025-04-13 20:54:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 778 transitions. [2025-04-13 20:54:53,414 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3047395221308265 [2025-04-13 20:54:53,414 INFO L175 Difference]: Start difference. First operand has 238 places, 363 transitions, 5224 flow. Second operand 69 states and 778 transitions. [2025-04-13 20:54:53,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 1013 transitions, 13183 flow [2025-04-13 20:55:04,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 1013 transitions, 12405 flow, removed 268 selfloop flow, removed 21 redundant places. [2025-04-13 20:55:04,265 INFO L231 Difference]: Finished difference. Result has 300 places, 483 transitions, 7657 flow [2025-04-13 20:55:04,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4763, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=257, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=7657, PETRI_PLACES=300, PETRI_TRANSITIONS=483} [2025-04-13 20:55:04,265 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 265 predicate places. [2025-04-13 20:55:04,265 INFO L485 AbstractCegarLoop]: Abstraction has has 300 places, 483 transitions, 7657 flow [2025-04-13 20:55:04,266 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.108695652173913) internal successors, (235), 46 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:04,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:04,266 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:04,271 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-13 20:55:04,469 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,SelfDestructingSolverStorable15 [2025-04-13 20:55:04,469 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:55:04,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:04,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1070260561, now seen corresponding path program 4 times [2025-04-13 20:55:04,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:04,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930629950] [2025-04-13 20:55:04,469 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:55:04,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:04,478 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-13 20:55:04,493 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:55:04,493 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:55:04,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:05,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:05,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930629950] [2025-04-13 20:55:05,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930629950] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:55:05,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745577647] [2025-04-13 20:55:05,332 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:55:05,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:05,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:55:05,334 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:55:05,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 20:55:05,383 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-13 20:55:05,404 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:55:05,404 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:55:05,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:05,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 20:55:05,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:55:05,825 INFO L325 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-04-13 20:55:05,825 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 23 treesize of output 7 [2025-04-13 20:55:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:55:05,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:55:06,214 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 20:55:06,214 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 46 treesize of output 87 [2025-04-13 20:55:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:55:06,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745577647] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:55:06,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:55:06,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 13] total 44 [2025-04-13 20:55:06,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486565399] [2025-04-13 20:55:06,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:55:06,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 20:55:06,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:06,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 20:55:06,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1853, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 20:55:06,553 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:55:06,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 483 transitions, 7657 flow. Second operand has 46 states, 46 states have (on average 5.108695652173913) internal successors, (235), 46 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:06,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:06,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:55:06,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:20,932 INFO L116 PetriNetUnfolderBase]: 46953/69704 cut-off events. [2025-04-13 20:55:20,933 INFO L117 PetriNetUnfolderBase]: For 1431199/1431199 co-relation queries the response was YES. [2025-04-13 20:55:21,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498683 conditions, 69704 events. 46953/69704 cut-off events. For 1431199/1431199 co-relation queries the response was YES. Maximal size of possible extension queue 2135. Compared 497762 event pairs, 2138 based on Foata normal form. 6/69708 useless extension candidates. Maximal degree in co-relation 498590. Up to 21080 conditions per place. [2025-04-13 20:55:22,098 INFO L140 encePairwiseOnDemand]: 19/37 looper letters, 487 selfloop transitions, 440 changer transitions 104/1031 dead transitions. [2025-04-13 20:55:22,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 1031 transitions, 14839 flow [2025-04-13 20:55:22,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-13 20:55:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2025-04-13 20:55:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 709 transitions. [2025-04-13 20:55:22,100 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28600242033077855 [2025-04-13 20:55:22,100 INFO L175 Difference]: Start difference. First operand has 300 places, 483 transitions, 7657 flow. Second operand 67 states and 709 transitions. [2025-04-13 20:55:22,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 1031 transitions, 14839 flow [2025-04-13 20:55:37,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 1031 transitions, 14204 flow, removed 285 selfloop flow, removed 25 redundant places. [2025-04-13 20:55:37,177 INFO L231 Difference]: Finished difference. Result has 356 places, 560 transitions, 9588 flow [2025-04-13 20:55:37,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7134, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=358, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=9588, PETRI_PLACES=356, PETRI_TRANSITIONS=560} [2025-04-13 20:55:37,177 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 321 predicate places. [2025-04-13 20:55:37,178 INFO L485 AbstractCegarLoop]: Abstraction has has 356 places, 560 transitions, 9588 flow [2025-04-13 20:55:37,178 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.108695652173913) internal successors, (235), 46 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:37,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:37,178 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:37,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 20:55:37,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 20:55:37,378 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:55:37,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:37,379 INFO L85 PathProgramCache]: Analyzing trace with hash 400390725, now seen corresponding path program 5 times [2025-04-13 20:55:37,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:37,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617229700] [2025-04-13 20:55:37,379 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:55:37,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:37,389 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 20:55:37,407 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:55:37,407 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:55:37,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:38,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:38,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617229700] [2025-04-13 20:55:38,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617229700] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:55:38,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182003911] [2025-04-13 20:55:38,147 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:55:38,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:38,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:55:38,149 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:55:38,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 20:55:38,199 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 20:55:38,222 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:55:38,222 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:55:38,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:38,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 20:55:38,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:55:38,793 INFO L325 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2025-04-13 20:55:38,794 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 42 treesize of output 38 [2025-04-13 20:55:38,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:55:38,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:55:39,211 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 20:55:39,212 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 46 treesize of output 87 [2025-04-13 20:55:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:55:39,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182003911] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:55:39,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:55:39,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 12] total 42 [2025-04-13 20:55:39,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356719880] [2025-04-13 20:55:39,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:55:39,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-13 20:55:39,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:39,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-13 20:55:39,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1702, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 20:55:39,542 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:55:39,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 560 transitions, 9588 flow. Second operand has 44 states, 44 states have (on average 5.204545454545454) internal successors, (229), 44 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:39,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:39,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:55:39,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:44,544 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:55:48,849 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:55:52,877 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:55:57,480 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:55:59,273 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:56:03,698 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:56:07,710 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:56:11,721 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:56:15,731 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:56:19,782 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:56:23,791 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:56:27,823 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:56:32,002 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:56:36,012 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:56:38,475 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:56:42,513 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:56:46,698 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:56:50,715 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:56:55,433 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:56:59,477 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:03,497 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:08,148 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:12,171 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:16,179 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:20,193 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:24,209 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:28,225 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:32,238 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:36,745 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:40,753 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:44,759 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:48,776 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:52,785 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:57,612 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:58,850 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:58:00,159 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:58:15,561 INFO L116 PetriNetUnfolderBase]: 67088/100262 cut-off events. [2025-04-13 20:58:15,561 INFO L117 PetriNetUnfolderBase]: For 2691598/2691598 co-relation queries the response was YES. [2025-04-13 20:58:17,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774928 conditions, 100262 events. 67088/100262 cut-off events. For 2691598/2691598 co-relation queries the response was YES. Maximal size of possible extension queue 3239. Compared 754583 event pairs, 10049 based on Foata normal form. 54/100313 useless extension candidates. Maximal degree in co-relation 774817. Up to 44880 conditions per place. [2025-04-13 20:58:17,427 INFO L140 encePairwiseOnDemand]: 20/37 looper letters, 762 selfloop transitions, 725 changer transitions 182/1669 dead transitions. [2025-04-13 20:58:17,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 1669 transitions, 29487 flow [2025-04-13 20:58:17,427 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-13 20:58:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-04-13 20:58:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 683 transitions. [2025-04-13 20:58:17,429 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.293007293007293 [2025-04-13 20:58:17,429 INFO L175 Difference]: Start difference. First operand has 356 places, 560 transitions, 9588 flow. Second operand 63 states and 683 transitions. [2025-04-13 20:58:17,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 1669 transitions, 29487 flow [2025-04-13 20:58:53,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 1669 transitions, 28014 flow, removed 453 selfloop flow, removed 28 redundant places. [2025-04-13 20:58:53,382 INFO L231 Difference]: Finished difference. Result has 419 places, 1009 transitions, 19552 flow [2025-04-13 20:58:53,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8876, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=318, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=19552, PETRI_PLACES=419, PETRI_TRANSITIONS=1009} [2025-04-13 20:58:53,383 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 384 predicate places. [2025-04-13 20:58:53,383 INFO L485 AbstractCegarLoop]: Abstraction has has 419 places, 1009 transitions, 19552 flow [2025-04-13 20:58:53,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 5.204545454545454) internal successors, (229), 44 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:58:53,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:53,384 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:53,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 20:58:53,585 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,SelfDestructingSolverStorable17 [2025-04-13 20:58:53,585 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:58:53,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:53,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1472732962, now seen corresponding path program 6 times [2025-04-13 20:58:53,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:53,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284652215] [2025-04-13 20:58:53,586 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:58:53,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:53,593 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 3 equivalence classes. [2025-04-13 20:58:53,611 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 20:58:53,611 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:58:53,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:58:54,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:54,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284652215] [2025-04-13 20:58:54,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284652215] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:58:54,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922108638] [2025-04-13 20:58:54,946 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:58:54,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:54,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:58:54,948 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:58:54,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 20:58:54,998 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 3 equivalence classes. [2025-04-13 20:58:55,021 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 20:58:55,021 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:58:55,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:55,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 20:58:55,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:58:55,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:58:55,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:58:59,749 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 20:58:59,750 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 46 treesize of output 87 [2025-04-13 20:58:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 20:58:59,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922108638] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:58:59,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:58:59,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 8] total 37 [2025-04-13 20:58:59,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210689985] [2025-04-13 20:58:59,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:58:59,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:58:59,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:59,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:58:59,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1369, Unknown=1, NotChecked=0, Total=1482 [2025-04-13 20:58:59,903 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:58:59,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 1009 transitions, 19552 flow. Second operand has 39 states, 39 states have (on average 5.538461538461538) internal successors, (216), 39 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:58:59,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:59,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:58:59,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:04,595 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:59:08,710 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:59:12,723 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:59:17,671 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:59:21,692 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:59:26,525 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:59:48,518 INFO L116 PetriNetUnfolderBase]: 64970/96868 cut-off events. [2025-04-13 20:59:48,518 INFO L117 PetriNetUnfolderBase]: For 3595510/3595510 co-relation queries the response was YES. [2025-04-13 20:59:50,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847941 conditions, 96868 events. 64970/96868 cut-off events. For 3595510/3595510 co-relation queries the response was YES. Maximal size of possible extension queue 3056. Compared 720510 event pairs, 14601 based on Foata normal form. 2/96867 useless extension candidates. Maximal degree in co-relation 847793. Up to 67113 conditions per place. [2025-04-13 20:59:51,100 INFO L140 encePairwiseOnDemand]: 19/37 looper letters, 707 selfloop transitions, 498 changer transitions 69/1274 dead transitions. [2025-04-13 20:59:51,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 1274 transitions, 24530 flow [2025-04-13 20:59:51,101 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 20:59:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-04-13 20:59:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 381 transitions. [2025-04-13 20:59:51,102 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2783053323593864 [2025-04-13 20:59:51,102 INFO L175 Difference]: Start difference. First operand has 419 places, 1009 transitions, 19552 flow. Second operand 37 states and 381 transitions. [2025-04-13 20:59:51,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 1274 transitions, 24530 flow [2025-04-13 21:01:02,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 1274 transitions, 23793 flow, removed 350 selfloop flow, removed 18 redundant places. [2025-04-13 21:01:02,160 INFO L231 Difference]: Finished difference. Result has 434 places, 1026 transitions, 20158 flow [2025-04-13 21:01:02,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=18901, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1009, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=477, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=20158, PETRI_PLACES=434, PETRI_TRANSITIONS=1026} [2025-04-13 21:01:02,162 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 399 predicate places. [2025-04-13 21:01:02,162 INFO L485 AbstractCegarLoop]: Abstraction has has 434 places, 1026 transitions, 20158 flow [2025-04-13 21:01:02,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.538461538461538) internal successors, (216), 39 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:01:02,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:01:02,162 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:01:02,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 21:01:02,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:01:02,363 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 21:01:02,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:01:02,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1006711366, now seen corresponding path program 7 times [2025-04-13 21:01:02,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:01:02,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948517519] [2025-04-13 21:01:02,364 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:01:02,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:01:02,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 21:01:02,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 21:01:02,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:01:02,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:01:03,723 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:01:03,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:01:03,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948517519] [2025-04-13 21:01:03,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948517519] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:01:03,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326540448] [2025-04-13 21:01:03,724 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:01:03,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:01:03,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:01:03,726 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:01:03,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 21:01:03,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 21:01:03,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 21:01:03,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:01:03,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:01:03,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 21:01:03,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:01:04,136 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:01:04,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:01:12,358 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 21:01:12,358 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 46 treesize of output 87 [2025-04-13 21:01:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 21:01:12,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326540448] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:01:12,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:01:12,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 8] total 36 [2025-04-13 21:01:12,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718600295] [2025-04-13 21:01:12,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:01:12,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 21:01:12,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:01:12,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 21:01:12,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1294, Unknown=2, NotChecked=0, Total=1406 [2025-04-13 21:01:12,469 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 21:01:12,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 1026 transitions, 20158 flow. Second operand has 38 states, 38 states have (on average 5.342105263157895) internal successors, (203), 38 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:01:12,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:01:12,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 21:01:12,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:01:16,965 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:01:20,985 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:01:24,990 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:01:29,102 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:01:33,109 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:01:37,116 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:01:42,032 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:01:46,040 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:01:50,046 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:02:16,902 INFO L116 PetriNetUnfolderBase]: 67959/101216 cut-off events. [2025-04-13 21:02:16,903 INFO L117 PetriNetUnfolderBase]: For 3752430/3752430 co-relation queries the response was YES. [2025-04-13 21:02:19,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 900210 conditions, 101216 events. 67959/101216 cut-off events. For 3752430/3752430 co-relation queries the response was YES. Maximal size of possible extension queue 3201. Compared 755960 event pairs, 14780 based on Foata normal form. 4/101217 useless extension candidates. Maximal degree in co-relation 900064. Up to 61382 conditions per place. [2025-04-13 21:02:19,759 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 769 selfloop transitions, 482 changer transitions 93/1344 dead transitions. [2025-04-13 21:02:19,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 1344 transitions, 26776 flow [2025-04-13 21:02:19,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 21:02:19,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-13 21:02:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 355 transitions. [2025-04-13 21:02:19,760 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29074529074529076 [2025-04-13 21:02:19,760 INFO L175 Difference]: Start difference. First operand has 434 places, 1026 transitions, 20158 flow. Second operand 33 states and 355 transitions. [2025-04-13 21:02:19,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 1344 transitions, 26776 flow [2025-04-13 21:03:20,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 1344 transitions, 26223 flow, removed 23 selfloop flow, removed 13 redundant places. [2025-04-13 21:03:20,304 INFO L231 Difference]: Finished difference. Result has 456 places, 1044 transitions, 21802 flow [2025-04-13 21:03:20,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=19657, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1026, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=449, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=21802, PETRI_PLACES=456, PETRI_TRANSITIONS=1044} [2025-04-13 21:03:20,305 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 421 predicate places. [2025-04-13 21:03:20,305 INFO L485 AbstractCegarLoop]: Abstraction has has 456 places, 1044 transitions, 21802 flow [2025-04-13 21:03:20,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.342105263157895) internal successors, (203), 38 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:03:20,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:03:20,305 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:03:20,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 21:03:20,505 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:03:20,506 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 21:03:20,506 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:03:20,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1095014622, now seen corresponding path program 8 times [2025-04-13 21:03:20,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:03:20,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834066552] [2025-04-13 21:03:20,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:03:20,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:03:20,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 21:03:20,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 21:03:20,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:03:20,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:03:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:03:20,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:03:20,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834066552] [2025-04-13 21:03:20,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834066552] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:03:20,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29786896] [2025-04-13 21:03:20,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:03:20,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:03:20,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:03:20,993 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:03:20,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 21:03:21,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 21:03:21,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 21:03:21,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:03:21,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:03:21,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 21:03:21,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:03:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:03:21,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:03:33,544 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 21:03:33,544 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 46 treesize of output 87 [2025-04-13 21:03:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 21:03:33,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29786896] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:03:33,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:03:33,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 8] total 31 [2025-04-13 21:03:33,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912226578] [2025-04-13 21:03:33,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:03:33,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 21:03:33,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:03:33,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 21:03:33,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=959, Unknown=3, NotChecked=0, Total=1056 [2025-04-13 21:03:33,657 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 21:03:33,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 1044 transitions, 21802 flow. Second operand has 33 states, 33 states have (on average 5.606060606060606) internal successors, (185), 33 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:03:33,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:03:33,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 21:03:33,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:03:38,059 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:03:42,070 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:03:46,081 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:03:50,095 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:03:54,172 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:03:58,176 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:04:02,185 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:04:06,192 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:04:11,034 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:04:15,039 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:04:19,047 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:04:23,054 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:04:49,967 INFO L116 PetriNetUnfolderBase]: 67369/100293 cut-off events. [2025-04-13 21:04:49,967 INFO L117 PetriNetUnfolderBase]: For 4035844/4035844 co-relation queries the response was YES. [2025-04-13 21:04:52,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914574 conditions, 100293 events. 67369/100293 cut-off events. For 4035844/4035844 co-relation queries the response was YES. Maximal size of possible extension queue 3173. Compared 747618 event pairs, 14768 based on Foata normal form. 2/100293 useless extension candidates. Maximal degree in co-relation 914423. Up to 60391 conditions per place. [2025-04-13 21:04:52,685 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 719 selfloop transitions, 492 changer transitions 50/1261 dead transitions. [2025-04-13 21:04:52,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 1261 transitions, 26361 flow [2025-04-13 21:04:52,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 21:04:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-13 21:04:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 313 transitions. [2025-04-13 21:04:52,690 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.281981981981982 [2025-04-13 21:04:52,690 INFO L175 Difference]: Start difference. First operand has 456 places, 1044 transitions, 21802 flow. Second operand 30 states and 313 transitions. [2025-04-13 21:04:52,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 1261 transitions, 26361 flow [2025-04-13 21:05:40,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 1261 transitions, 26184 flow, removed 9 selfloop flow, removed 22 redundant places. [2025-04-13 21:05:40,681 INFO L231 Difference]: Finished difference. Result has 462 places, 1032 transitions, 22378 flow [2025-04-13 21:05:40,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=21625, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1044, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=492, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=22378, PETRI_PLACES=462, PETRI_TRANSITIONS=1032} [2025-04-13 21:05:40,682 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 427 predicate places. [2025-04-13 21:05:40,682 INFO L485 AbstractCegarLoop]: Abstraction has has 462 places, 1032 transitions, 22378 flow [2025-04-13 21:05:40,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.606060606060606) internal successors, (185), 33 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:40,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:05:40,683 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:05:40,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 21:05:40,883 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,SelfDestructingSolverStorable20 [2025-04-13 21:05:40,883 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 21:05:40,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:05:40,884 INFO L85 PathProgramCache]: Analyzing trace with hash -267698027, now seen corresponding path program 9 times [2025-04-13 21:05:40,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:05:40,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713289875] [2025-04-13 21:05:40,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:05:40,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:05:40,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-04-13 21:05:40,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 21:05:40,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 21:05:40,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:05:40,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:05:40,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713289875] [2025-04-13 21:05:40,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713289875] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:05:40,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682129071] [2025-04-13 21:05:40,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:05:40,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:05:40,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:05:40,973 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:05:40,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 21:05:41,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-04-13 21:05:41,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 21:05:41,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 21:05:41,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:41,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:05:41,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:05:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:05:41,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:05:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:05:41,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682129071] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:05:41,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:05:41,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 6] total 16 [2025-04-13 21:05:41,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194011411] [2025-04-13 21:05:41,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:05:41,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:05:41,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:05:41,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:05:41,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:05:41,237 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 21:05:41,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 1032 transitions, 22378 flow. Second operand has 16 states, 16 states have (on average 8.9375) internal successors, (143), 16 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:41,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:05:41,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 21:05:41,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand