./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-word-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-word-subst.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:14:18,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:14:18,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:14:18,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:14:18,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:14:18,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:14:18,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:14:18,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:14:18,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:14:18,397 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:14:18,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:14:18,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:14:18,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:14:18,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:14:18,398 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:14:18,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:14:18,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:14:18,398 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:14:18,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:14:18,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:14:18,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:14:18,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:14:18,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:14:18,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:14:18,398 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:14:18,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:14:18,399 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:14:18,399 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:14:18,399 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:14:18,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:14:18,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:14:18,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:14:18,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:14:18,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:14:18,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:14:18,399 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:14:18,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:14:18,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:14:18,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:14:18,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:14:18,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:14:18,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:14:18,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:14:18,399 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 [2025-02-08 01:14:18,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:14:18,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:14:18,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:14:18,650 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:14:18,651 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:14:18,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2025-02-08 01:14:19,838 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8437c0845/f797d5ff43fe49faa082231dcae8f1f3/FLAGe1fe7625d [2025-02-08 01:14:20,035 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:14:20,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2025-02-08 01:14:20,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8437c0845/f797d5ff43fe49faa082231dcae8f1f3/FLAGe1fe7625d [2025-02-08 01:14:20,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8437c0845/f797d5ff43fe49faa082231dcae8f1f3 [2025-02-08 01:14:20,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:14:20,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:14:20,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:14:20,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:14:20,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:14:20,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:14:20" (1/1) ... [2025-02-08 01:14:20,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408fce61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:20, skipping insertion in model container [2025-02-08 01:14:20,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:14:20" (1/1) ... [2025-02-08 01:14:20,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:14:20,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c[3384,3397] [2025-02-08 01:14:20,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:14:20,561 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:14:20,587 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c[3384,3397] [2025-02-08 01:14:20,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:14:20,609 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:14:20,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:20 WrapperNode [2025-02-08 01:14:20,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:14:20,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:14:20,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:14:20,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:14:20,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:20" (1/1) ... [2025-02-08 01:14:20,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:20" (1/1) ... [2025-02-08 01:14:20,645 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 160 [2025-02-08 01:14:20,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:14:20,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:14:20,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:14:20,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:14:20,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:20" (1/1) ... [2025-02-08 01:14:20,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:20" (1/1) ... [2025-02-08 01:14:20,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:20" (1/1) ... [2025-02-08 01:14:20,674 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-08 01:14:20,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:20" (1/1) ... [2025-02-08 01:14:20,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:20" (1/1) ... [2025-02-08 01:14:20,680 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:20" (1/1) ... [2025-02-08 01:14:20,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:20" (1/1) ... [2025-02-08 01:14:20,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:20" (1/1) ... [2025-02-08 01:14:20,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:20" (1/1) ... [2025-02-08 01:14:20,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:14:20,687 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:14:20,687 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:14:20,687 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:14:20,688 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:20" (1/1) ... [2025-02-08 01:14:20,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:14:20,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:20,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:14:20,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:14:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:14:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:14:20,738 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:14:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:14:20,738 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:14:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:14:20,738 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:14:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:14:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:14:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:14:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:14:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:14:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:14:20,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:14:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:14:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:14:20,740 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:14:20,840 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:14:20,841 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:14:21,168 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:14:21,168 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:14:21,359 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:14:21,359 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:14:21,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:14:21 BoogieIcfgContainer [2025-02-08 01:14:21,360 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:14:21,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:14:21,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:14:21,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:14:21,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:14:20" (1/3) ... [2025-02-08 01:14:21,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ce1fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:14:21, skipping insertion in model container [2025-02-08 01:14:21,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:14:20" (2/3) ... [2025-02-08 01:14:21,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ce1fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:14:21, skipping insertion in model container [2025-02-08 01:14:21,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:14:21" (3/3) ... [2025-02-08 01:14:21,368 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2025-02-08 01:14:21,381 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:14:21,383 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-subst.wvr.c that has 4 procedures, 38 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-08 01:14:21,383 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:14:21,464 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 01:14:21,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 119 flow [2025-02-08 01:14:21,525 INFO L124 PetriNetUnfolderBase]: 12/46 cut-off events. [2025-02-08 01:14:21,529 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:14:21,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 12/46 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-02-08 01:14:21,531 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 49 transitions, 119 flow [2025-02-08 01:14:21,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 45 transitions, 108 flow [2025-02-08 01:14:21,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:14:21,555 INFO L333 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;@1b2293e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:14:21,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:14:21,576 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:14:21,576 INFO L124 PetriNetUnfolderBase]: 12/44 cut-off events. [2025-02-08 01:14:21,576 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:14:21,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:21,577 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-02-08 01:14:21,577 INFO L396 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-02-08 01:14:21,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1682326522, now seen corresponding path program 1 times [2025-02-08 01:14:21,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:21,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533947265] [2025-02-08 01:14:21,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:14:21,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:21,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:14:21,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:14:21,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:21,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:22,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:22,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:22,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533947265] [2025-02-08 01:14:22,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533947265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:22,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:22,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:14:22,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651169230] [2025-02-08 01:14:22,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:22,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:14:22,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:22,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:14:22,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:14:22,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:22,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:22,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:22,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:22,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:22,538 INFO L124 PetriNetUnfolderBase]: 3108/4257 cut-off events. [2025-02-08 01:14:22,539 INFO L125 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2025-02-08 01:14:22,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8664 conditions, 4257 events. 3108/4257 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 18213 event pairs, 1260 based on Foata normal form. 1/3476 useless extension candidates. Maximal degree in co-relation 7777. Up to 2653 conditions per place. [2025-02-08 01:14:22,568 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 60 selfloop transitions, 2 changer transitions 5/71 dead transitions. [2025-02-08 01:14:22,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 71 transitions, 309 flow [2025-02-08 01:14:22,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:14:22,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:14:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-02-08 01:14:22,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2025-02-08 01:14:22,580 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 108 flow. Second operand 3 states and 89 transitions. [2025-02-08 01:14:22,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 71 transitions, 309 flow [2025-02-08 01:14:22,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 71 transitions, 287 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 01:14:22,593 INFO L231 Difference]: Finished difference. Result has 40 places, 45 transitions, 106 flow [2025-02-08 01:14:22,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=40, PETRI_TRANSITIONS=45} [2025-02-08 01:14:22,598 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2025-02-08 01:14:22,598 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 45 transitions, 106 flow [2025-02-08 01:14:22,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:22,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:22,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:22,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:14:22,598 INFO L396 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-02-08 01:14:22,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:22,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1586400603, now seen corresponding path program 1 times [2025-02-08 01:14:22,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:22,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141236993] [2025-02-08 01:14:22,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:14:22,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:22,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:14:22,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:14:22,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:22,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:23,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:23,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141236993] [2025-02-08 01:14:23,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141236993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:23,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:23,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:14:23,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591379539] [2025-02-08 01:14:23,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:23,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:14:23,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:23,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:14:23,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:14:23,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:23,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 45 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:23,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:23,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:23,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:23,754 INFO L124 PetriNetUnfolderBase]: 3001/4191 cut-off events. [2025-02-08 01:14:23,754 INFO L125 PetriNetUnfolderBase]: For 503/503 co-relation queries the response was YES. [2025-02-08 01:14:23,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8937 conditions, 4191 events. 3001/4191 cut-off events. For 503/503 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18965 event pairs, 391 based on Foata normal form. 1/3699 useless extension candidates. Maximal degree in co-relation 7011. Up to 2563 conditions per place. [2025-02-08 01:14:23,771 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 81 selfloop transitions, 2 changer transitions 13/100 dead transitions. [2025-02-08 01:14:23,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 100 transitions, 435 flow [2025-02-08 01:14:23,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:14:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:14:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-02-08 01:14:23,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2025-02-08 01:14:23,772 INFO L175 Difference]: Start difference. First operand has 40 places, 45 transitions, 106 flow. Second operand 5 states and 129 transitions. [2025-02-08 01:14:23,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 100 transitions, 435 flow [2025-02-08 01:14:23,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 100 transitions, 425 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 01:14:23,792 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 117 flow [2025-02-08 01:14:23,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2025-02-08 01:14:23,793 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2025-02-08 01:14:23,793 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 117 flow [2025-02-08 01:14:23,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:23,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:23,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:23,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:14:23,796 INFO L396 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-02-08 01:14:23,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:23,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2015441723, now seen corresponding path program 2 times [2025-02-08 01:14:23,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:23,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231511966] [2025-02-08 01:14:23,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:14:23,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:23,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:14:23,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:14:23,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:14:23,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:24,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:24,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:24,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231511966] [2025-02-08 01:14:24,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231511966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:24,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:24,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:14:24,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016776452] [2025-02-08 01:14:24,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:24,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:14:24,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:24,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:14:24,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:14:24,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:24,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:24,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:24,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:24,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:24,745 INFO L124 PetriNetUnfolderBase]: 3423/4867 cut-off events. [2025-02-08 01:14:24,745 INFO L125 PetriNetUnfolderBase]: For 1203/1203 co-relation queries the response was YES. [2025-02-08 01:14:24,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10685 conditions, 4867 events. 3423/4867 cut-off events. For 1203/1203 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 23165 event pairs, 1590 based on Foata normal form. 1/4577 useless extension candidates. Maximal degree in co-relation 10662. Up to 2966 conditions per place. [2025-02-08 01:14:24,767 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 76 selfloop transitions, 3 changer transitions 14/97 dead transitions. [2025-02-08 01:14:24,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 97 transitions, 445 flow [2025-02-08 01:14:24,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:14:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:14:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-02-08 01:14:24,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2025-02-08 01:14:24,768 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 117 flow. Second operand 5 states and 124 transitions. [2025-02-08 01:14:24,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 97 transitions, 445 flow [2025-02-08 01:14:24,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 97 transitions, 436 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 01:14:24,773 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 134 flow [2025-02-08 01:14:24,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2025-02-08 01:14:24,774 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2025-02-08 01:14:24,774 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 134 flow [2025-02-08 01:14:24,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:24,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:24,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:24,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:14:24,774 INFO L396 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-02-08 01:14:24,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:24,775 INFO L85 PathProgramCache]: Analyzing trace with hash 953876833, now seen corresponding path program 3 times [2025-02-08 01:14:24,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:24,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482480035] [2025-02-08 01:14:24,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:14:24,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:24,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:14:24,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:14:24,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:14:24,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:25,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:25,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482480035] [2025-02-08 01:14:25,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482480035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:25,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:25,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:14:25,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728797490] [2025-02-08 01:14:25,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:25,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:14:25,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:25,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:14:25,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:14:25,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:25,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:25,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:25,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:25,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:25,547 INFO L124 PetriNetUnfolderBase]: 3981/5671 cut-off events. [2025-02-08 01:14:25,547 INFO L125 PetriNetUnfolderBase]: For 2356/2356 co-relation queries the response was YES. [2025-02-08 01:14:25,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12870 conditions, 5671 events. 3981/5671 cut-off events. For 2356/2356 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 28601 event pairs, 691 based on Foata normal form. 1/5370 useless extension candidates. Maximal degree in co-relation 12841. Up to 3752 conditions per place. [2025-02-08 01:14:25,571 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 79 selfloop transitions, 3 changer transitions 14/100 dead transitions. [2025-02-08 01:14:25,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 100 transitions, 471 flow [2025-02-08 01:14:25,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:14:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:14:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-02-08 01:14:25,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2025-02-08 01:14:25,573 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 134 flow. Second operand 5 states and 127 transitions. [2025-02-08 01:14:25,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 100 transitions, 471 flow [2025-02-08 01:14:25,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 100 transitions, 460 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-08 01:14:25,588 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 149 flow [2025-02-08 01:14:25,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-02-08 01:14:25,590 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2025-02-08 01:14:25,590 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 149 flow [2025-02-08 01:14:25,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:25,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:25,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:25,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:14:25,591 INFO L396 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-02-08 01:14:25,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:25,591 INFO L85 PathProgramCache]: Analyzing trace with hash -915715291, now seen corresponding path program 4 times [2025-02-08 01:14:25,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:25,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766769969] [2025-02-08 01:14:25,592 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:14:25,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:25,605 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-02-08 01:14:25,610 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 26 statements. [2025-02-08 01:14:25,610 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:14:25,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:25,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:25,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766769969] [2025-02-08 01:14:25,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766769969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:25,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:25,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:14:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099641065] [2025-02-08 01:14:25,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:25,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:14:25,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:25,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:14:25,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:14:25,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:25,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:25,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:25,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:25,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:26,277 INFO L124 PetriNetUnfolderBase]: 4210/6079 cut-off events. [2025-02-08 01:14:26,278 INFO L125 PetriNetUnfolderBase]: For 3905/3905 co-relation queries the response was YES. [2025-02-08 01:14:26,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14111 conditions, 6079 events. 4210/6079 cut-off events. For 3905/3905 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 30774 event pairs, 2219 based on Foata normal form. 1/5751 useless extension candidates. Maximal degree in co-relation 14072. Up to 4119 conditions per place. [2025-02-08 01:14:26,300 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 75 selfloop transitions, 4 changer transitions 15/98 dead transitions. [2025-02-08 01:14:26,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 98 transitions, 494 flow [2025-02-08 01:14:26,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:14:26,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:14:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-02-08 01:14:26,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49795918367346936 [2025-02-08 01:14:26,302 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 149 flow. Second operand 5 states and 122 transitions. [2025-02-08 01:14:26,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 98 transitions, 494 flow [2025-02-08 01:14:26,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 98 transitions, 478 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-02-08 01:14:26,308 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 174 flow [2025-02-08 01:14:26,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2025-02-08 01:14:26,309 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2025-02-08 01:14:26,309 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 174 flow [2025-02-08 01:14:26,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:26,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:26,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:26,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:14:26,309 INFO L396 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-02-08 01:14:26,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:26,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1168057591, now seen corresponding path program 5 times [2025-02-08 01:14:26,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:26,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67978742] [2025-02-08 01:14:26,310 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:14:26,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:26,322 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:14:26,341 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:14:26,342 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:14:26,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:26,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:26,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67978742] [2025-02-08 01:14:26,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67978742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:26,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:26,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:14:26,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726738982] [2025-02-08 01:14:26,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:26,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:14:26,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:26,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:14:26,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:14:26,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:26,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:26,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:26,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:26,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:27,052 INFO L124 PetriNetUnfolderBase]: 4237/6047 cut-off events. [2025-02-08 01:14:27,052 INFO L125 PetriNetUnfolderBase]: For 4933/4933 co-relation queries the response was YES. [2025-02-08 01:14:27,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14366 conditions, 6047 events. 4237/6047 cut-off events. For 4933/4933 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 30485 event pairs, 2194 based on Foata normal form. 1/5705 useless extension candidates. Maximal degree in co-relation 14330. Up to 4162 conditions per place. [2025-02-08 01:14:27,079 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 84 selfloop transitions, 4 changer transitions 13/105 dead transitions. [2025-02-08 01:14:27,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 105 transitions, 527 flow [2025-02-08 01:14:27,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:14:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:14:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-02-08 01:14:27,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2025-02-08 01:14:27,080 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 174 flow. Second operand 5 states and 130 transitions. [2025-02-08 01:14:27,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 105 transitions, 527 flow [2025-02-08 01:14:27,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 105 transitions, 511 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-02-08 01:14:27,120 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 173 flow [2025-02-08 01:14:27,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2025-02-08 01:14:27,121 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2025-02-08 01:14:27,121 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 173 flow [2025-02-08 01:14:27,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:27,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:27,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:27,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:14:27,122 INFO L396 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-02-08 01:14:27,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:27,122 INFO L85 PathProgramCache]: Analyzing trace with hash -823439997, now seen corresponding path program 6 times [2025-02-08 01:14:27,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:27,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418978358] [2025-02-08 01:14:27,122 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:14:27,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:27,134 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:14:27,139 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:14:27,139 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:14:27,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:27,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:27,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418978358] [2025-02-08 01:14:27,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418978358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:27,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:27,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:14:27,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578213556] [2025-02-08 01:14:27,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:27,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:14:27,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:27,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:14:27,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:14:27,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:27,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:27,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:27,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:27,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:27,846 INFO L124 PetriNetUnfolderBase]: 4009/5766 cut-off events. [2025-02-08 01:14:27,846 INFO L125 PetriNetUnfolderBase]: For 4758/4758 co-relation queries the response was YES. [2025-02-08 01:14:27,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13614 conditions, 5766 events. 4009/5766 cut-off events. For 4758/4758 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 28629 event pairs, 2141 based on Foata normal form. 1/5438 useless extension candidates. Maximal degree in co-relation 13582. Up to 4119 conditions per place. [2025-02-08 01:14:27,869 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 81 selfloop transitions, 3 changer transitions 13/101 dead transitions. [2025-02-08 01:14:27,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 101 transitions, 508 flow [2025-02-08 01:14:27,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:14:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:14:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-02-08 01:14:27,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-02-08 01:14:27,870 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 173 flow. Second operand 5 states and 126 transitions. [2025-02-08 01:14:27,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 101 transitions, 508 flow [2025-02-08 01:14:27,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 101 transitions, 497 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-02-08 01:14:27,878 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 173 flow [2025-02-08 01:14:27,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=5, PETRI_FLOW=173, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2025-02-08 01:14:27,879 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2025-02-08 01:14:27,879 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 173 flow [2025-02-08 01:14:27,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:27,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:27,879 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:27,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:14:27,880 INFO L396 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-02-08 01:14:27,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2066346723, now seen corresponding path program 1 times [2025-02-08 01:14:27,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:27,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476208759] [2025-02-08 01:14:27,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:14:27,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:27,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:14:27,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:14:27,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:27,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:27,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:27,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476208759] [2025-02-08 01:14:27,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476208759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:27,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:27,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:14:27,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951530164] [2025-02-08 01:14:27,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:27,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:14:27,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:27,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:14:27,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:14:27,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:27,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:27,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:27,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:27,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:28,321 INFO L124 PetriNetUnfolderBase]: 4692/6833 cut-off events. [2025-02-08 01:14:28,322 INFO L125 PetriNetUnfolderBase]: For 5769/5769 co-relation queries the response was YES. [2025-02-08 01:14:28,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15897 conditions, 6833 events. 4692/6833 cut-off events. For 5769/5769 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 36442 event pairs, 439 based on Foata normal form. 45/6481 useless extension candidates. Maximal degree in co-relation 15857. Up to 3796 conditions per place. [2025-02-08 01:14:28,347 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 82 selfloop transitions, 6 changer transitions 0/92 dead transitions. [2025-02-08 01:14:28,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 481 flow [2025-02-08 01:14:28,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:14:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:14:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-02-08 01:14:28,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5663265306122449 [2025-02-08 01:14:28,348 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 173 flow. Second operand 4 states and 111 transitions. [2025-02-08 01:14:28,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 481 flow [2025-02-08 01:14:28,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 92 transitions, 472 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-02-08 01:14:28,359 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 225 flow [2025-02-08 01:14:28,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2025-02-08 01:14:28,360 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2025-02-08 01:14:28,360 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 225 flow [2025-02-08 01:14:28,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:28,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:28,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:28,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:14:28,361 INFO L396 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-02-08 01:14:28,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:28,361 INFO L85 PathProgramCache]: Analyzing trace with hash -218677117, now seen corresponding path program 2 times [2025-02-08 01:14:28,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:28,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141228546] [2025-02-08 01:14:28,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:14:28,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:28,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:14:28,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:14:28,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:14:28,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:28,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:28,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141228546] [2025-02-08 01:14:28,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141228546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:28,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:28,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:14:28,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422139941] [2025-02-08 01:14:28,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:28,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:14:28,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:28,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:14:28,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:14:28,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:28,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:28,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:28,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:28,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:28,762 INFO L124 PetriNetUnfolderBase]: 4377/6384 cut-off events. [2025-02-08 01:14:28,763 INFO L125 PetriNetUnfolderBase]: For 5792/5792 co-relation queries the response was YES. [2025-02-08 01:14:28,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15442 conditions, 6384 events. 4377/6384 cut-off events. For 5792/5792 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 33604 event pairs, 632 based on Foata normal form. 56/6065 useless extension candidates. Maximal degree in co-relation 8191. Up to 3677 conditions per place. [2025-02-08 01:14:28,786 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 87 selfloop transitions, 8 changer transitions 0/99 dead transitions. [2025-02-08 01:14:28,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 99 transitions, 582 flow [2025-02-08 01:14:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:14:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:14:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-02-08 01:14:28,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5663265306122449 [2025-02-08 01:14:28,788 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 225 flow. Second operand 4 states and 111 transitions. [2025-02-08 01:14:28,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 99 transitions, 582 flow [2025-02-08 01:14:28,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 582 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:14:28,799 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 310 flow [2025-02-08 01:14:28,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2025-02-08 01:14:28,800 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2025-02-08 01:14:28,800 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 310 flow [2025-02-08 01:14:28,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:28,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:28,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:28,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:14:28,801 INFO L396 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-02-08 01:14:28,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:28,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2064939295, now seen corresponding path program 3 times [2025-02-08 01:14:28,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:28,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715745403] [2025-02-08 01:14:28,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:14:28,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:28,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:14:28,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:14:28,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:14:28,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:28,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:28,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715745403] [2025-02-08 01:14:28,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715745403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:28,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:28,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:14:28,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884038686] [2025-02-08 01:14:28,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:28,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:14:28,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:28,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:14:28,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:14:28,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:28,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:28,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:28,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:28,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:29,264 INFO L124 PetriNetUnfolderBase]: 4236/6147 cut-off events. [2025-02-08 01:14:29,265 INFO L125 PetriNetUnfolderBase]: For 7583/7583 co-relation queries the response was YES. [2025-02-08 01:14:29,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15718 conditions, 6147 events. 4236/6147 cut-off events. For 7583/7583 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 31904 event pairs, 934 based on Foata normal form. 22/5815 useless extension candidates. Maximal degree in co-relation 8750. Up to 3987 conditions per place. [2025-02-08 01:14:29,290 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 87 selfloop transitions, 11 changer transitions 2/104 dead transitions. [2025-02-08 01:14:29,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 104 transitions, 637 flow [2025-02-08 01:14:29,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:14:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:14:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-02-08 01:14:29,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-02-08 01:14:29,291 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 310 flow. Second operand 5 states and 126 transitions. [2025-02-08 01:14:29,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 104 transitions, 637 flow [2025-02-08 01:14:29,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 104 transitions, 635 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 01:14:29,306 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 341 flow [2025-02-08 01:14:29,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=341, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2025-02-08 01:14:29,306 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2025-02-08 01:14:29,306 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 341 flow [2025-02-08 01:14:29,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:29,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:29,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:29,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:14:29,307 INFO L396 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-02-08 01:14:29,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:29,307 INFO L85 PathProgramCache]: Analyzing trace with hash -64347511, now seen corresponding path program 1 times [2025-02-08 01:14:29,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:29,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013630463] [2025-02-08 01:14:29,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:14:29,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:29,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:14:29,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:14:29,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:29,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:29,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:29,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013630463] [2025-02-08 01:14:29,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013630463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:29,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:29,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:14:29,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024435395] [2025-02-08 01:14:29,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:29,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:14:29,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:29,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:14:29,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:14:29,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:29,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 341 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:29,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:29,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:29,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:29,848 INFO L124 PetriNetUnfolderBase]: 4899/7130 cut-off events. [2025-02-08 01:14:29,848 INFO L125 PetriNetUnfolderBase]: For 9929/9929 co-relation queries the response was YES. [2025-02-08 01:14:29,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17928 conditions, 7130 events. 4899/7130 cut-off events. For 9929/9929 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 38406 event pairs, 820 based on Foata normal form. 44/6740 useless extension candidates. Maximal degree in co-relation 9745. Up to 4501 conditions per place. [2025-02-08 01:14:29,883 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 85 selfloop transitions, 10 changer transitions 0/99 dead transitions. [2025-02-08 01:14:29,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 99 transitions, 647 flow [2025-02-08 01:14:29,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:14:29,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:14:29,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-02-08 01:14:29,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5612244897959183 [2025-02-08 01:14:29,884 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 341 flow. Second operand 4 states and 110 transitions. [2025-02-08 01:14:29,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 99 transitions, 647 flow [2025-02-08 01:14:29,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 99 transitions, 612 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 01:14:29,908 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 368 flow [2025-02-08 01:14:29,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=368, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2025-02-08 01:14:29,908 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2025-02-08 01:14:29,908 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 368 flow [2025-02-08 01:14:29,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:29,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:29,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:29,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:14:29,909 INFO L396 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-02-08 01:14:29,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:29,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1363077793, now seen corresponding path program 2 times [2025-02-08 01:14:29,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:29,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362435289] [2025-02-08 01:14:29,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:14:29,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:29,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:14:29,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:14:29,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:14:29,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:29,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:29,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362435289] [2025-02-08 01:14:29,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362435289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:29,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:29,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:14:29,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832275120] [2025-02-08 01:14:29,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:29,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:14:29,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:29,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:14:29,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:14:29,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:29,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 368 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:29,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:29,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:29,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:30,354 INFO L124 PetriNetUnfolderBase]: 4690/6803 cut-off events. [2025-02-08 01:14:30,354 INFO L125 PetriNetUnfolderBase]: For 8259/8259 co-relation queries the response was YES. [2025-02-08 01:14:30,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17612 conditions, 6803 events. 4690/6803 cut-off events. For 8259/8259 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 36094 event pairs, 1187 based on Foata normal form. 23/6415 useless extension candidates. Maximal degree in co-relation 11195. Up to 4537 conditions per place. [2025-02-08 01:14:30,386 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 92 selfloop transitions, 11 changer transitions 3/110 dead transitions. [2025-02-08 01:14:30,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 110 transitions, 714 flow [2025-02-08 01:14:30,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:14:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:14:30,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-02-08 01:14:30,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2025-02-08 01:14:30,388 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 368 flow. Second operand 5 states and 128 transitions. [2025-02-08 01:14:30,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 110 transitions, 714 flow [2025-02-08 01:14:30,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 110 transitions, 696 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-08 01:14:30,405 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 401 flow [2025-02-08 01:14:30,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=401, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2025-02-08 01:14:30,407 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2025-02-08 01:14:30,407 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 401 flow [2025-02-08 01:14:30,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:30,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:30,408 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:30,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 01:14:30,408 INFO L396 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-02-08 01:14:30,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:30,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1387595189, now seen corresponding path program 4 times [2025-02-08 01:14:30,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:30,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769004471] [2025-02-08 01:14:30,410 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:14:30,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:30,417 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-08 01:14:30,418 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 28 statements. [2025-02-08 01:14:30,418 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:14:30,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:30,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:30,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769004471] [2025-02-08 01:14:30,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769004471] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:30,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:30,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:14:30,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93658985] [2025-02-08 01:14:30,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:30,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:14:30,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:30,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:14:30,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:14:30,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:30,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 401 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:30,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:30,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:30,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:30,808 INFO L124 PetriNetUnfolderBase]: 4733/6875 cut-off events. [2025-02-08 01:14:30,809 INFO L125 PetriNetUnfolderBase]: For 10025/10025 co-relation queries the response was YES. [2025-02-08 01:14:30,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17812 conditions, 6875 events. 4733/6875 cut-off events. For 10025/10025 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 36734 event pairs, 1933 based on Foata normal form. 20/6474 useless extension candidates. Maximal degree in co-relation 11240. Up to 3502 conditions per place. [2025-02-08 01:14:30,828 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 75 selfloop transitions, 6 changer transitions 9/94 dead transitions. [2025-02-08 01:14:30,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 94 transitions, 649 flow [2025-02-08 01:14:30,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:14:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:14:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-02-08 01:14:30,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-02-08 01:14:30,833 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 401 flow. Second operand 4 states and 100 transitions. [2025-02-08 01:14:30,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 94 transitions, 649 flow [2025-02-08 01:14:30,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 94 transitions, 635 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-08 01:14:30,849 INFO L231 Difference]: Finished difference. Result has 79 places, 64 transitions, 388 flow [2025-02-08 01:14:30,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=388, PETRI_PLACES=79, PETRI_TRANSITIONS=64} [2025-02-08 01:14:30,850 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2025-02-08 01:14:30,850 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 64 transitions, 388 flow [2025-02-08 01:14:30,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:30,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:30,851 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:30,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 01:14:30,851 INFO L396 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-02-08 01:14:30,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:30,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1877135577, now seen corresponding path program 3 times [2025-02-08 01:14:30,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:30,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651344701] [2025-02-08 01:14:30,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:14:30,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:30,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:14:30,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:14:30,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:14:30,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:30,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:30,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651344701] [2025-02-08 01:14:30,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651344701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:30,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:30,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:14:30,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671188646] [2025-02-08 01:14:30,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:30,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:14:30,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:30,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:14:30,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:14:30,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:30,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 64 transitions, 388 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:30,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:30,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:30,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:31,267 INFO L124 PetriNetUnfolderBase]: 4194/6051 cut-off events. [2025-02-08 01:14:31,267 INFO L125 PetriNetUnfolderBase]: For 9010/9010 co-relation queries the response was YES. [2025-02-08 01:14:31,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15918 conditions, 6051 events. 4194/6051 cut-off events. For 9010/9010 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 31032 event pairs, 1840 based on Foata normal form. 45/5730 useless extension candidates. Maximal degree in co-relation 14908. Up to 3792 conditions per place. [2025-02-08 01:14:31,299 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 103 selfloop transitions, 6 changer transitions 6/119 dead transitions. [2025-02-08 01:14:31,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 119 transitions, 748 flow [2025-02-08 01:14:31,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:14:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:14:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-02-08 01:14:31,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-02-08 01:14:31,301 INFO L175 Difference]: Start difference. First operand has 79 places, 64 transitions, 388 flow. Second operand 5 states and 134 transitions. [2025-02-08 01:14:31,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 119 transitions, 748 flow [2025-02-08 01:14:31,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 119 transitions, 732 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 01:14:31,319 INFO L231 Difference]: Finished difference. Result has 80 places, 62 transitions, 355 flow [2025-02-08 01:14:31,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2025-02-08 01:14:31,319 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2025-02-08 01:14:31,319 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 355 flow [2025-02-08 01:14:31,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:31,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:31,320 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:31,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 01:14:31,320 INFO L396 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-02-08 01:14:31,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:31,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1957423359, now seen corresponding path program 4 times [2025-02-08 01:14:31,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:31,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822283032] [2025-02-08 01:14:31,321 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:14:31,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:31,328 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-08 01:14:31,330 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 28 statements. [2025-02-08 01:14:31,330 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:14:31,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:31,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:31,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822283032] [2025-02-08 01:14:31,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822283032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:31,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:31,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:14:31,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982543957] [2025-02-08 01:14:31,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:31,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:14:31,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:31,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:14:31,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:14:31,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:31,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 62 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:31,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:31,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:31,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:31,678 INFO L124 PetriNetUnfolderBase]: 4067/5846 cut-off events. [2025-02-08 01:14:31,679 INFO L125 PetriNetUnfolderBase]: For 8260/8260 co-relation queries the response was YES. [2025-02-08 01:14:31,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15474 conditions, 5846 events. 4067/5846 cut-off events. For 8260/8260 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 29824 event pairs, 2078 based on Foata normal form. 16/5488 useless extension candidates. Maximal degree in co-relation 12348. Up to 4316 conditions per place. [2025-02-08 01:14:31,699 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 72 selfloop transitions, 2 changer transitions 13/91 dead transitions. [2025-02-08 01:14:31,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 91 transitions, 597 flow [2025-02-08 01:14:31,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:14:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:14:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-02-08 01:14:31,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2025-02-08 01:14:31,700 INFO L175 Difference]: Start difference. First operand has 80 places, 62 transitions, 355 flow. Second operand 4 states and 99 transitions. [2025-02-08 01:14:31,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 91 transitions, 597 flow [2025-02-08 01:14:31,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 91 transitions, 575 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-08 01:14:31,714 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 322 flow [2025-02-08 01:14:31,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2025-02-08 01:14:31,715 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2025-02-08 01:14:31,715 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 322 flow [2025-02-08 01:14:31,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:31,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:31,715 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:31,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 01:14:31,715 INFO L396 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-02-08 01:14:31,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:31,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1576910015, now seen corresponding path program 5 times [2025-02-08 01:14:31,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:31,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950391248] [2025-02-08 01:14:31,716 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:14:31,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:31,724 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:14:31,728 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:14:31,728 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:14:31,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:31,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:31,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950391248] [2025-02-08 01:14:31,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950391248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:31,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:31,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:14:31,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490624298] [2025-02-08 01:14:31,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:31,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:14:31,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:31,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:14:31,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:14:31,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:31,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 322 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:31,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:31,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:31,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:32,024 INFO L124 PetriNetUnfolderBase]: 3693/5277 cut-off events. [2025-02-08 01:14:32,025 INFO L125 PetriNetUnfolderBase]: For 7106/7106 co-relation queries the response was YES. [2025-02-08 01:14:32,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13986 conditions, 5277 events. 3693/5277 cut-off events. For 7106/7106 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 25977 event pairs, 2346 based on Foata normal form. 16/4949 useless extension candidates. Maximal degree in co-relation 12890. Up to 4956 conditions per place. [2025-02-08 01:14:32,046 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 53 selfloop transitions, 0 changer transitions 14/71 dead transitions. [2025-02-08 01:14:32,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 71 transitions, 464 flow [2025-02-08 01:14:32,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:14:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:14:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-02-08 01:14:32,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41836734693877553 [2025-02-08 01:14:32,047 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 322 flow. Second operand 4 states and 82 transitions. [2025-02-08 01:14:32,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 71 transitions, 464 flow [2025-02-08 01:14:32,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 71 transitions, 452 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-08 01:14:32,060 INFO L231 Difference]: Finished difference. Result has 76 places, 57 transitions, 274 flow [2025-02-08 01:14:32,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=76, PETRI_TRANSITIONS=57} [2025-02-08 01:14:32,060 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2025-02-08 01:14:32,060 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 57 transitions, 274 flow [2025-02-08 01:14:32,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:32,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:32,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:32,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 01:14:32,061 INFO L396 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-02-08 01:14:32,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:32,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1866818405, now seen corresponding path program 5 times [2025-02-08 01:14:32,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:32,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764402198] [2025-02-08 01:14:32,061 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:14:32,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:32,068 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:14:32,072 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:14:32,072 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:14:32,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:32,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:32,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764402198] [2025-02-08 01:14:32,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764402198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:32,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:32,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:14:32,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203135882] [2025-02-08 01:14:32,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:32,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:14:32,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:32,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:14:32,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:14:32,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:32,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 274 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:32,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:32,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:32,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:32,369 INFO L124 PetriNetUnfolderBase]: 3267/4671 cut-off events. [2025-02-08 01:14:32,370 INFO L125 PetriNetUnfolderBase]: For 5140/5140 co-relation queries the response was YES. [2025-02-08 01:14:32,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12046 conditions, 4671 events. 3267/4671 cut-off events. For 5140/5140 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 22424 event pairs, 688 based on Foata normal form. 55/4411 useless extension candidates. Maximal degree in co-relation 12032. Up to 3475 conditions per place. [2025-02-08 01:14:32,387 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 73 selfloop transitions, 8 changer transitions 3/88 dead transitions. [2025-02-08 01:14:32,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 88 transitions, 520 flow [2025-02-08 01:14:32,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:14:32,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:14:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-02-08 01:14:32,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2025-02-08 01:14:32,388 INFO L175 Difference]: Start difference. First operand has 76 places, 57 transitions, 274 flow. Second operand 4 states and 103 transitions. [2025-02-08 01:14:32,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 88 transitions, 520 flow [2025-02-08 01:14:32,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 88 transitions, 516 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 01:14:32,396 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 271 flow [2025-02-08 01:14:32,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2025-02-08 01:14:32,397 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2025-02-08 01:14:32,397 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 271 flow [2025-02-08 01:14:32,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:32,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:32,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:32,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 01:14:32,398 INFO L396 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-02-08 01:14:32,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:32,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1528124877, now seen corresponding path program 6 times [2025-02-08 01:14:32,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:32,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130776273] [2025-02-08 01:14:32,399 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:14:32,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:32,404 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:14:32,407 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:14:32,407 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:14:32,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:32,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:32,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:32,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130776273] [2025-02-08 01:14:32,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130776273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:32,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:32,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:14:32,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979180674] [2025-02-08 01:14:32,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:32,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:14:32,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:32,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:14:32,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:14:32,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:32,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:32,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:32,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:32,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:32,682 INFO L124 PetriNetUnfolderBase]: 2845/4051 cut-off events. [2025-02-08 01:14:32,682 INFO L125 PetriNetUnfolderBase]: For 3815/3815 co-relation queries the response was YES. [2025-02-08 01:14:32,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10444 conditions, 4051 events. 2845/4051 cut-off events. For 3815/3815 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 18767 event pairs, 570 based on Foata normal form. 20/3779 useless extension candidates. Maximal degree in co-relation 10431. Up to 3491 conditions per place. [2025-02-08 01:14:32,697 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 59 selfloop transitions, 4 changer transitions 9/76 dead transitions. [2025-02-08 01:14:32,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 76 transitions, 451 flow [2025-02-08 01:14:32,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:14:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:14:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-02-08 01:14:32,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-02-08 01:14:32,699 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 271 flow. Second operand 4 states and 91 transitions. [2025-02-08 01:14:32,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 76 transitions, 451 flow [2025-02-08 01:14:32,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 430 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-02-08 01:14:32,705 INFO L231 Difference]: Finished difference. Result has 68 places, 54 transitions, 234 flow [2025-02-08 01:14:32,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2025-02-08 01:14:32,706 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2025-02-08 01:14:32,706 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 234 flow [2025-02-08 01:14:32,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:32,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:32,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:32,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 01:14:32,706 INFO L396 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-02-08 01:14:32,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:32,707 INFO L85 PathProgramCache]: Analyzing trace with hash 725311523, now seen corresponding path program 1 times [2025-02-08 01:14:32,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:32,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175574738] [2025-02-08 01:14:32,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:14:32,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:32,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:14:32,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:32,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:32,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:32,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:32,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175574738] [2025-02-08 01:14:32,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175574738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:32,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:32,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:14:32,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447441572] [2025-02-08 01:14:32,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:32,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:14:32,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:32,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:14:32,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:14:33,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:33,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 54 transitions, 234 flow. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:33,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:33,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:33,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:33,566 INFO L124 PetriNetUnfolderBase]: 5531/7795 cut-off events. [2025-02-08 01:14:33,566 INFO L125 PetriNetUnfolderBase]: For 5013/5013 co-relation queries the response was YES. [2025-02-08 01:14:33,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20008 conditions, 7795 events. 5531/7795 cut-off events. For 5013/5013 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 39494 event pairs, 2154 based on Foata normal form. 1/7256 useless extension candidates. Maximal degree in co-relation 19997. Up to 3039 conditions per place. [2025-02-08 01:14:33,600 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 114 selfloop transitions, 13 changer transitions 1/132 dead transitions. [2025-02-08 01:14:33,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 132 transitions, 840 flow [2025-02-08 01:14:33,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:14:33,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:14:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2025-02-08 01:14:33,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-02-08 01:14:33,603 INFO L175 Difference]: Start difference. First operand has 68 places, 54 transitions, 234 flow. Second operand 7 states and 147 transitions. [2025-02-08 01:14:33,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 132 transitions, 840 flow [2025-02-08 01:14:33,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 132 transitions, 815 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-02-08 01:14:33,614 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 315 flow [2025-02-08 01:14:33,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=315, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2025-02-08 01:14:33,614 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2025-02-08 01:14:33,614 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 315 flow [2025-02-08 01:14:33,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:33,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:33,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:33,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 01:14:33,615 INFO L396 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-02-08 01:14:33,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash -572366357, now seen corresponding path program 1 times [2025-02-08 01:14:33,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:33,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026357982] [2025-02-08 01:14:33,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:14:33,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:33,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 01:14:33,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:14:33,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:33,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:33,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:33,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026357982] [2025-02-08 01:14:33,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026357982] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:33,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584873495] [2025-02-08 01:14:33,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:14:33,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:33,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:33,752 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:14:33,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:14:33,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 01:14:33,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:14:33,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:33,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:33,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 01:14:33,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:14:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:34,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:14:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:14:35,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584873495] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:35,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:14:35,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 12] total 25 [2025-02-08 01:14:35,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905645983] [2025-02-08 01:14:35,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:35,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:14:35,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:35,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:14:35,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2025-02-08 01:14:36,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:36,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 315 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:36,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:36,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:36,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:38,034 INFO L124 PetriNetUnfolderBase]: 10920/15850 cut-off events. [2025-02-08 01:14:38,034 INFO L125 PetriNetUnfolderBase]: For 8631/8631 co-relation queries the response was YES. [2025-02-08 01:14:38,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43745 conditions, 15850 events. 10920/15850 cut-off events. For 8631/8631 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 94570 event pairs, 559 based on Foata normal form. 2/15847 useless extension candidates. Maximal degree in co-relation 43731. Up to 2877 conditions per place. [2025-02-08 01:14:38,123 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 299 selfloop transitions, 65 changer transitions 13/381 dead transitions. [2025-02-08 01:14:38,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 381 transitions, 2367 flow [2025-02-08 01:14:38,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 01:14:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 01:14:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 381 transitions. [2025-02-08 01:14:38,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2025-02-08 01:14:38,125 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 315 flow. Second operand 15 states and 381 transitions. [2025-02-08 01:14:38,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 381 transitions, 2367 flow [2025-02-08 01:14:38,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 381 transitions, 2361 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 01:14:38,143 INFO L231 Difference]: Finished difference. Result has 97 places, 142 transitions, 986 flow [2025-02-08 01:14:38,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=986, PETRI_PLACES=97, PETRI_TRANSITIONS=142} [2025-02-08 01:14:38,144 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places. [2025-02-08 01:14:38,144 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 142 transitions, 986 flow [2025-02-08 01:14:38,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:38,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:38,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:38,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 01:14:38,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:38,345 INFO L396 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-02-08 01:14:38,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:38,346 INFO L85 PathProgramCache]: Analyzing trace with hash 384334802, now seen corresponding path program 1 times [2025-02-08 01:14:38,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:38,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699093040] [2025-02-08 01:14:38,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:14:38,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:38,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 01:14:38,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:14:38,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:38,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:38,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:38,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699093040] [2025-02-08 01:14:38,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699093040] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:38,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230227363] [2025-02-08 01:14:38,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:14:38,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:38,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:38,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:14:38,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:14:38,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 01:14:38,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:14:38,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:38,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:38,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 01:14:38,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:14:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:38,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:14:40,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:14:40,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230227363] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:40,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:14:40,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 12] total 24 [2025-02-08 01:14:40,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225186943] [2025-02-08 01:14:40,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:40,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:14:40,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:40,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:14:40,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2025-02-08 01:14:40,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:40,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 142 transitions, 986 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:40,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:40,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:40,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:44,011 INFO L124 PetriNetUnfolderBase]: 19880/28588 cut-off events. [2025-02-08 01:14:44,011 INFO L125 PetriNetUnfolderBase]: For 63629/63747 co-relation queries the response was YES. [2025-02-08 01:14:44,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100825 conditions, 28588 events. 19880/28588 cut-off events. For 63629/63747 co-relation queries the response was YES. Maximal size of possible extension queue 1375. Compared 182654 event pairs, 1488 based on Foata normal form. 92/28675 useless extension candidates. Maximal degree in co-relation 100798. Up to 9016 conditions per place. [2025-02-08 01:14:44,181 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 380 selfloop transitions, 220 changer transitions 13/617 dead transitions. [2025-02-08 01:14:44,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 617 transitions, 5376 flow [2025-02-08 01:14:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 01:14:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-08 01:14:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 470 transitions. [2025-02-08 01:14:44,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47959183673469385 [2025-02-08 01:14:44,183 INFO L175 Difference]: Start difference. First operand has 97 places, 142 transitions, 986 flow. Second operand 20 states and 470 transitions. [2025-02-08 01:14:44,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 617 transitions, 5376 flow [2025-02-08 01:14:44,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 617 transitions, 5317 flow, removed 18 selfloop flow, removed 2 redundant places. [2025-02-08 01:14:44,369 INFO L231 Difference]: Finished difference. Result has 128 places, 311 transitions, 3090 flow [2025-02-08 01:14:44,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3090, PETRI_PLACES=128, PETRI_TRANSITIONS=311} [2025-02-08 01:14:44,370 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places. [2025-02-08 01:14:44,370 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 311 transitions, 3090 flow [2025-02-08 01:14:44,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:44,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:44,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:44,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 01:14:44,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:44,571 INFO L396 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-02-08 01:14:44,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:44,571 INFO L85 PathProgramCache]: Analyzing trace with hash 757981177, now seen corresponding path program 2 times [2025-02-08 01:14:44,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:44,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334064572] [2025-02-08 01:14:44,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:14:44,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:44,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 01:14:44,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 31 statements. [2025-02-08 01:14:44,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:14:44,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:14:44,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:44,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334064572] [2025-02-08 01:14:44,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334064572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:44,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:44,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:14:44,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649061412] [2025-02-08 01:14:44,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:44,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:14:44,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:44,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:14:44,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:14:44,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:44,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 311 transitions, 3090 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:44,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:44,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:44,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:48,701 INFO L124 PetriNetUnfolderBase]: 27124/38823 cut-off events. [2025-02-08 01:14:48,701 INFO L125 PetriNetUnfolderBase]: For 195284/195552 co-relation queries the response was YES. [2025-02-08 01:14:48,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162010 conditions, 38823 events. 27124/38823 cut-off events. For 195284/195552 co-relation queries the response was YES. Maximal size of possible extension queue 1851. Compared 255818 event pairs, 6097 based on Foata normal form. 259/39075 useless extension candidates. Maximal degree in co-relation 161969. Up to 17254 conditions per place. [2025-02-08 01:14:49,065 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 360 selfloop transitions, 264 changer transitions 2/630 dead transitions. [2025-02-08 01:14:49,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 630 transitions, 7202 flow [2025-02-08 01:14:49,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:14:49,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:14:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2025-02-08 01:14:49,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-02-08 01:14:49,066 INFO L175 Difference]: Start difference. First operand has 128 places, 311 transitions, 3090 flow. Second operand 9 states and 210 transitions. [2025-02-08 01:14:49,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 630 transitions, 7202 flow [2025-02-08 01:14:50,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 630 transitions, 6917 flow, removed 132 selfloop flow, removed 2 redundant places. [2025-02-08 01:14:50,164 INFO L231 Difference]: Finished difference. Result has 140 places, 461 transitions, 5535 flow [2025-02-08 01:14:50,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2949, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5535, PETRI_PLACES=140, PETRI_TRANSITIONS=461} [2025-02-08 01:14:50,164 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places. [2025-02-08 01:14:50,164 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 461 transitions, 5535 flow [2025-02-08 01:14:50,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:50,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:50,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:50,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 01:14:50,165 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:14:50,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:50,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1090207899, now seen corresponding path program 3 times [2025-02-08 01:14:50,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:50,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271466192] [2025-02-08 01:14:50,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:14:50,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:50,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-02-08 01:14:50,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 31 statements. [2025-02-08 01:14:50,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:14:50,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:14:50,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:50,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271466192] [2025-02-08 01:14:50,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271466192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:50,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:50,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:14:50,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610342851] [2025-02-08 01:14:50,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:50,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:14:50,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:50,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:14:50,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:14:50,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:14:50,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 461 transitions, 5535 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:50,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:50,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:14:50,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:54,588 INFO L124 PetriNetUnfolderBase]: 27292/39166 cut-off events. [2025-02-08 01:14:54,589 INFO L125 PetriNetUnfolderBase]: For 238481/238724 co-relation queries the response was YES. [2025-02-08 01:14:54,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174552 conditions, 39166 events. 27292/39166 cut-off events. For 238481/238724 co-relation queries the response was YES. Maximal size of possible extension queue 1852. Compared 259309 event pairs, 6459 based on Foata normal form. 233/39395 useless extension candidates. Maximal degree in co-relation 174505. Up to 17056 conditions per place. [2025-02-08 01:14:55,011 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 360 selfloop transitions, 262 changer transitions 4/630 dead transitions. [2025-02-08 01:14:55,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 630 transitions, 7927 flow [2025-02-08 01:14:55,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:14:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:14:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2025-02-08 01:14:55,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-02-08 01:14:55,012 INFO L175 Difference]: Start difference. First operand has 140 places, 461 transitions, 5535 flow. Second operand 9 states and 210 transitions. [2025-02-08 01:14:55,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 630 transitions, 7927 flow [2025-02-08 01:14:56,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 630 transitions, 7849 flow, removed 39 selfloop flow, removed 0 redundant places. [2025-02-08 01:14:56,885 INFO L231 Difference]: Finished difference. Result has 149 places, 459 transitions, 5980 flow [2025-02-08 01:14:56,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5457, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=262, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5980, PETRI_PLACES=149, PETRI_TRANSITIONS=459} [2025-02-08 01:14:56,886 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 106 predicate places. [2025-02-08 01:14:56,886 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 459 transitions, 5980 flow [2025-02-08 01:14:56,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:56,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:56,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:56,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 01:14:56,886 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:14:56,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:56,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2049464801, now seen corresponding path program 4 times [2025-02-08 01:14:56,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:56,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895886342] [2025-02-08 01:14:56,887 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:14:56,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:56,892 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-02-08 01:14:56,897 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:14:56,897 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:14:56,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:57,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:57,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895886342] [2025-02-08 01:14:57,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895886342] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:57,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340362916] [2025-02-08 01:14:57,027 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:14:57,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:57,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:57,029 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:14:57,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 01:14:57,081 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-02-08 01:14:57,104 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:14:57,104 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:14:57,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:57,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 01:14:57,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:14:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:57,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:14:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:14:58,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340362916] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:58,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:14:58,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7, 11] total 26 [2025-02-08 01:14:58,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779672477] [2025-02-08 01:14:58,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:58,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:14:58,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:58,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:14:58,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2025-02-08 01:14:58,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 49 [2025-02-08 01:14:58,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 459 transitions, 5980 flow. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:58,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:58,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 49 [2025-02-08 01:14:58,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:05,364 INFO L124 PetriNetUnfolderBase]: 36608/52002 cut-off events. [2025-02-08 01:15:05,364 INFO L125 PetriNetUnfolderBase]: For 315635/315723 co-relation queries the response was YES. [2025-02-08 01:15:05,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232922 conditions, 52002 events. 36608/52002 cut-off events. For 315635/315723 co-relation queries the response was YES. Maximal size of possible extension queue 2414. Compared 347201 event pairs, 3379 based on Foata normal form. 71/50865 useless extension candidates. Maximal degree in co-relation 232873. Up to 18518 conditions per place. [2025-02-08 01:15:05,918 INFO L140 encePairwiseOnDemand]: 33/49 looper letters, 483 selfloop transitions, 501 changer transitions 8/995 dead transitions. [2025-02-08 01:15:05,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 995 transitions, 13422 flow [2025-02-08 01:15:05,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 01:15:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-08 01:15:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 431 transitions. [2025-02-08 01:15:05,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46294307196562834 [2025-02-08 01:15:05,919 INFO L175 Difference]: Start difference. First operand has 149 places, 459 transitions, 5980 flow. Second operand 19 states and 431 transitions. [2025-02-08 01:15:05,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 995 transitions, 13422 flow [2025-02-08 01:15:08,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 995 transitions, 12567 flow, removed 5 selfloop flow, removed 9 redundant places. [2025-02-08 01:15:08,125 INFO L231 Difference]: Finished difference. Result has 175 places, 708 transitions, 10602 flow [2025-02-08 01:15:08,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5439, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=272, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=10602, PETRI_PLACES=175, PETRI_TRANSITIONS=708} [2025-02-08 01:15:08,125 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 132 predicate places. [2025-02-08 01:15:08,125 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 708 transitions, 10602 flow [2025-02-08 01:15:08,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:15:08,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:08,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:08,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 01:15:08,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:08,326 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:15:08,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:08,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1880751328, now seen corresponding path program 2 times [2025-02-08 01:15:08,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:08,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669783055] [2025-02-08 01:15:08,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:15:08,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:08,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 01:15:08,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 31 statements. [2025-02-08 01:15:08,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:15:08,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:15:08,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:08,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669783055] [2025-02-08 01:15:08,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669783055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:08,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:08,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:15:08,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927594440] [2025-02-08 01:15:08,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:08,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:15:08,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:08,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:15:08,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:15:08,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:15:08,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 708 transitions, 10602 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:15:08,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:08,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:15:08,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:17,419 INFO L124 PetriNetUnfolderBase]: 47451/67616 cut-off events. [2025-02-08 01:15:17,419 INFO L125 PetriNetUnfolderBase]: For 526478/527068 co-relation queries the response was YES. [2025-02-08 01:15:18,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341876 conditions, 67616 events. 47451/67616 cut-off events. For 526478/527068 co-relation queries the response was YES. Maximal size of possible extension queue 3244. Compared 474061 event pairs, 10925 based on Foata normal form. 150/67709 useless extension candidates. Maximal degree in co-relation 341811. Up to 36888 conditions per place. [2025-02-08 01:15:18,248 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 785 selfloop transitions, 547 changer transitions 7/1344 dead transitions. [2025-02-08 01:15:18,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 1344 transitions, 21925 flow [2025-02-08 01:15:18,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:15:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:15:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions. [2025-02-08 01:15:18,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49387755102040815 [2025-02-08 01:15:18,253 INFO L175 Difference]: Start difference. First operand has 175 places, 708 transitions, 10602 flow. Second operand 10 states and 242 transitions. [2025-02-08 01:15:18,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 1344 transitions, 21925 flow [2025-02-08 01:15:26,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 1344 transitions, 21575 flow, removed 175 selfloop flow, removed 1 redundant places. [2025-02-08 01:15:26,510 INFO L231 Difference]: Finished difference. Result has 188 places, 1060 transitions, 18219 flow [2025-02-08 01:15:26,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10370, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=289, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=18219, PETRI_PLACES=188, PETRI_TRANSITIONS=1060} [2025-02-08 01:15:26,511 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 145 predicate places. [2025-02-08 01:15:26,511 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 1060 transitions, 18219 flow [2025-02-08 01:15:26,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:15:26,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:26,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:26,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 01:15:26,511 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:15:26,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:26,512 INFO L85 PathProgramCache]: Analyzing trace with hash 2108322633, now seen corresponding path program 5 times [2025-02-08 01:15:26,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:26,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515833971] [2025-02-08 01:15:26,512 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:15:26,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:26,516 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 01:15:26,520 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:15:26,520 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:15:26,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:26,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:26,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515833971] [2025-02-08 01:15:26,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515833971] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:26,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646030739] [2025-02-08 01:15:26,601 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:15:26,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:26,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:26,603 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:15:26,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 01:15:26,656 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 01:15:26,676 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:15:26,676 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:15:26,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:26,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 01:15:26,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:15:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:27,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:15:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:15:27,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646030739] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:27,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:15:27,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 12] total 25 [2025-02-08 01:15:27,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656461591] [2025-02-08 01:15:27,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:27,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:15:27,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:27,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:15:27,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2025-02-08 01:15:27,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-08 01:15:27,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 1060 transitions, 18219 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:15:27,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:27,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-08 01:15:27,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand