./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:25:37,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:25:38,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:25:38,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:25:38,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:25:38,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:25:38,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:25:38,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:25:38,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:25:38,054 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:25:38,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:25:38,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:25:38,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:25:38,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:25:38,054 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:25:38,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:25:38,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:25:38,054 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:25:38,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:25:38,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:25:38,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:25:38,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:25:38,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:25:38,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:25:38,055 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:25:38,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:25:38,055 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:25:38,055 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:25:38,055 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:25:38,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:25:38,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:25:38,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:25:38,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:25:38,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:25:38,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:25:38,056 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:25:38,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:25:38,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:25:38,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:25:38,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:25:38,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:25:38,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:25:38,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:25:38,056 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/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 -> 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac [2025-03-04 02:25:38,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:25:38,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:25:38,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:25:38,282 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:25:38,282 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:25:38,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-03-04 02:25:39,399 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f843b470/06d67c6ad7ae4014bd96c508436473b9/FLAGe6dbc23e6 [2025-03-04 02:25:39,643 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:25:39,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-03-04 02:25:39,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f843b470/06d67c6ad7ae4014bd96c508436473b9/FLAGe6dbc23e6 [2025-03-04 02:25:39,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f843b470/06d67c6ad7ae4014bd96c508436473b9 [2025-03-04 02:25:39,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:25:39,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:25:39,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:25:39,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:25:39,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:25:39,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:25:39" (1/1) ... [2025-03-04 02:25:39,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f99ca09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:39, skipping insertion in model container [2025-03-04 02:25:39,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:25:39" (1/1) ... [2025-03-04 02:25:39,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:25:39,833 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c[3654,3667] [2025-03-04 02:25:39,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:25:39,855 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:25:39,876 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c[3654,3667] [2025-03-04 02:25:39,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:25:39,898 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:25:39,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:39 WrapperNode [2025-03-04 02:25:39,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:25:39,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:25:39,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:25:39,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:25:39,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:39" (1/1) ... [2025-03-04 02:25:39,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:39" (1/1) ... [2025-03-04 02:25:39,925 INFO L138 Inliner]: procedures = 25, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 237 [2025-03-04 02:25:39,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:25:39,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:25:39,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:25:39,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:25:39,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:39" (1/1) ... [2025-03-04 02:25:39,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:39" (1/1) ... [2025-03-04 02:25:39,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:39" (1/1) ... [2025-03-04 02:25:39,947 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 02:25:39,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:39" (1/1) ... [2025-03-04 02:25:39,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:39" (1/1) ... [2025-03-04 02:25:39,954 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:39" (1/1) ... [2025-03-04 02:25:39,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:39" (1/1) ... [2025-03-04 02:25:39,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:39" (1/1) ... [2025-03-04 02:25:39,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:39" (1/1) ... [2025-03-04 02:25:39,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:25:39,958 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:25:39,958 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:25:39,958 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:25:39,959 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:39" (1/1) ... [2025-03-04 02:25:39,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:25:39,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:39,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:25:39,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:25:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:25:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:25:39,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:25:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:25:39,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:25:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:25:39,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:25:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:25:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:25:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:25:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:25:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:25:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:25:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:25:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:25:39,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:25:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:25:39,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:25:39,998 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:25:40,096 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:25:40,098 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:25:40,422 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:25:40,422 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:25:40,631 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:25:40,632 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:25:40,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:25:40 BoogieIcfgContainer [2025-03-04 02:25:40,632 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:25:40,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:25:40,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:25:40,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:25:40,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:25:39" (1/3) ... [2025-03-04 02:25:40,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3256561e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:25:40, skipping insertion in model container [2025-03-04 02:25:40,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:39" (2/3) ... [2025-03-04 02:25:40,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3256561e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:25:40, skipping insertion in model container [2025-03-04 02:25:40,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:25:40" (3/3) ... [2025-03-04 02:25:40,641 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2025-03-04 02:25:40,654 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:25:40,655 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-3-nl.wvr.c that has 4 procedures, 36 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-04 02:25:40,656 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:25:40,700 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:25:40,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 42 transitions, 105 flow [2025-03-04 02:25:40,759 INFO L124 PetriNetUnfolderBase]: 7/39 cut-off events. [2025-03-04 02:25:40,762 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:25:40,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 7/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-03-04 02:25:40,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 42 transitions, 105 flow [2025-03-04 02:25:40,770 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 38 transitions, 94 flow [2025-03-04 02:25:40,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:25:40,790 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;@509b3359, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:25:40,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:25:40,805 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:25:40,806 INFO L124 PetriNetUnfolderBase]: 7/37 cut-off events. [2025-03-04 02:25:40,806 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:25:40,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:40,807 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-03-04 02:25:40,807 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-03-04 02:25:40,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1624782182, now seen corresponding path program 1 times [2025-03-04 02:25:40,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:40,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001638856] [2025-03-04 02:25:40,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:40,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:40,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:25:40,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:25:40,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:40,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:41,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:41,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001638856] [2025-03-04 02:25:41,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001638856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:41,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:41,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:25:41,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136617702] [2025-03-04 02:25:41,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:41,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:25:41,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:41,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:25:41,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:25:41,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-04 02:25:41,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:41,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:41,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-04 02:25:41,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:41,280 INFO L124 PetriNetUnfolderBase]: 1088/1694 cut-off events. [2025-03-04 02:25:41,280 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-04 02:25:41,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3273 conditions, 1694 events. 1088/1694 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7407 event pairs, 892 based on Foata normal form. 0/1559 useless extension candidates. Maximal degree in co-relation 3037. Up to 1453 conditions per place. [2025-03-04 02:25:41,300 INFO L140 encePairwiseOnDemand]: 40/42 looper letters, 30 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2025-03-04 02:25:41,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 150 flow [2025-03-04 02:25:41,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:25:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 02:25:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2025-03-04 02:25:41,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-03-04 02:25:41,314 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 94 flow. Second operand 2 states and 50 transitions. [2025-03-04 02:25:41,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 150 flow [2025-03-04 02:25:41,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 138 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:25:41,324 INFO L231 Difference]: Finished difference. Result has 36 places, 36 transitions, 78 flow [2025-03-04 02:25:41,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=36, PETRI_TRANSITIONS=36} [2025-03-04 02:25:41,329 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2025-03-04 02:25:41,329 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 78 flow [2025-03-04 02:25:41,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:41,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:41,330 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] [2025-03-04 02:25:41,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:25:41,331 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-03-04 02:25:41,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:41,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1086528074, now seen corresponding path program 1 times [2025-03-04 02:25:41,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:41,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087301111] [2025-03-04 02:25:41,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:41,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:41,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:25:41,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:25:41,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:41,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:41,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:41,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087301111] [2025-03-04 02:25:41,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087301111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:41,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:41,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:25:41,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685290719] [2025-03-04 02:25:41,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:41,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:25:41,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:41,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:25:41,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:25:41,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-04 02:25:41,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:41,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:41,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-04 02:25:41,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:41,860 INFO L124 PetriNetUnfolderBase]: 1208/1908 cut-off events. [2025-03-04 02:25:41,860 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 02:25:41,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3605 conditions, 1908 events. 1208/1908 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8582 event pairs, 999 based on Foata normal form. 87/1846 useless extension candidates. Maximal degree in co-relation 3602. Up to 1453 conditions per place. [2025-03-04 02:25:41,870 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 29 selfloop transitions, 2 changer transitions 16/53 dead transitions. [2025-03-04 02:25:41,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 209 flow [2025-03-04 02:25:41,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:25:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:25:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-03-04 02:25:41,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2025-03-04 02:25:41,872 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 78 flow. Second operand 4 states and 86 transitions. [2025-03-04 02:25:41,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 209 flow [2025-03-04 02:25:41,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:25:41,875 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 96 flow [2025-03-04 02:25:41,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-03-04 02:25:41,876 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2025-03-04 02:25:41,877 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 96 flow [2025-03-04 02:25:41,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:41,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:41,877 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-03-04 02:25:41,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:25:41,879 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-03-04 02:25:41,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:41,879 INFO L85 PathProgramCache]: Analyzing trace with hash 737147797, now seen corresponding path program 1 times [2025-03-04 02:25:41,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:41,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962198504] [2025-03-04 02:25:41,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:41,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:41,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:25:41,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:25:41,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:41,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:42,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:42,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:42,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962198504] [2025-03-04 02:25:42,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962198504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:42,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:42,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:25:42,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767116382] [2025-03-04 02:25:42,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:42,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:25:42,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:42,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:25:42,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:25:42,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-04 02:25:42,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:42,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:42,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-04 02:25:42,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:42,258 INFO L124 PetriNetUnfolderBase]: 1288/2024 cut-off events. [2025-03-04 02:25:42,259 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2025-03-04 02:25:42,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4187 conditions, 2024 events. 1288/2024 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9191 event pairs, 1072 based on Foata normal form. 77/1964 useless extension candidates. Maximal degree in co-relation 4181. Up to 1454 conditions per place. [2025-03-04 02:25:42,269 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 30 selfloop transitions, 2 changer transitions 17/55 dead transitions. [2025-03-04 02:25:42,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 240 flow [2025-03-04 02:25:42,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:25:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:25:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-03-04 02:25:42,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2025-03-04 02:25:42,272 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 96 flow. Second operand 4 states and 86 transitions. [2025-03-04 02:25:42,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 240 flow [2025-03-04 02:25:42,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 236 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:25:42,275 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 108 flow [2025-03-04 02:25:42,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2025-03-04 02:25:42,276 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2025-03-04 02:25:42,276 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 108 flow [2025-03-04 02:25:42,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:42,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:42,276 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-03-04 02:25:42,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:25:42,277 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-03-04 02:25:42,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:42,277 INFO L85 PathProgramCache]: Analyzing trace with hash 855943922, now seen corresponding path program 1 times [2025-03-04 02:25:42,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:42,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235390628] [2025-03-04 02:25:42,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:42,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:42,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:25:42,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:25:42,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:42,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:43,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:43,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235390628] [2025-03-04 02:25:43,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235390628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:43,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:43,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:43,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58506216] [2025-03-04 02:25:43,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:43,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:43,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:43,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:43,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:43,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:25:43,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 108 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:43,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:43,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:25:43,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:43,868 INFO L124 PetriNetUnfolderBase]: 1957/3008 cut-off events. [2025-03-04 02:25:43,869 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2025-03-04 02:25:43,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6593 conditions, 3008 events. 1957/3008 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14640 event pairs, 73 based on Foata normal form. 1/2942 useless extension candidates. Maximal degree in co-relation 6585. Up to 1861 conditions per place. [2025-03-04 02:25:43,884 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 102 selfloop transitions, 27 changer transitions 3/137 dead transitions. [2025-03-04 02:25:43,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 137 transitions, 645 flow [2025-03-04 02:25:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:25:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:25:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 227 transitions. [2025-03-04 02:25:43,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4503968253968254 [2025-03-04 02:25:43,886 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 108 flow. Second operand 12 states and 227 transitions. [2025-03-04 02:25:43,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 137 transitions, 645 flow [2025-03-04 02:25:43,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 137 transitions, 641 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:25:43,889 INFO L231 Difference]: Finished difference. Result has 59 places, 63 transitions, 256 flow [2025-03-04 02:25:43,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=256, PETRI_PLACES=59, PETRI_TRANSITIONS=63} [2025-03-04 02:25:43,889 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2025-03-04 02:25:43,890 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 256 flow [2025-03-04 02:25:43,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:43,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:43,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:43,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:25:43,890 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-03-04 02:25:43,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:43,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1633324682, now seen corresponding path program 2 times [2025-03-04 02:25:43,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:43,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426235210] [2025-03-04 02:25:43,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:43,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:43,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:25:43,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:25:43,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:25:43,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:43,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:43,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426235210] [2025-03-04 02:25:43,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426235210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:43,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:43,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:25:43,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240864650] [2025-03-04 02:25:43,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:43,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:25:43,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:43,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:25:43,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:25:43,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-04 02:25:43,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:43,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:43,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-04 02:25:43,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:44,131 INFO L124 PetriNetUnfolderBase]: 1545/2445 cut-off events. [2025-03-04 02:25:44,132 INFO L125 PetriNetUnfolderBase]: For 1607/1624 co-relation queries the response was YES. [2025-03-04 02:25:44,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6645 conditions, 2445 events. 1545/2445 cut-off events. For 1607/1624 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11713 event pairs, 399 based on Foata normal form. 47/2429 useless extension candidates. Maximal degree in co-relation 6631. Up to 1922 conditions per place. [2025-03-04 02:25:44,146 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 69 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2025-03-04 02:25:44,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 458 flow [2025-03-04 02:25:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:25:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:25:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 02:25:44,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2025-03-04 02:25:44,148 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 256 flow. Second operand 3 states and 71 transitions. [2025-03-04 02:25:44,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 458 flow [2025-03-04 02:25:44,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 79 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:25:44,156 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 272 flow [2025-03-04 02:25:44,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2025-03-04 02:25:44,158 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2025-03-04 02:25:44,158 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 272 flow [2025-03-04 02:25:44,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:44,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:44,159 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-03-04 02:25:44,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:25:44,159 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-03-04 02:25:44,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:44,159 INFO L85 PathProgramCache]: Analyzing trace with hash 220493904, now seen corresponding path program 3 times [2025-03-04 02:25:44,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:44,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329802412] [2025-03-04 02:25:44,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:25:44,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:44,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:25:44,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:25:44,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:25:44,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:44,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:44,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329802412] [2025-03-04 02:25:44,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329802412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:44,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:44,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:25:44,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10728029] [2025-03-04 02:25:44,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:44,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:25:44,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:44,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:25:44,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:25:44,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-04 02:25:44,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:44,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:44,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-04 02:25:44,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:44,354 INFO L124 PetriNetUnfolderBase]: 1191/1957 cut-off events. [2025-03-04 02:25:44,355 INFO L125 PetriNetUnfolderBase]: For 1952/1953 co-relation queries the response was YES. [2025-03-04 02:25:44,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5673 conditions, 1957 events. 1191/1957 cut-off events. For 1952/1953 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9268 event pairs, 430 based on Foata normal form. 86/1992 useless extension candidates. Maximal degree in co-relation 5657. Up to 1183 conditions per place. [2025-03-04 02:25:44,367 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 70 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2025-03-04 02:25:44,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 482 flow [2025-03-04 02:25:44,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:25:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:25:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-04 02:25:44,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 02:25:44,369 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 272 flow. Second operand 3 states and 70 transitions. [2025-03-04 02:25:44,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 482 flow [2025-03-04 02:25:44,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 459 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-04 02:25:44,377 INFO L231 Difference]: Finished difference. Result has 60 places, 63 transitions, 260 flow [2025-03-04 02:25:44,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=60, PETRI_TRANSITIONS=63} [2025-03-04 02:25:44,377 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2025-03-04 02:25:44,378 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 63 transitions, 260 flow [2025-03-04 02:25:44,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:44,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:44,379 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-03-04 02:25:44,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:25:44,379 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-03-04 02:25:44,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:44,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1059744608, now seen corresponding path program 4 times [2025-03-04 02:25:44,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:44,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662088377] [2025-03-04 02:25:44,380 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:25:44,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:44,389 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:25:44,416 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:25:44,416 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:25:44,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:44,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:44,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662088377] [2025-03-04 02:25:44,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662088377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:44,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:44,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:44,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952624163] [2025-03-04 02:25:44,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:44,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:44,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:44,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:44,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:44,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 02:25:44,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 63 transitions, 260 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:44,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:44,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 02:25:44,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:45,334 INFO L124 PetriNetUnfolderBase]: 1694/2729 cut-off events. [2025-03-04 02:25:45,336 INFO L125 PetriNetUnfolderBase]: For 2094/2094 co-relation queries the response was YES. [2025-03-04 02:25:45,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7696 conditions, 2729 events. 1694/2729 cut-off events. For 2094/2094 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 13858 event pairs, 380 based on Foata normal form. 1/2660 useless extension candidates. Maximal degree in co-relation 7681. Up to 1986 conditions per place. [2025-03-04 02:25:45,350 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 106 selfloop transitions, 30 changer transitions 3/143 dead transitions. [2025-03-04 02:25:45,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 143 transitions, 857 flow [2025-03-04 02:25:45,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:25:45,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:25:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2025-03-04 02:25:45,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43073593073593075 [2025-03-04 02:25:45,352 INFO L175 Difference]: Start difference. First operand has 60 places, 63 transitions, 260 flow. Second operand 11 states and 199 transitions. [2025-03-04 02:25:45,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 143 transitions, 857 flow [2025-03-04 02:25:45,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 143 transitions, 838 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 02:25:45,355 INFO L231 Difference]: Finished difference. Result has 74 places, 80 transitions, 437 flow [2025-03-04 02:25:45,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=437, PETRI_PLACES=74, PETRI_TRANSITIONS=80} [2025-03-04 02:25:45,357 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2025-03-04 02:25:45,357 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 80 transitions, 437 flow [2025-03-04 02:25:45,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:45,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:45,357 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-03-04 02:25:45,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:25:45,358 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-03-04 02:25:45,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:45,358 INFO L85 PathProgramCache]: Analyzing trace with hash -936356474, now seen corresponding path program 5 times [2025-03-04 02:25:45,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:45,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943499281] [2025-03-04 02:25:45,359 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:25:45,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:45,369 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:25:45,394 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:25:45,394 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:45,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:45,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:45,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943499281] [2025-03-04 02:25:45,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943499281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:45,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:45,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:45,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59341013] [2025-03-04 02:25:45,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:45,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:45,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:45,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:45,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:45,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:25:45,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 80 transitions, 437 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:45,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:45,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:25:45,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:46,397 INFO L124 PetriNetUnfolderBase]: 1600/2630 cut-off events. [2025-03-04 02:25:46,398 INFO L125 PetriNetUnfolderBase]: For 3402/3402 co-relation queries the response was YES. [2025-03-04 02:25:46,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8104 conditions, 2630 events. 1600/2630 cut-off events. For 3402/3402 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13516 event pairs, 437 based on Foata normal form. 1/2563 useless extension candidates. Maximal degree in co-relation 8084. Up to 1959 conditions per place. [2025-03-04 02:25:46,411 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 106 selfloop transitions, 34 changer transitions 3/148 dead transitions. [2025-03-04 02:25:46,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 148 transitions, 1027 flow [2025-03-04 02:25:46,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:25:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:25:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-03-04 02:25:46,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2025-03-04 02:25:46,413 INFO L175 Difference]: Start difference. First operand has 74 places, 80 transitions, 437 flow. Second operand 11 states and 202 transitions. [2025-03-04 02:25:46,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 148 transitions, 1027 flow [2025-03-04 02:25:46,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 148 transitions, 996 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-04 02:25:46,418 INFO L231 Difference]: Finished difference. Result has 90 places, 94 transitions, 636 flow [2025-03-04 02:25:46,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=636, PETRI_PLACES=90, PETRI_TRANSITIONS=94} [2025-03-04 02:25:46,419 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places. [2025-03-04 02:25:46,419 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 94 transitions, 636 flow [2025-03-04 02:25:46,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:46,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:46,419 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-03-04 02:25:46,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:25:46,420 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-03-04 02:25:46,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:46,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1734295744, now seen corresponding path program 6 times [2025-03-04 02:25:46,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:46,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331989553] [2025-03-04 02:25:46,420 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:25:46,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:46,428 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:25:46,448 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:25:46,449 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:25:46,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:46,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331989553] [2025-03-04 02:25:46,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331989553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:46,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:46,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:46,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160225033] [2025-03-04 02:25:46,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:46,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:46,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:46,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:46,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:46,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:25:46,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 94 transitions, 636 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:46,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:46,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:25:46,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:47,482 INFO L124 PetriNetUnfolderBase]: 1767/2940 cut-off events. [2025-03-04 02:25:47,482 INFO L125 PetriNetUnfolderBase]: For 6660/6660 co-relation queries the response was YES. [2025-03-04 02:25:47,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10036 conditions, 2940 events. 1767/2940 cut-off events. For 6660/6660 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15937 event pairs, 335 based on Foata normal form. 1/2855 useless extension candidates. Maximal degree in co-relation 10008. Up to 1968 conditions per place. [2025-03-04 02:25:47,499 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 120 selfloop transitions, 45 changer transitions 3/173 dead transitions. [2025-03-04 02:25:47,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 173 transitions, 1321 flow [2025-03-04 02:25:47,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:25:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:25:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions. [2025-03-04 02:25:47,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2025-03-04 02:25:47,501 INFO L175 Difference]: Start difference. First operand has 90 places, 94 transitions, 636 flow. Second operand 12 states and 225 transitions. [2025-03-04 02:25:47,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 173 transitions, 1321 flow [2025-03-04 02:25:47,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 173 transitions, 1289 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-03-04 02:25:47,512 INFO L231 Difference]: Finished difference. Result has 103 places, 103 transitions, 797 flow [2025-03-04 02:25:47,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=797, PETRI_PLACES=103, PETRI_TRANSITIONS=103} [2025-03-04 02:25:47,512 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 62 predicate places. [2025-03-04 02:25:47,512 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 103 transitions, 797 flow [2025-03-04 02:25:47,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:47,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:47,513 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-03-04 02:25:47,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:25:47,513 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-03-04 02:25:47,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:47,513 INFO L85 PathProgramCache]: Analyzing trace with hash -28524596, now seen corresponding path program 7 times [2025-03-04 02:25:47,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:47,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833253570] [2025-03-04 02:25:47,513 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:25:47,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:47,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:25:47,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:25:47,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:47,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:48,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:48,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833253570] [2025-03-04 02:25:48,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833253570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:48,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:48,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:48,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724819725] [2025-03-04 02:25:48,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:48,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:48,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:48,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:48,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:48,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:25:48,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 103 transitions, 797 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:48,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:48,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:25:48,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:48,546 INFO L124 PetriNetUnfolderBase]: 1871/3143 cut-off events. [2025-03-04 02:25:48,546 INFO L125 PetriNetUnfolderBase]: For 9727/9727 co-relation queries the response was YES. [2025-03-04 02:25:48,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11410 conditions, 3143 events. 1871/3143 cut-off events. For 9727/9727 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 17573 event pairs, 433 based on Foata normal form. 1/3053 useless extension candidates. Maximal degree in co-relation 11378. Up to 2305 conditions per place. [2025-03-04 02:25:48,564 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 127 selfloop transitions, 41 changer transitions 3/176 dead transitions. [2025-03-04 02:25:48,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 176 transitions, 1482 flow [2025-03-04 02:25:48,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:25:48,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:25:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 221 transitions. [2025-03-04 02:25:48,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4384920634920635 [2025-03-04 02:25:48,566 INFO L175 Difference]: Start difference. First operand has 103 places, 103 transitions, 797 flow. Second operand 12 states and 221 transitions. [2025-03-04 02:25:48,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 176 transitions, 1482 flow [2025-03-04 02:25:48,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 176 transitions, 1387 flow, removed 25 selfloop flow, removed 6 redundant places. [2025-03-04 02:25:48,581 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 875 flow [2025-03-04 02:25:48,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=875, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2025-03-04 02:25:48,582 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2025-03-04 02:25:48,582 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 875 flow [2025-03-04 02:25:48,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:48,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:48,583 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-03-04 02:25:48,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:25:48,583 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-03-04 02:25:48,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:48,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1954244786, now seen corresponding path program 8 times [2025-03-04 02:25:48,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:48,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260080087] [2025-03-04 02:25:48,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:48,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:48,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:25:48,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:25:48,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:25:48,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:49,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260080087] [2025-03-04 02:25:49,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260080087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:49,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:49,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:49,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818273518] [2025-03-04 02:25:49,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:49,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:49,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:49,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:49,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:49,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:25:49,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 875 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:49,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:49,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:25:49,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:49,534 INFO L124 PetriNetUnfolderBase]: 1871/3141 cut-off events. [2025-03-04 02:25:49,535 INFO L125 PetriNetUnfolderBase]: For 11789/11789 co-relation queries the response was YES. [2025-03-04 02:25:49,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11759 conditions, 3141 events. 1871/3141 cut-off events. For 11789/11789 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 17569 event pairs, 453 based on Foata normal form. 1/3051 useless extension candidates. Maximal degree in co-relation 11723. Up to 2389 conditions per place. [2025-03-04 02:25:49,548 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 123 selfloop transitions, 40 changer transitions 3/171 dead transitions. [2025-03-04 02:25:49,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 171 transitions, 1497 flow [2025-03-04 02:25:49,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:25:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:25:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 212 transitions. [2025-03-04 02:25:49,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2025-03-04 02:25:49,549 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 875 flow. Second operand 12 states and 212 transitions. [2025-03-04 02:25:49,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 171 transitions, 1497 flow [2025-03-04 02:25:49,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 171 transitions, 1386 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-03-04 02:25:49,566 INFO L231 Difference]: Finished difference. Result has 117 places, 112 transitions, 895 flow [2025-03-04 02:25:49,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=895, PETRI_PLACES=117, PETRI_TRANSITIONS=112} [2025-03-04 02:25:49,567 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2025-03-04 02:25:49,567 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 895 flow [2025-03-04 02:25:49,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:49,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:49,567 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-03-04 02:25:49,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:25:49,567 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-03-04 02:25:49,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:49,568 INFO L85 PathProgramCache]: Analyzing trace with hash -498824284, now seen corresponding path program 9 times [2025-03-04 02:25:49,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:49,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611404620] [2025-03-04 02:25:49,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:25:49,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:49,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:25:49,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:25:49,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:25:49,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:50,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:50,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611404620] [2025-03-04 02:25:50,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611404620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:50,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:50,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:50,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12146482] [2025-03-04 02:25:50,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:50,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:50,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:50,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:50,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:50,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:25:50,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 895 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:50,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:50,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:25:50,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:50,516 INFO L124 PetriNetUnfolderBase]: 2008/3380 cut-off events. [2025-03-04 02:25:50,516 INFO L125 PetriNetUnfolderBase]: For 12826/12826 co-relation queries the response was YES. [2025-03-04 02:25:50,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12672 conditions, 3380 events. 2008/3380 cut-off events. For 12826/12826 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19261 event pairs, 600 based on Foata normal form. 1/3282 useless extension candidates. Maximal degree in co-relation 12633. Up to 2656 conditions per place. [2025-03-04 02:25:50,538 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 131 selfloop transitions, 36 changer transitions 3/175 dead transitions. [2025-03-04 02:25:50,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 175 transitions, 1598 flow [2025-03-04 02:25:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:25:50,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:25:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2025-03-04 02:25:50,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-04 02:25:50,540 INFO L175 Difference]: Start difference. First operand has 117 places, 112 transitions, 895 flow. Second operand 11 states and 198 transitions. [2025-03-04 02:25:50,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 175 transitions, 1598 flow [2025-03-04 02:25:50,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 175 transitions, 1504 flow, removed 9 selfloop flow, removed 9 redundant places. [2025-03-04 02:25:50,561 INFO L231 Difference]: Finished difference. Result has 122 places, 121 transitions, 1026 flow [2025-03-04 02:25:50,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1026, PETRI_PLACES=122, PETRI_TRANSITIONS=121} [2025-03-04 02:25:50,563 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 81 predicate places. [2025-03-04 02:25:50,563 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 121 transitions, 1026 flow [2025-03-04 02:25:50,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:50,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:50,564 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-03-04 02:25:50,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:25:50,564 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-03-04 02:25:50,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:50,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1611992146, now seen corresponding path program 10 times [2025-03-04 02:25:50,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:50,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635185333] [2025-03-04 02:25:50,565 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:25:50,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:50,574 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:25:50,586 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:25:50,586 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:25:50,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:50,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:50,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635185333] [2025-03-04 02:25:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635185333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:50,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:50,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:50,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381265730] [2025-03-04 02:25:50,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:50,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:50,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:50,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:50,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:51,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 02:25:51,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 121 transitions, 1026 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:51,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:51,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 02:25:51,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:51,546 INFO L124 PetriNetUnfolderBase]: 2338/3879 cut-off events. [2025-03-04 02:25:51,546 INFO L125 PetriNetUnfolderBase]: For 22345/22345 co-relation queries the response was YES. [2025-03-04 02:25:51,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15483 conditions, 3879 events. 2338/3879 cut-off events. For 22345/22345 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 22470 event pairs, 765 based on Foata normal form. 1/3779 useless extension candidates. Maximal degree in co-relation 15440. Up to 3102 conditions per place. [2025-03-04 02:25:51,565 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 144 selfloop transitions, 36 changer transitions 3/187 dead transitions. [2025-03-04 02:25:51,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 187 transitions, 1797 flow [2025-03-04 02:25:51,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:25:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:25:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2025-03-04 02:25:51,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4134199134199134 [2025-03-04 02:25:51,566 INFO L175 Difference]: Start difference. First operand has 122 places, 121 transitions, 1026 flow. Second operand 11 states and 191 transitions. [2025-03-04 02:25:51,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 187 transitions, 1797 flow [2025-03-04 02:25:51,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 187 transitions, 1679 flow, removed 42 selfloop flow, removed 5 redundant places. [2025-03-04 02:25:51,597 INFO L231 Difference]: Finished difference. Result has 130 places, 130 transitions, 1122 flow [2025-03-04 02:25:51,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1122, PETRI_PLACES=130, PETRI_TRANSITIONS=130} [2025-03-04 02:25:51,598 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 89 predicate places. [2025-03-04 02:25:51,598 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 130 transitions, 1122 flow [2025-03-04 02:25:51,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:51,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:51,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, 1, 1, 1, 1, 1] [2025-03-04 02:25:51,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:25:51,598 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-03-04 02:25:51,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash 504062536, now seen corresponding path program 11 times [2025-03-04 02:25:51,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:51,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883107660] [2025-03-04 02:25:51,599 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:25:51,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:51,605 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:25:51,616 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:25:51,616 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:51,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:51,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:51,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883107660] [2025-03-04 02:25:51,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883107660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:51,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:51,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:51,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176433555] [2025-03-04 02:25:51,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:51,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:51,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:51,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:51,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:52,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:25:52,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 1122 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:52,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:52,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:25:52,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:52,563 INFO L124 PetriNetUnfolderBase]: 2306/3881 cut-off events. [2025-03-04 02:25:52,564 INFO L125 PetriNetUnfolderBase]: For 27509/27509 co-relation queries the response was YES. [2025-03-04 02:25:52,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16321 conditions, 3881 events. 2306/3881 cut-off events. For 27509/27509 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 23111 event pairs, 725 based on Foata normal form. 1/3775 useless extension candidates. Maximal degree in co-relation 16274. Up to 3069 conditions per place. [2025-03-04 02:25:52,591 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 150 selfloop transitions, 37 changer transitions 3/195 dead transitions. [2025-03-04 02:25:52,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 195 transitions, 1934 flow [2025-03-04 02:25:52,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:25:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:25:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2025-03-04 02:25:52,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-04 02:25:52,593 INFO L175 Difference]: Start difference. First operand has 130 places, 130 transitions, 1122 flow. Second operand 11 states and 203 transitions. [2025-03-04 02:25:52,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 195 transitions, 1934 flow [2025-03-04 02:25:52,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 195 transitions, 1804 flow, removed 48 selfloop flow, removed 5 redundant places. [2025-03-04 02:25:52,631 INFO L231 Difference]: Finished difference. Result has 138 places, 137 transitions, 1218 flow [2025-03-04 02:25:52,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1218, PETRI_PLACES=138, PETRI_TRANSITIONS=137} [2025-03-04 02:25:52,632 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 97 predicate places. [2025-03-04 02:25:52,632 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 137 transitions, 1218 flow [2025-03-04 02:25:52,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:52,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:52,633 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-03-04 02:25:52,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:25:52,633 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-03-04 02:25:52,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash 574700112, now seen corresponding path program 12 times [2025-03-04 02:25:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:52,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482763246] [2025-03-04 02:25:52,634 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:25:52,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:52,640 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:25:52,648 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:25:52,648 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:25:52,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:52,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:52,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482763246] [2025-03-04 02:25:52,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482763246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:52,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:52,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:52,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722430905] [2025-03-04 02:25:52,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:52,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:52,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:52,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:52,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:52,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:25:52,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 137 transitions, 1218 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:52,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:52,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:25:52,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:53,451 INFO L124 PetriNetUnfolderBase]: 2367/3989 cut-off events. [2025-03-04 02:25:53,451 INFO L125 PetriNetUnfolderBase]: For 32178/32178 co-relation queries the response was YES. [2025-03-04 02:25:53,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17144 conditions, 3989 events. 2367/3989 cut-off events. For 32178/32178 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 23956 event pairs, 815 based on Foata normal form. 1/3885 useless extension candidates. Maximal degree in co-relation 17093. Up to 3308 conditions per place. [2025-03-04 02:25:53,474 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 144 selfloop transitions, 36 changer transitions 4/189 dead transitions. [2025-03-04 02:25:53,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 189 transitions, 1880 flow [2025-03-04 02:25:53,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:25:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:25:53,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2025-03-04 02:25:53,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2025-03-04 02:25:53,476 INFO L175 Difference]: Start difference. First operand has 138 places, 137 transitions, 1218 flow. Second operand 11 states and 190 transitions. [2025-03-04 02:25:53,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 189 transitions, 1880 flow [2025-03-04 02:25:53,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 189 transitions, 1748 flow, removed 47 selfloop flow, removed 6 redundant places. [2025-03-04 02:25:53,512 INFO L231 Difference]: Finished difference. Result has 145 places, 143 transitions, 1253 flow [2025-03-04 02:25:53,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1253, PETRI_PLACES=145, PETRI_TRANSITIONS=143} [2025-03-04 02:25:53,513 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 104 predicate places. [2025-03-04 02:25:53,513 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 143 transitions, 1253 flow [2025-03-04 02:25:53,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:53,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:53,513 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-03-04 02:25:53,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:25:53,513 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-03-04 02:25:53,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:53,514 INFO L85 PathProgramCache]: Analyzing trace with hash -141022006, now seen corresponding path program 13 times [2025-03-04 02:25:53,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:53,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669127815] [2025-03-04 02:25:53,514 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:25:53,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:53,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:25:53,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:25:53,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:53,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:53,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:53,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669127815] [2025-03-04 02:25:53,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669127815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:53,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:53,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:53,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710098690] [2025-03-04 02:25:53,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:53,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:53,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:53,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:53,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:53,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:25:53,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 1253 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:53,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:53,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:25:53,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:54,544 INFO L124 PetriNetUnfolderBase]: 2518/4233 cut-off events. [2025-03-04 02:25:54,544 INFO L125 PetriNetUnfolderBase]: For 33874/33874 co-relation queries the response was YES. [2025-03-04 02:25:54,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18214 conditions, 4233 events. 2518/4233 cut-off events. For 33874/33874 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 25814 event pairs, 841 based on Foata normal form. 1/4133 useless extension candidates. Maximal degree in co-relation 18159. Up to 3332 conditions per place. [2025-03-04 02:25:54,568 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 155 selfloop transitions, 42 changer transitions 3/205 dead transitions. [2025-03-04 02:25:54,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 205 transitions, 2095 flow [2025-03-04 02:25:54,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:25:54,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:25:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2025-03-04 02:25:54,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43506493506493504 [2025-03-04 02:25:54,569 INFO L175 Difference]: Start difference. First operand has 145 places, 143 transitions, 1253 flow. Second operand 11 states and 201 transitions. [2025-03-04 02:25:54,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 205 transitions, 2095 flow [2025-03-04 02:25:54,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 205 transitions, 1987 flow, removed 34 selfloop flow, removed 6 redundant places. [2025-03-04 02:25:54,617 INFO L231 Difference]: Finished difference. Result has 152 places, 150 transitions, 1414 flow [2025-03-04 02:25:54,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1414, PETRI_PLACES=152, PETRI_TRANSITIONS=150} [2025-03-04 02:25:54,618 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 111 predicate places. [2025-03-04 02:25:54,618 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 150 transitions, 1414 flow [2025-03-04 02:25:54,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:54,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:54,618 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-03-04 02:25:54,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 02:25:54,618 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-03-04 02:25:54,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:54,619 INFO L85 PathProgramCache]: Analyzing trace with hash -864560098, now seen corresponding path program 14 times [2025-03-04 02:25:54,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:54,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593780511] [2025-03-04 02:25:54,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:54,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:54,624 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:25:54,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:25:54,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:25:54,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:54,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:54,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593780511] [2025-03-04 02:25:54,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593780511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:54,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:54,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:54,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557559341] [2025-03-04 02:25:54,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:54,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:54,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:54,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:54,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:54,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:25:54,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 150 transitions, 1414 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:54,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:54,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:25:54,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:55,451 INFO L124 PetriNetUnfolderBase]: 2518/4231 cut-off events. [2025-03-04 02:25:55,452 INFO L125 PetriNetUnfolderBase]: For 40310/40310 co-relation queries the response was YES. [2025-03-04 02:25:55,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18890 conditions, 4231 events. 2518/4231 cut-off events. For 40310/40310 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 25718 event pairs, 881 based on Foata normal form. 1/4131 useless extension candidates. Maximal degree in co-relation 18831. Up to 3490 conditions per place. [2025-03-04 02:25:55,480 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 160 selfloop transitions, 37 changer transitions 4/206 dead transitions. [2025-03-04 02:25:55,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 206 transitions, 2143 flow [2025-03-04 02:25:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:25:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:25:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2025-03-04 02:25:55,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4264069264069264 [2025-03-04 02:25:55,481 INFO L175 Difference]: Start difference. First operand has 152 places, 150 transitions, 1414 flow. Second operand 11 states and 197 transitions. [2025-03-04 02:25:55,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 206 transitions, 2143 flow [2025-03-04 02:25:55,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 206 transitions, 1985 flow, removed 59 selfloop flow, removed 6 redundant places. [2025-03-04 02:25:55,531 INFO L231 Difference]: Finished difference. Result has 158 places, 154 transitions, 1383 flow [2025-03-04 02:25:55,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1383, PETRI_PLACES=158, PETRI_TRANSITIONS=154} [2025-03-04 02:25:55,531 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 117 predicate places. [2025-03-04 02:25:55,531 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 154 transitions, 1383 flow [2025-03-04 02:25:55,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:55,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:55,532 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-03-04 02:25:55,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 02:25:55,532 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-03-04 02:25:55,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:55,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1748755234, now seen corresponding path program 15 times [2025-03-04 02:25:55,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:55,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107765182] [2025-03-04 02:25:55,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:25:55,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:55,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:25:55,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:25:55,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:25:55,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:55,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:55,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107765182] [2025-03-04 02:25:55,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107765182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:55,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:55,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:55,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163458750] [2025-03-04 02:25:55,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:55,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:55,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:55,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:55,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:55,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:25:55,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 154 transitions, 1383 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:55,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:55,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:25:55,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:56,395 INFO L124 PetriNetUnfolderBase]: 2554/4298 cut-off events. [2025-03-04 02:25:56,396 INFO L125 PetriNetUnfolderBase]: For 36224/36224 co-relation queries the response was YES. [2025-03-04 02:25:56,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18624 conditions, 4298 events. 2554/4298 cut-off events. For 36224/36224 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 26365 event pairs, 939 based on Foata normal form. 1/4199 useless extension candidates. Maximal degree in co-relation 18562. Up to 3621 conditions per place. [2025-03-04 02:25:56,423 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 158 selfloop transitions, 37 changer transitions 3/203 dead transitions. [2025-03-04 02:25:56,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 203 transitions, 2041 flow [2025-03-04 02:25:56,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:25:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:25:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2025-03-04 02:25:56,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2025-03-04 02:25:56,424 INFO L175 Difference]: Start difference. First operand has 158 places, 154 transitions, 1383 flow. Second operand 11 states and 190 transitions. [2025-03-04 02:25:56,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 203 transitions, 2041 flow [2025-03-04 02:25:56,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 203 transitions, 1935 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-03-04 02:25:56,466 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 1401 flow [2025-03-04 02:25:56,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1401, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2025-03-04 02:25:56,466 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 121 predicate places. [2025-03-04 02:25:56,466 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 1401 flow [2025-03-04 02:25:56,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:56,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:56,466 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-03-04 02:25:56,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 02:25:56,466 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-03-04 02:25:56,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:56,467 INFO L85 PathProgramCache]: Analyzing trace with hash 333650762, now seen corresponding path program 16 times [2025-03-04 02:25:56,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:56,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952762194] [2025-03-04 02:25:56,467 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:25:56,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:56,472 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:25:56,485 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:25:56,485 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:25:56,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:56,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:56,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952762194] [2025-03-04 02:25:56,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952762194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:56,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:56,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:56,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227912689] [2025-03-04 02:25:56,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:56,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:56,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:56,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:56,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 02:25:56,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 1401 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:56,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:56,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 02:25:56,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:57,342 INFO L124 PetriNetUnfolderBase]: 2773/4616 cut-off events. [2025-03-04 02:25:57,342 INFO L125 PetriNetUnfolderBase]: For 39058/39058 co-relation queries the response was YES. [2025-03-04 02:25:57,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19830 conditions, 4616 events. 2773/4616 cut-off events. For 39058/39058 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 28304 event pairs, 958 based on Foata normal form. 1/4504 useless extension candidates. Maximal degree in co-relation 19766. Up to 3645 conditions per place. [2025-03-04 02:25:57,368 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 167 selfloop transitions, 46 changer transitions 5/222 dead transitions. [2025-03-04 02:25:57,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 222 transitions, 2187 flow [2025-03-04 02:25:57,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:25:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:25:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2025-03-04 02:25:57,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43073593073593075 [2025-03-04 02:25:57,369 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 1401 flow. Second operand 11 states and 199 transitions. [2025-03-04 02:25:57,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 222 transitions, 2187 flow [2025-03-04 02:25:57,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 222 transitions, 2083 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-03-04 02:25:57,441 INFO L231 Difference]: Finished difference. Result has 167 places, 163 transitions, 1496 flow [2025-03-04 02:25:57,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1496, PETRI_PLACES=167, PETRI_TRANSITIONS=163} [2025-03-04 02:25:57,441 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 126 predicate places. [2025-03-04 02:25:57,441 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 163 transitions, 1496 flow [2025-03-04 02:25:57,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:57,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:57,441 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-03-04 02:25:57,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 02:25:57,442 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-03-04 02:25:57,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:57,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1609589106, now seen corresponding path program 17 times [2025-03-04 02:25:57,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:57,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457234170] [2025-03-04 02:25:57,442 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:25:57,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:57,447 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:25:57,454 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:25:57,455 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:57,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:57,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:57,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457234170] [2025-03-04 02:25:57,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457234170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:57,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:57,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:57,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308098379] [2025-03-04 02:25:57,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:57,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:57,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:57,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:57,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:57,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:25:57,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 163 transitions, 1496 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:57,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:57,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:25:57,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:58,240 INFO L124 PetriNetUnfolderBase]: 2575/4336 cut-off events. [2025-03-04 02:25:58,241 INFO L125 PetriNetUnfolderBase]: For 38349/38357 co-relation queries the response was YES. [2025-03-04 02:25:58,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19009 conditions, 4336 events. 2575/4336 cut-off events. For 38349/38357 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 26908 event pairs, 937 based on Foata normal form. 9/4241 useless extension candidates. Maximal degree in co-relation 18942. Up to 3667 conditions per place. [2025-03-04 02:25:58,270 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 166 selfloop transitions, 35 changer transitions 3/209 dead transitions. [2025-03-04 02:25:58,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 209 transitions, 2138 flow [2025-03-04 02:25:58,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:25:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:25:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2025-03-04 02:25:58,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-03-04 02:25:58,271 INFO L175 Difference]: Start difference. First operand has 167 places, 163 transitions, 1496 flow. Second operand 11 states and 187 transitions. [2025-03-04 02:25:58,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 209 transitions, 2138 flow [2025-03-04 02:25:58,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 209 transitions, 2011 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-03-04 02:25:58,325 INFO L231 Difference]: Finished difference. Result has 172 places, 165 transitions, 1463 flow [2025-03-04 02:25:58,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1463, PETRI_PLACES=172, PETRI_TRANSITIONS=165} [2025-03-04 02:25:58,325 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 131 predicate places. [2025-03-04 02:25:58,325 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 165 transitions, 1463 flow [2025-03-04 02:25:58,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:58,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:58,326 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-03-04 02:25:58,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 02:25:58,326 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-03-04 02:25:58,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:58,326 INFO L85 PathProgramCache]: Analyzing trace with hash -2079611608, now seen corresponding path program 18 times [2025-03-04 02:25:58,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:58,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213141392] [2025-03-04 02:25:58,326 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:25:58,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:58,332 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:25:58,339 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:25:58,339 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:25:58,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:58,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:58,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213141392] [2025-03-04 02:25:58,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213141392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:58,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:58,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:58,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665819073] [2025-03-04 02:25:58,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:58,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:58,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:58,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:58,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:58,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:25:58,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 165 transitions, 1463 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:58,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:58,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:25:58,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:59,364 INFO L124 PetriNetUnfolderBase]: 2818/4759 cut-off events. [2025-03-04 02:25:59,365 INFO L125 PetriNetUnfolderBase]: For 49296/49320 co-relation queries the response was YES. [2025-03-04 02:25:59,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21668 conditions, 4759 events. 2818/4759 cut-off events. For 49296/49320 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 30417 event pairs, 903 based on Foata normal form. 1/4645 useless extension candidates. Maximal degree in co-relation 21599. Up to 3704 conditions per place. [2025-03-04 02:25:59,393 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 193 selfloop transitions, 44 changer transitions 3/245 dead transitions. [2025-03-04 02:25:59,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 245 transitions, 2590 flow [2025-03-04 02:25:59,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:25:59,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:25:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 223 transitions. [2025-03-04 02:25:59,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44246031746031744 [2025-03-04 02:25:59,394 INFO L175 Difference]: Start difference. First operand has 172 places, 165 transitions, 1463 flow. Second operand 12 states and 223 transitions. [2025-03-04 02:25:59,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 245 transitions, 2590 flow [2025-03-04 02:25:59,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 245 transitions, 2522 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-04 02:25:59,453 INFO L231 Difference]: Finished difference. Result has 179 places, 177 transitions, 1756 flow [2025-03-04 02:25:59,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1395, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1756, PETRI_PLACES=179, PETRI_TRANSITIONS=177} [2025-03-04 02:25:59,453 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 138 predicate places. [2025-03-04 02:25:59,454 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 177 transitions, 1756 flow [2025-03-04 02:25:59,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:59,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:59,454 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-03-04 02:25:59,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 02:25:59,454 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-03-04 02:25:59,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:59,454 INFO L85 PathProgramCache]: Analyzing trace with hash 418359642, now seen corresponding path program 19 times [2025-03-04 02:25:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:59,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299734340] [2025-03-04 02:25:59,454 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:25:59,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:59,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:25:59,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:25:59,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:59,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:25:59,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:59,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299734340] [2025-03-04 02:25:59,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299734340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:59,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:59,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:25:59,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016962060] [2025-03-04 02:25:59,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:59,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:25:59,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:59,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:25:59,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:25:59,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:25:59,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 177 transitions, 1756 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:59,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:59,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:25:59,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:00,490 INFO L124 PetriNetUnfolderBase]: 3013/5090 cut-off events. [2025-03-04 02:26:00,490 INFO L125 PetriNetUnfolderBase]: For 64417/64417 co-relation queries the response was YES. [2025-03-04 02:26:00,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24485 conditions, 5090 events. 3013/5090 cut-off events. For 64417/64417 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 32809 event pairs, 999 based on Foata normal form. 1/4978 useless extension candidates. Maximal degree in co-relation 24412. Up to 3889 conditions per place. [2025-03-04 02:26:00,528 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 191 selfloop transitions, 54 changer transitions 3/253 dead transitions. [2025-03-04 02:26:00,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 253 transitions, 2945 flow [2025-03-04 02:26:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:26:00,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:26:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 222 transitions. [2025-03-04 02:26:00,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2025-03-04 02:26:00,530 INFO L175 Difference]: Start difference. First operand has 179 places, 177 transitions, 1756 flow. Second operand 12 states and 222 transitions. [2025-03-04 02:26:00,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 253 transitions, 2945 flow [2025-03-04 02:26:00,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 253 transitions, 2691 flow, removed 110 selfloop flow, removed 5 redundant places. [2025-03-04 02:26:00,625 INFO L231 Difference]: Finished difference. Result has 189 places, 188 transitions, 1919 flow [2025-03-04 02:26:00,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1530, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1919, PETRI_PLACES=189, PETRI_TRANSITIONS=188} [2025-03-04 02:26:00,625 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 148 predicate places. [2025-03-04 02:26:00,625 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 188 transitions, 1919 flow [2025-03-04 02:26:00,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:00,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:00,625 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-03-04 02:26:00,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 02:26:00,626 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-03-04 02:26:00,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:00,626 INFO L85 PathProgramCache]: Analyzing trace with hash 260109490, now seen corresponding path program 20 times [2025-03-04 02:26:00,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:00,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912949354] [2025-03-04 02:26:00,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:00,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:00,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:00,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:26:00,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:26:00,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:00,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:00,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912949354] [2025-03-04 02:26:00,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912949354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:00,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:00,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:00,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341907536] [2025-03-04 02:26:00,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:00,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:00,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:00,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:00,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:00,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:00,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 188 transitions, 1919 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:00,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:00,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:00,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:01,682 INFO L124 PetriNetUnfolderBase]: 3109/5258 cut-off events. [2025-03-04 02:26:01,682 INFO L125 PetriNetUnfolderBase]: For 76093/76093 co-relation queries the response was YES. [2025-03-04 02:26:01,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25920 conditions, 5258 events. 3109/5258 cut-off events. For 76093/76093 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 34240 event pairs, 1117 based on Foata normal form. 1/5144 useless extension candidates. Maximal degree in co-relation 25842. Up to 4161 conditions per place. [2025-03-04 02:26:01,715 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 200 selfloop transitions, 49 changer transitions 3/257 dead transitions. [2025-03-04 02:26:01,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 257 transitions, 2989 flow [2025-03-04 02:26:01,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:26:01,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:26:01,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 219 transitions. [2025-03-04 02:26:01,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2025-03-04 02:26:01,716 INFO L175 Difference]: Start difference. First operand has 189 places, 188 transitions, 1919 flow. Second operand 12 states and 219 transitions. [2025-03-04 02:26:01,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 257 transitions, 2989 flow [2025-03-04 02:26:01,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 257 transitions, 2782 flow, removed 79 selfloop flow, removed 7 redundant places. [2025-03-04 02:26:01,853 INFO L231 Difference]: Finished difference. Result has 196 places, 194 transitions, 1982 flow [2025-03-04 02:26:01,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1712, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1982, PETRI_PLACES=196, PETRI_TRANSITIONS=194} [2025-03-04 02:26:01,854 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 155 predicate places. [2025-03-04 02:26:01,854 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 194 transitions, 1982 flow [2025-03-04 02:26:01,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:01,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:01,854 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-03-04 02:26:01,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 02:26:01,854 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-03-04 02:26:01,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:01,855 INFO L85 PathProgramCache]: Analyzing trace with hash 933704556, now seen corresponding path program 21 times [2025-03-04 02:26:01,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:01,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832498494] [2025-03-04 02:26:01,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:01,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:01,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:01,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:26:01,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:26:01,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:02,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:02,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832498494] [2025-03-04 02:26:02,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832498494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:02,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:02,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:02,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020263277] [2025-03-04 02:26:02,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:02,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:02,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:02,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:02,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:02,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:02,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 194 transitions, 1982 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:02,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:02,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:02,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:02,784 INFO L124 PetriNetUnfolderBase]: 3109/5266 cut-off events. [2025-03-04 02:26:02,784 INFO L125 PetriNetUnfolderBase]: For 76500/76500 co-relation queries the response was YES. [2025-03-04 02:26:02,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25877 conditions, 5266 events. 3109/5266 cut-off events. For 76500/76500 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 34373 event pairs, 1126 based on Foata normal form. 1/5152 useless extension candidates. Maximal degree in co-relation 25796. Up to 4238 conditions per place. [2025-03-04 02:26:02,828 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 197 selfloop transitions, 51 changer transitions 4/257 dead transitions. [2025-03-04 02:26:02,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 257 transitions, 2926 flow [2025-03-04 02:26:02,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:26:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:26:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 216 transitions. [2025-03-04 02:26:02,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-04 02:26:02,829 INFO L175 Difference]: Start difference. First operand has 196 places, 194 transitions, 1982 flow. Second operand 12 states and 216 transitions. [2025-03-04 02:26:02,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 257 transitions, 2926 flow [2025-03-04 02:26:03,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 257 transitions, 2765 flow, removed 55 selfloop flow, removed 8 redundant places. [2025-03-04 02:26:03,003 INFO L231 Difference]: Finished difference. Result has 201 places, 198 transitions, 2001 flow [2025-03-04 02:26:03,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1821, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2001, PETRI_PLACES=201, PETRI_TRANSITIONS=198} [2025-03-04 02:26:03,003 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 160 predicate places. [2025-03-04 02:26:03,003 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 198 transitions, 2001 flow [2025-03-04 02:26:03,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:03,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:03,004 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-03-04 02:26:03,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 02:26:03,004 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-03-04 02:26:03,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:03,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1722680612, now seen corresponding path program 22 times [2025-03-04 02:26:03,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:03,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232500214] [2025-03-04 02:26:03,004 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:26:03,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:03,009 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:03,016 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:26:03,016 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:26:03,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:03,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:03,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232500214] [2025-03-04 02:26:03,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232500214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:03,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:03,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:03,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550827965] [2025-03-04 02:26:03,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:03,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:03,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:03,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:03,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:03,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 02:26:03,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 198 transitions, 2001 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:03,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:03,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 02:26:03,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:04,142 INFO L124 PetriNetUnfolderBase]: 3456/5796 cut-off events. [2025-03-04 02:26:04,142 INFO L125 PetriNetUnfolderBase]: For 86863/86863 co-relation queries the response was YES. [2025-03-04 02:26:04,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28892 conditions, 5796 events. 3456/5796 cut-off events. For 86863/86863 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 38063 event pairs, 1445 based on Foata normal form. 1/5671 useless extension candidates. Maximal degree in co-relation 28809. Up to 4892 conditions per place. [2025-03-04 02:26:04,179 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 226 selfloop transitions, 38 changer transitions 3/271 dead transitions. [2025-03-04 02:26:04,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 271 transitions, 3322 flow [2025-03-04 02:26:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2025-03-04 02:26:04,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43506493506493504 [2025-03-04 02:26:04,180 INFO L175 Difference]: Start difference. First operand has 201 places, 198 transitions, 2001 flow. Second operand 11 states and 201 transitions. [2025-03-04 02:26:04,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 271 transitions, 3322 flow [2025-03-04 02:26:04,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 271 transitions, 3168 flow, removed 30 selfloop flow, removed 9 redundant places. [2025-03-04 02:26:04,317 INFO L231 Difference]: Finished difference. Result has 207 places, 209 transitions, 2299 flow [2025-03-04 02:26:04,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1853, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2299, PETRI_PLACES=207, PETRI_TRANSITIONS=209} [2025-03-04 02:26:04,318 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 166 predicate places. [2025-03-04 02:26:04,318 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 209 transitions, 2299 flow [2025-03-04 02:26:04,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:04,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:04,318 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-03-04 02:26:04,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 02:26:04,318 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-03-04 02:26:04,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:04,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1731878102, now seen corresponding path program 23 times [2025-03-04 02:26:04,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:04,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85217561] [2025-03-04 02:26:04,319 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:26:04,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:04,324 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:04,330 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:26:04,330 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:04,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:04,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:04,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85217561] [2025-03-04 02:26:04,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85217561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:04,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:04,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:04,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807396515] [2025-03-04 02:26:04,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:04,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:04,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:04,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:04,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:04,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:04,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 209 transitions, 2299 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:04,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:04,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:04,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:05,604 INFO L124 PetriNetUnfolderBase]: 3460/5859 cut-off events. [2025-03-04 02:26:05,604 INFO L125 PetriNetUnfolderBase]: For 114173/114173 co-relation queries the response was YES. [2025-03-04 02:26:05,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31027 conditions, 5859 events. 3460/5859 cut-off events. For 114173/114173 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 39231 event pairs, 1418 based on Foata normal form. 1/5724 useless extension candidates. Maximal degree in co-relation 30939. Up to 4923 conditions per place. [2025-03-04 02:26:05,661 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 232 selfloop transitions, 37 changer transitions 3/277 dead transitions. [2025-03-04 02:26:05,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 277 transitions, 3600 flow [2025-03-04 02:26:05,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:05,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions. [2025-03-04 02:26:05,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4458874458874459 [2025-03-04 02:26:05,662 INFO L175 Difference]: Start difference. First operand has 207 places, 209 transitions, 2299 flow. Second operand 11 states and 206 transitions. [2025-03-04 02:26:05,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 277 transitions, 3600 flow [2025-03-04 02:26:05,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 277 transitions, 3292 flow, removed 138 selfloop flow, removed 4 redundant places. [2025-03-04 02:26:05,855 INFO L231 Difference]: Finished difference. Result has 217 places, 219 transitions, 2396 flow [2025-03-04 02:26:05,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2027, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2396, PETRI_PLACES=217, PETRI_TRANSITIONS=219} [2025-03-04 02:26:05,856 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 176 predicate places. [2025-03-04 02:26:05,856 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 219 transitions, 2396 flow [2025-03-04 02:26:05,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:05,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:05,856 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-03-04 02:26:05,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 02:26:05,856 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:05,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:05,857 INFO L85 PathProgramCache]: Analyzing trace with hash -649156216, now seen corresponding path program 24 times [2025-03-04 02:26:05,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:05,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959469814] [2025-03-04 02:26:05,857 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:26:05,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:05,863 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:05,870 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:26:05,870 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:26:05,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:06,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:06,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959469814] [2025-03-04 02:26:06,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959469814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:06,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:06,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:06,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737804021] [2025-03-04 02:26:06,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:06,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:06,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:06,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:06,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:06,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:06,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 219 transitions, 2396 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:06,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:06,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:06,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:06,908 INFO L124 PetriNetUnfolderBase]: 3521/5967 cut-off events. [2025-03-04 02:26:06,908 INFO L125 PetriNetUnfolderBase]: For 106431/106431 co-relation queries the response was YES. [2025-03-04 02:26:06,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31005 conditions, 5967 events. 3521/5967 cut-off events. For 106431/106431 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 40130 event pairs, 1508 based on Foata normal form. 1/5834 useless extension candidates. Maximal degree in co-relation 30912. Up to 5162 conditions per place. [2025-03-04 02:26:06,958 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 226 selfloop transitions, 36 changer transitions 4/271 dead transitions. [2025-03-04 02:26:06,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 271 transitions, 3380 flow [2025-03-04 02:26:06,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:06,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-04 02:26:06,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2025-03-04 02:26:06,959 INFO L175 Difference]: Start difference. First operand has 217 places, 219 transitions, 2396 flow. Second operand 11 states and 193 transitions. [2025-03-04 02:26:06,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 271 transitions, 3380 flow [2025-03-04 02:26:07,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 271 transitions, 3158 flow, removed 94 selfloop flow, removed 5 redundant places. [2025-03-04 02:26:07,138 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 2393 flow [2025-03-04 02:26:07,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2174, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2393, PETRI_PLACES=225, PETRI_TRANSITIONS=225} [2025-03-04 02:26:07,138 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 184 predicate places. [2025-03-04 02:26:07,138 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 2393 flow [2025-03-04 02:26:07,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:07,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:07,138 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-03-04 02:26:07,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 02:26:07,139 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:07,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:07,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1364878334, now seen corresponding path program 25 times [2025-03-04 02:26:07,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:07,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333806463] [2025-03-04 02:26:07,139 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:26:07,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:07,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:26:07,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:26:07,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:07,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:07,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:07,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:07,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333806463] [2025-03-04 02:26:07,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333806463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:07,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:07,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:07,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066578656] [2025-03-04 02:26:07,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:07,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:07,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:07,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:07,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:07,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:07,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 225 transitions, 2393 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:07,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:07,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:07,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:08,243 INFO L124 PetriNetUnfolderBase]: 3666/6209 cut-off events. [2025-03-04 02:26:08,243 INFO L125 PetriNetUnfolderBase]: For 109407/109407 co-relation queries the response was YES. [2025-03-04 02:26:08,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32039 conditions, 6209 events. 3666/6209 cut-off events. For 109407/109407 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 42145 event pairs, 1516 based on Foata normal form. 1/6078 useless extension candidates. Maximal degree in co-relation 31942. Up to 5186 conditions per place. [2025-03-04 02:26:08,303 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 237 selfloop transitions, 42 changer transitions 3/287 dead transitions. [2025-03-04 02:26:08,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 287 transitions, 3643 flow [2025-03-04 02:26:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2025-03-04 02:26:08,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2025-03-04 02:26:08,304 INFO L175 Difference]: Start difference. First operand has 225 places, 225 transitions, 2393 flow. Second operand 11 states and 204 transitions. [2025-03-04 02:26:08,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 287 transitions, 3643 flow [2025-03-04 02:26:08,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 287 transitions, 3473 flow, removed 65 selfloop flow, removed 6 redundant places. [2025-03-04 02:26:08,476 INFO L231 Difference]: Finished difference. Result has 232 places, 232 transitions, 2594 flow [2025-03-04 02:26:08,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2223, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2594, PETRI_PLACES=232, PETRI_TRANSITIONS=232} [2025-03-04 02:26:08,477 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 191 predicate places. [2025-03-04 02:26:08,477 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 232 transitions, 2594 flow [2025-03-04 02:26:08,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:08,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:08,477 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-03-04 02:26:08,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 02:26:08,477 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:08,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:08,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1518125206, now seen corresponding path program 26 times [2025-03-04 02:26:08,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:08,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282789071] [2025-03-04 02:26:08,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:08,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:08,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:08,487 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:26:08,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:26:08,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:08,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:08,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282789071] [2025-03-04 02:26:08,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282789071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:08,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:08,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:08,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702973537] [2025-03-04 02:26:08,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:08,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:08,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:08,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:08,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:08,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:08,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 232 transitions, 2594 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:08,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:08,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:08,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:09,629 INFO L124 PetriNetUnfolderBase]: 3771/6404 cut-off events. [2025-03-04 02:26:09,630 INFO L125 PetriNetUnfolderBase]: For 134374/134374 co-relation queries the response was YES. [2025-03-04 02:26:09,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34239 conditions, 6404 events. 3771/6404 cut-off events. For 134374/134374 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 43879 event pairs, 1606 based on Foata normal form. 1/6266 useless extension candidates. Maximal degree in co-relation 34138. Up to 5487 conditions per place. [2025-03-04 02:26:09,688 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 252 selfloop transitions, 35 changer transitions 3/295 dead transitions. [2025-03-04 02:26:09,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 295 transitions, 3834 flow [2025-03-04 02:26:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2025-03-04 02:26:09,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-04 02:26:09,689 INFO L175 Difference]: Start difference. First operand has 232 places, 232 transitions, 2594 flow. Second operand 11 states and 203 transitions. [2025-03-04 02:26:09,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 295 transitions, 3834 flow [2025-03-04 02:26:09,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 295 transitions, 3578 flow, removed 108 selfloop flow, removed 6 redundant places. [2025-03-04 02:26:09,951 INFO L231 Difference]: Finished difference. Result has 239 places, 238 transitions, 2609 flow [2025-03-04 02:26:09,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2342, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2609, PETRI_PLACES=239, PETRI_TRANSITIONS=238} [2025-03-04 02:26:09,952 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 198 predicate places. [2025-03-04 02:26:09,952 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 238 transitions, 2609 flow [2025-03-04 02:26:09,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:09,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:09,952 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-03-04 02:26:09,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 02:26:09,952 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:09,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:09,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1937118092, now seen corresponding path program 27 times [2025-03-04 02:26:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:09,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977620529] [2025-03-04 02:26:09,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:09,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:09,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:09,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:26:09,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:26:09,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:10,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:10,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977620529] [2025-03-04 02:26:10,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977620529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:10,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:10,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:10,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904731264] [2025-03-04 02:26:10,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:10,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:10,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:10,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:10,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:10,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 238 transitions, 2609 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:10,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:10,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:10,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:11,272 INFO L124 PetriNetUnfolderBase]: 3771/6398 cut-off events. [2025-03-04 02:26:11,272 INFO L125 PetriNetUnfolderBase]: For 130226/130226 co-relation queries the response was YES. [2025-03-04 02:26:11,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33578 conditions, 6398 events. 3771/6398 cut-off events. For 130226/130226 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 43851 event pairs, 1588 based on Foata normal form. 1/6263 useless extension candidates. Maximal degree in co-relation 33473. Up to 5480 conditions per place. [2025-03-04 02:26:11,338 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 251 selfloop transitions, 37 changer transitions 4/297 dead transitions. [2025-03-04 02:26:11,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 297 transitions, 3733 flow [2025-03-04 02:26:11,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-03-04 02:26:11,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2025-03-04 02:26:11,339 INFO L175 Difference]: Start difference. First operand has 239 places, 238 transitions, 2609 flow. Second operand 11 states and 202 transitions. [2025-03-04 02:26:11,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 297 transitions, 3733 flow [2025-03-04 02:26:11,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 297 transitions, 3542 flow, removed 77 selfloop flow, removed 6 redundant places. [2025-03-04 02:26:11,514 INFO L231 Difference]: Finished difference. Result has 245 places, 242 transitions, 2620 flow [2025-03-04 02:26:11,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2418, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2620, PETRI_PLACES=245, PETRI_TRANSITIONS=242} [2025-03-04 02:26:11,515 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 204 predicate places. [2025-03-04 02:26:11,515 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 242 transitions, 2620 flow [2025-03-04 02:26:11,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:11,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:11,515 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-03-04 02:26:11,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 02:26:11,515 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:11,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:11,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1459118822, now seen corresponding path program 28 times [2025-03-04 02:26:11,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:11,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920541131] [2025-03-04 02:26:11,516 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:26:11,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:11,520 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:11,526 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:26:11,526 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:26:11,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:11,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:11,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920541131] [2025-03-04 02:26:11,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920541131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:11,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:11,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:11,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312306588] [2025-03-04 02:26:11,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:11,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:11,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:11,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:11,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:11,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 02:26:11,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 242 transitions, 2620 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:11,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:11,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 02:26:11,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:12,624 INFO L124 PetriNetUnfolderBase]: 4065/6847 cut-off events. [2025-03-04 02:26:12,624 INFO L125 PetriNetUnfolderBase]: For 151202/151202 co-relation queries the response was YES. [2025-03-04 02:26:12,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36399 conditions, 6847 events. 4065/6847 cut-off events. For 151202/151202 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 46987 event pairs, 1772 based on Foata normal form. 1/6702 useless extension candidates. Maximal degree in co-relation 36291. Up to 5889 conditions per place. [2025-03-04 02:26:12,691 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 263 selfloop transitions, 36 changer transitions 3/306 dead transitions. [2025-03-04 02:26:12,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 306 transitions, 3923 flow [2025-03-04 02:26:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2025-03-04 02:26:12,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42207792207792205 [2025-03-04 02:26:12,692 INFO L175 Difference]: Start difference. First operand has 245 places, 242 transitions, 2620 flow. Second operand 11 states and 195 transitions. [2025-03-04 02:26:12,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 306 transitions, 3923 flow [2025-03-04 02:26:12,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 306 transitions, 3788 flow, removed 47 selfloop flow, removed 7 redundant places. [2025-03-04 02:26:12,924 INFO L231 Difference]: Finished difference. Result has 251 places, 248 transitions, 2770 flow [2025-03-04 02:26:12,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2485, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2770, PETRI_PLACES=251, PETRI_TRANSITIONS=248} [2025-03-04 02:26:12,924 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 210 predicate places. [2025-03-04 02:26:12,924 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 248 transitions, 2770 flow [2025-03-04 02:26:12,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:12,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:12,924 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-03-04 02:26:12,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 02:26:12,924 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:12,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:12,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1487542224, now seen corresponding path program 29 times [2025-03-04 02:26:12,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:12,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77589026] [2025-03-04 02:26:12,925 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:26:12,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:12,929 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:12,936 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:26:12,936 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:12,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:13,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:13,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77589026] [2025-03-04 02:26:13,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77589026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:13,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:13,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:13,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22029279] [2025-03-04 02:26:13,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:13,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:13,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:13,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:13,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:13,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:13,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 248 transitions, 2770 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:13,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:13,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:13,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:14,000 INFO L124 PetriNetUnfolderBase]: 3867/6578 cut-off events. [2025-03-04 02:26:14,000 INFO L125 PetriNetUnfolderBase]: For 145586/145586 co-relation queries the response was YES. [2025-03-04 02:26:14,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34994 conditions, 6578 events. 3867/6578 cut-off events. For 145586/145586 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 45608 event pairs, 1683 based on Foata normal form. 1/6439 useless extension candidates. Maximal degree in co-relation 34882. Up to 5685 conditions per place. [2025-03-04 02:26:14,067 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 258 selfloop transitions, 37 changer transitions 4/304 dead transitions. [2025-03-04 02:26:14,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 304 transitions, 3875 flow [2025-03-04 02:26:14,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:14,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2025-03-04 02:26:14,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4329004329004329 [2025-03-04 02:26:14,068 INFO L175 Difference]: Start difference. First operand has 251 places, 248 transitions, 2770 flow. Second operand 11 states and 200 transitions. [2025-03-04 02:26:14,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 304 transitions, 3875 flow [2025-03-04 02:26:14,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 304 transitions, 3667 flow, removed 85 selfloop flow, removed 6 redundant places. [2025-03-04 02:26:14,299 INFO L231 Difference]: Finished difference. Result has 257 places, 252 transitions, 2711 flow [2025-03-04 02:26:14,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2562, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2711, PETRI_PLACES=257, PETRI_TRANSITIONS=252} [2025-03-04 02:26:14,299 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 216 predicate places. [2025-03-04 02:26:14,300 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 252 transitions, 2711 flow [2025-03-04 02:26:14,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:14,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:14,300 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-03-04 02:26:14,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 02:26:14,300 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:14,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash -890205566, now seen corresponding path program 30 times [2025-03-04 02:26:14,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:14,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615524343] [2025-03-04 02:26:14,301 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:26:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:14,308 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:14,313 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:26:14,313 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:26:14,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:14,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:14,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615524343] [2025-03-04 02:26:14,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615524343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:14,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:14,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:14,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24393491] [2025-03-04 02:26:14,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:14,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:14,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:14,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:14,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:14,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:14,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 252 transitions, 2711 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:14,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:14,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:14,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:15,478 INFO L124 PetriNetUnfolderBase]: 3867/6576 cut-off events. [2025-03-04 02:26:15,478 INFO L125 PetriNetUnfolderBase]: For 136536/136536 co-relation queries the response was YES. [2025-03-04 02:26:15,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34465 conditions, 6576 events. 3867/6576 cut-off events. For 136536/136536 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 45555 event pairs, 1679 based on Foata normal form. 1/6437 useless extension candidates. Maximal degree in co-relation 34350. Up to 5681 conditions per place. [2025-03-04 02:26:15,550 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 256 selfloop transitions, 41 changer transitions 4/306 dead transitions. [2025-03-04 02:26:15,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 306 transitions, 3760 flow [2025-03-04 02:26:15,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2025-03-04 02:26:15,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43073593073593075 [2025-03-04 02:26:15,551 INFO L175 Difference]: Start difference. First operand has 257 places, 252 transitions, 2711 flow. Second operand 11 states and 199 transitions. [2025-03-04 02:26:15,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 306 transitions, 3760 flow [2025-03-04 02:26:15,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 306 transitions, 3624 flow, removed 33 selfloop flow, removed 8 redundant places. [2025-03-04 02:26:15,752 INFO L231 Difference]: Finished difference. Result has 261 places, 256 transitions, 2743 flow [2025-03-04 02:26:15,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2575, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2743, PETRI_PLACES=261, PETRI_TRANSITIONS=256} [2025-03-04 02:26:15,752 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 220 predicate places. [2025-03-04 02:26:15,752 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 256 transitions, 2743 flow [2025-03-04 02:26:15,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:15,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:15,753 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-03-04 02:26:15,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 02:26:15,753 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:15,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:15,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1322355734, now seen corresponding path program 31 times [2025-03-04 02:26:15,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:15,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697226770] [2025-03-04 02:26:15,753 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:26:15,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:15,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:26:15,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:26:15,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:15,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:16,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:16,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697226770] [2025-03-04 02:26:16,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697226770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:16,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:16,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:16,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534511035] [2025-03-04 02:26:16,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:16,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:16,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:16,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:16,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:16,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:16,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 256 transitions, 2743 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:16,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:16,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:16,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:16,935 INFO L124 PetriNetUnfolderBase]: 3903/6655 cut-off events. [2025-03-04 02:26:16,935 INFO L125 PetriNetUnfolderBase]: For 135846/135870 co-relation queries the response was YES. [2025-03-04 02:26:16,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34532 conditions, 6655 events. 3903/6655 cut-off events. For 135846/135870 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 46655 event pairs, 1709 based on Foata normal form. 3/6509 useless extension candidates. Maximal degree in co-relation 34415. Up to 5815 conditions per place. [2025-03-04 02:26:17,000 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 260 selfloop transitions, 37 changer transitions 3/305 dead transitions. [2025-03-04 02:26:17,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 305 transitions, 3763 flow [2025-03-04 02:26:17,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-04 02:26:17,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2025-03-04 02:26:17,001 INFO L175 Difference]: Start difference. First operand has 261 places, 256 transitions, 2743 flow. Second operand 11 states and 193 transitions. [2025-03-04 02:26:17,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 305 transitions, 3763 flow [2025-03-04 02:26:17,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 305 transitions, 3609 flow, removed 38 selfloop flow, removed 8 redundant places. [2025-03-04 02:26:17,199 INFO L231 Difference]: Finished difference. Result has 265 places, 259 transitions, 2737 flow [2025-03-04 02:26:17,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2589, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2737, PETRI_PLACES=265, PETRI_TRANSITIONS=259} [2025-03-04 02:26:17,200 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 224 predicate places. [2025-03-04 02:26:17,200 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 259 transitions, 2737 flow [2025-03-04 02:26:17,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:17,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:17,200 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-03-04 02:26:17,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 02:26:17,200 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:17,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:17,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1769076882, now seen corresponding path program 32 times [2025-03-04 02:26:17,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:17,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371051219] [2025-03-04 02:26:17,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:17,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:17,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:17,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:26:17,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:26:17,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:17,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:17,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371051219] [2025-03-04 02:26:17,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371051219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:17,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:17,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:17,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037370447] [2025-03-04 02:26:17,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:17,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:17,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:17,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:17,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:17,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:17,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 259 transitions, 2737 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:17,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:17,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:17,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:18,366 INFO L124 PetriNetUnfolderBase]: 3903/6651 cut-off events. [2025-03-04 02:26:18,367 INFO L125 PetriNetUnfolderBase]: For 133012/133012 co-relation queries the response was YES. [2025-03-04 02:26:18,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34256 conditions, 6651 events. 3903/6651 cut-off events. For 133012/133012 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 46331 event pairs, 1748 based on Foata normal form. 1/6508 useless extension candidates. Maximal degree in co-relation 34137. Up to 5828 conditions per place. [2025-03-04 02:26:18,430 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 262 selfloop transitions, 35 changer transitions 3/305 dead transitions. [2025-03-04 02:26:18,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 305 transitions, 3707 flow [2025-03-04 02:26:18,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2025-03-04 02:26:18,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2025-03-04 02:26:18,431 INFO L175 Difference]: Start difference. First operand has 265 places, 259 transitions, 2737 flow. Second operand 11 states and 190 transitions. [2025-03-04 02:26:18,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 305 transitions, 3707 flow [2025-03-04 02:26:18,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 305 transitions, 3567 flow, removed 34 selfloop flow, removed 8 redundant places. [2025-03-04 02:26:18,635 INFO L231 Difference]: Finished difference. Result has 269 places, 261 transitions, 2693 flow [2025-03-04 02:26:18,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2599, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2693, PETRI_PLACES=269, PETRI_TRANSITIONS=261} [2025-03-04 02:26:18,635 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 228 predicate places. [2025-03-04 02:26:18,635 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 261 transitions, 2693 flow [2025-03-04 02:26:18,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:18,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:18,635 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-03-04 02:26:18,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 02:26:18,636 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:18,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:18,636 INFO L85 PathProgramCache]: Analyzing trace with hash -868718146, now seen corresponding path program 33 times [2025-03-04 02:26:18,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:18,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016461498] [2025-03-04 02:26:18,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:18,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:18,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:18,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:26:18,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:26:18,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:18,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:18,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016461498] [2025-03-04 02:26:18,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016461498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:18,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:18,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:18,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836553759] [2025-03-04 02:26:18,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:18,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:18,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:18,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:18,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:18,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:18,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 261 transitions, 2693 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:18,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:18,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:18,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:19,954 INFO L124 PetriNetUnfolderBase]: 4034/6874 cut-off events. [2025-03-04 02:26:19,955 INFO L125 PetriNetUnfolderBase]: For 150077/150077 co-relation queries the response was YES. [2025-03-04 02:26:20,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36239 conditions, 6874 events. 4034/6874 cut-off events. For 150077/150077 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 48340 event pairs, 1786 based on Foata normal form. 1/6723 useless extension candidates. Maximal degree in co-relation 36118. Up to 5941 conditions per place. [2025-03-04 02:26:20,030 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 278 selfloop transitions, 35 changer transitions 3/321 dead transitions. [2025-03-04 02:26:20,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 321 transitions, 4206 flow [2025-03-04 02:26:20,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2025-03-04 02:26:20,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4329004329004329 [2025-03-04 02:26:20,031 INFO L175 Difference]: Start difference. First operand has 269 places, 261 transitions, 2693 flow. Second operand 11 states and 200 transitions. [2025-03-04 02:26:20,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 321 transitions, 4206 flow [2025-03-04 02:26:20,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 321 transitions, 4138 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-04 02:26:20,257 INFO L231 Difference]: Finished difference. Result has 275 places, 270 transitions, 3126 flow [2025-03-04 02:26:20,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2625, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3126, PETRI_PLACES=275, PETRI_TRANSITIONS=270} [2025-03-04 02:26:20,258 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 234 predicate places. [2025-03-04 02:26:20,258 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 270 transitions, 3126 flow [2025-03-04 02:26:20,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:20,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:20,258 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-03-04 02:26:20,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 02:26:20,258 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:20,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash -274081964, now seen corresponding path program 34 times [2025-03-04 02:26:20,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:20,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977577074] [2025-03-04 02:26:20,259 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:26:20,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:20,263 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:20,269 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:26:20,270 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:26:20,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:20,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:20,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977577074] [2025-03-04 02:26:20,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977577074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:20,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:20,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:20,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370930001] [2025-03-04 02:26:20,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:20,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:20,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:20,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:20,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:20,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 02:26:20,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 270 transitions, 3126 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:20,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:20,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 02:26:20,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:21,586 INFO L124 PetriNetUnfolderBase]: 4444/7529 cut-off events. [2025-03-04 02:26:21,586 INFO L125 PetriNetUnfolderBase]: For 215986/215986 co-relation queries the response was YES. [2025-03-04 02:26:21,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42230 conditions, 7529 events. 4444/7529 cut-off events. For 215986/215986 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 52878 event pairs, 1933 based on Foata normal form. 1/7355 useless extension candidates. Maximal degree in co-relation 42105. Up to 6372 conditions per place. [2025-03-04 02:26:21,656 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 305 selfloop transitions, 39 changer transitions 3/351 dead transitions. [2025-03-04 02:26:21,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 351 transitions, 4900 flow [2025-03-04 02:26:21,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:21,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2025-03-04 02:26:21,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45670995670995673 [2025-03-04 02:26:21,657 INFO L175 Difference]: Start difference. First operand has 275 places, 270 transitions, 3126 flow. Second operand 11 states and 211 transitions. [2025-03-04 02:26:21,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 351 transitions, 4900 flow [2025-03-04 02:26:21,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 351 transitions, 4550 flow, removed 159 selfloop flow, removed 5 redundant places. [2025-03-04 02:26:21,990 INFO L231 Difference]: Finished difference. Result has 285 places, 282 transitions, 3344 flow [2025-03-04 02:26:21,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2776, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3344, PETRI_PLACES=285, PETRI_TRANSITIONS=282} [2025-03-04 02:26:21,990 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 244 predicate places. [2025-03-04 02:26:21,990 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 282 transitions, 3344 flow [2025-03-04 02:26:21,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:21,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:21,990 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-03-04 02:26:21,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 02:26:21,991 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:21,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:21,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1639851014, now seen corresponding path program 35 times [2025-03-04 02:26:21,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:21,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174974952] [2025-03-04 02:26:21,991 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:26:21,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:21,995 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:22,001 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:26:22,001 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:22,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:22,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:22,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174974952] [2025-03-04 02:26:22,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174974952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:22,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:22,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:22,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226785774] [2025-03-04 02:26:22,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:22,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:22,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:22,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:22,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:22,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:22,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 282 transitions, 3344 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:22,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:22,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:22,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:23,318 INFO L124 PetriNetUnfolderBase]: 4307/7357 cut-off events. [2025-03-04 02:26:23,318 INFO L125 PetriNetUnfolderBase]: For 212964/212964 co-relation queries the response was YES. [2025-03-04 02:26:23,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41110 conditions, 7357 events. 4307/7357 cut-off events. For 212964/212964 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 52416 event pairs, 1958 based on Foata normal form. 1/7190 useless extension candidates. Maximal degree in co-relation 40979. Up to 6457 conditions per place. [2025-03-04 02:26:23,387 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 287 selfloop transitions, 35 changer transitions 4/331 dead transitions. [2025-03-04 02:26:23,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 331 transitions, 4502 flow [2025-03-04 02:26:23,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2025-03-04 02:26:23,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4155844155844156 [2025-03-04 02:26:23,388 INFO L175 Difference]: Start difference. First operand has 285 places, 282 transitions, 3344 flow. Second operand 11 states and 192 transitions. [2025-03-04 02:26:23,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 331 transitions, 4502 flow [2025-03-04 02:26:23,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 331 transitions, 4162 flow, removed 155 selfloop flow, removed 4 redundant places. [2025-03-04 02:26:23,811 INFO L231 Difference]: Finished difference. Result has 294 places, 288 transitions, 3267 flow [2025-03-04 02:26:23,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3004, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3267, PETRI_PLACES=294, PETRI_TRANSITIONS=288} [2025-03-04 02:26:23,811 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 253 predicate places. [2025-03-04 02:26:23,811 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 288 transitions, 3267 flow [2025-03-04 02:26:23,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:23,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:23,811 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-03-04 02:26:23,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 02:26:23,811 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:23,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:23,812 INFO L85 PathProgramCache]: Analyzing trace with hash 924128896, now seen corresponding path program 36 times [2025-03-04 02:26:23,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:23,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680144215] [2025-03-04 02:26:23,812 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:26:23,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:23,816 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:23,821 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:26:23,821 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:26:23,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:24,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:24,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680144215] [2025-03-04 02:26:24,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680144215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:24,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:24,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:24,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012755967] [2025-03-04 02:26:24,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:24,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:24,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:24,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:24,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:24,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:24,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 288 transitions, 3267 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:24,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:24,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:24,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:25,206 INFO L124 PetriNetUnfolderBase]: 4458/7601 cut-off events. [2025-03-04 02:26:25,206 INFO L125 PetriNetUnfolderBase]: For 214604/214604 co-relation queries the response was YES. [2025-03-04 02:26:25,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41989 conditions, 7601 events. 4458/7601 cut-off events. For 214604/214604 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 54521 event pairs, 1990 based on Foata normal form. 1/7438 useless extension candidates. Maximal degree in co-relation 41854. Up to 6481 conditions per place. [2025-03-04 02:26:25,289 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 298 selfloop transitions, 41 changer transitions 3/347 dead transitions. [2025-03-04 02:26:25,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 347 transitions, 4783 flow [2025-03-04 02:26:25,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2025-03-04 02:26:25,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-04 02:26:25,290 INFO L175 Difference]: Start difference. First operand has 294 places, 288 transitions, 3267 flow. Second operand 11 states and 203 transitions. [2025-03-04 02:26:25,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 347 transitions, 4783 flow [2025-03-04 02:26:25,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 347 transitions, 4557 flow, removed 94 selfloop flow, removed 6 redundant places. [2025-03-04 02:26:25,656 INFO L231 Difference]: Finished difference. Result has 301 places, 295 transitions, 3506 flow [2025-03-04 02:26:25,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3041, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3506, PETRI_PLACES=301, PETRI_TRANSITIONS=295} [2025-03-04 02:26:25,657 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 260 predicate places. [2025-03-04 02:26:25,657 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 295 transitions, 3506 flow [2025-03-04 02:26:25,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:25,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:25,657 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-03-04 02:26:25,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 02:26:25,657 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:25,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:25,658 INFO L85 PathProgramCache]: Analyzing trace with hash 770882024, now seen corresponding path program 37 times [2025-03-04 02:26:25,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:25,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252507924] [2025-03-04 02:26:25,658 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:26:25,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:25,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:26:25,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:26:25,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:25,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:25,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:25,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:25,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252507924] [2025-03-04 02:26:25,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252507924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:25,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:25,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:25,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679722322] [2025-03-04 02:26:25,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:25,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:25,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:25,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:25,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:25,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:25,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 295 transitions, 3506 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:25,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:25,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:25,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:27,292 INFO L124 PetriNetUnfolderBase]: 4521/7716 cut-off events. [2025-03-04 02:26:27,292 INFO L125 PetriNetUnfolderBase]: For 247531/247531 co-relation queries the response was YES. [2025-03-04 02:26:27,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43816 conditions, 7716 events. 4521/7716 cut-off events. For 247531/247531 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 55506 event pairs, 2072 based on Foata normal form. 1/7552 useless extension candidates. Maximal degree in co-relation 43677. Up to 6714 conditions per place. [2025-03-04 02:26:27,391 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 312 selfloop transitions, 34 changer transitions 3/354 dead transitions. [2025-03-04 02:26:27,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 354 transitions, 4963 flow [2025-03-04 02:26:27,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:27,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-03-04 02:26:27,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2025-03-04 02:26:27,393 INFO L175 Difference]: Start difference. First operand has 301 places, 295 transitions, 3506 flow. Second operand 11 states and 202 transitions. [2025-03-04 02:26:27,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 354 transitions, 4963 flow [2025-03-04 02:26:27,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 354 transitions, 4625 flow, removed 150 selfloop flow, removed 6 redundant places. [2025-03-04 02:26:27,951 INFO L231 Difference]: Finished difference. Result has 308 places, 300 transitions, 3490 flow [2025-03-04 02:26:27,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3172, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3490, PETRI_PLACES=308, PETRI_TRANSITIONS=300} [2025-03-04 02:26:27,952 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 267 predicate places. [2025-03-04 02:26:27,952 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 300 transitions, 3490 flow [2025-03-04 02:26:27,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:27,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:27,952 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-03-04 02:26:27,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-04 02:26:27,952 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:27,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:27,952 INFO L85 PathProgramCache]: Analyzing trace with hash 47756430, now seen corresponding path program 38 times [2025-03-04 02:26:27,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:27,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190306099] [2025-03-04 02:26:27,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:27,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:27,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:27,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:26:27,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:26:27,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:28,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:28,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190306099] [2025-03-04 02:26:28,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190306099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:28,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:28,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:28,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140840500] [2025-03-04 02:26:28,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:28,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:28,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:28,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:28,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:28,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:28,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 300 transitions, 3490 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:28,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:28,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:28,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:29,325 INFO L124 PetriNetUnfolderBase]: 4521/7708 cut-off events. [2025-03-04 02:26:29,326 INFO L125 PetriNetUnfolderBase]: For 235268/235268 co-relation queries the response was YES. [2025-03-04 02:26:29,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42641 conditions, 7708 events. 4521/7708 cut-off events. For 235268/235268 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 55429 event pairs, 2096 based on Foata normal form. 1/7548 useless extension candidates. Maximal degree in co-relation 42498. Up to 6791 conditions per place. [2025-03-04 02:26:29,404 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 308 selfloop transitions, 33 changer transitions 3/349 dead transitions. [2025-03-04 02:26:29,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 349 transitions, 4681 flow [2025-03-04 02:26:29,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-04 02:26:29,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2025-03-04 02:26:29,405 INFO L175 Difference]: Start difference. First operand has 308 places, 300 transitions, 3490 flow. Second operand 11 states and 193 transitions. [2025-03-04 02:26:29,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 349 transitions, 4681 flow [2025-03-04 02:26:29,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 349 transitions, 4428 flow, removed 109 selfloop flow, removed 6 redundant places. [2025-03-04 02:26:29,986 INFO L231 Difference]: Finished difference. Result has 314 places, 303 transitions, 3388 flow [2025-03-04 02:26:29,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3237, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3388, PETRI_PLACES=314, PETRI_TRANSITIONS=303} [2025-03-04 02:26:29,987 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 273 predicate places. [2025-03-04 02:26:29,987 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 303 transitions, 3388 flow [2025-03-04 02:26:29,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:29,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:29,987 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-03-04 02:26:29,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-04 02:26:29,987 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:29,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:29,988 INFO L85 PathProgramCache]: Analyzing trace with hash -546841244, now seen corresponding path program 39 times [2025-03-04 02:26:29,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:29,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858736629] [2025-03-04 02:26:29,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:29,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:29,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:29,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:26:29,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:26:29,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:30,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:30,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:30,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858736629] [2025-03-04 02:26:30,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858736629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:30,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:30,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:30,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672045732] [2025-03-04 02:26:30,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:30,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:30,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:30,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:30,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:30,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:30,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 303 transitions, 3388 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:30,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:30,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:30,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:31,484 INFO L124 PetriNetUnfolderBase]: 4584/7824 cut-off events. [2025-03-04 02:26:31,484 INFO L125 PetriNetUnfolderBase]: For 237976/237976 co-relation queries the response was YES. [2025-03-04 02:26:31,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43157 conditions, 7824 events. 4584/7824 cut-off events. For 237976/237976 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 56416 event pairs, 2142 based on Foata normal form. 1/7661 useless extension candidates. Maximal degree in co-relation 43011. Up to 6806 conditions per place. [2025-03-04 02:26:31,559 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 318 selfloop transitions, 35 changer transitions 3/361 dead transitions. [2025-03-04 02:26:31,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 361 transitions, 4876 flow [2025-03-04 02:26:31,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-03-04 02:26:31,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2025-03-04 02:26:31,560 INFO L175 Difference]: Start difference. First operand has 314 places, 303 transitions, 3388 flow. Second operand 11 states and 202 transitions. [2025-03-04 02:26:31,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 361 transitions, 4876 flow [2025-03-04 02:26:32,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 361 transitions, 4750 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-03-04 02:26:32,117 INFO L231 Difference]: Finished difference. Result has 319 places, 308 transitions, 3594 flow [2025-03-04 02:26:32,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3262, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3594, PETRI_PLACES=319, PETRI_TRANSITIONS=308} [2025-03-04 02:26:32,118 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 278 predicate places. [2025-03-04 02:26:32,118 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 308 transitions, 3594 flow [2025-03-04 02:26:32,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:32,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:32,118 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-03-04 02:26:32,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-04 02:26:32,119 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:32,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:32,119 INFO L85 PathProgramCache]: Analyzing trace with hash 801465006, now seen corresponding path program 40 times [2025-03-04 02:26:32,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:32,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149098815] [2025-03-04 02:26:32,120 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:26:32,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:32,127 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:32,133 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:26:32,134 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:26:32,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:32,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:32,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149098815] [2025-03-04 02:26:32,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149098815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:32,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:32,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:32,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152015446] [2025-03-04 02:26:32,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:32,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:32,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:32,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:32,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:32,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 02:26:32,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 308 transitions, 3594 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:32,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:32,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 02:26:32,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:33,816 INFO L124 PetriNetUnfolderBase]: 4811/8169 cut-off events. [2025-03-04 02:26:33,816 INFO L125 PetriNetUnfolderBase]: For 265836/265836 co-relation queries the response was YES. [2025-03-04 02:26:33,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45512 conditions, 8169 events. 4811/8169 cut-off events. For 265836/265836 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 58573 event pairs, 2207 based on Foata normal form. 1/7999 useless extension candidates. Maximal degree in co-relation 45363. Up to 6966 conditions per place. [2025-03-04 02:26:33,899 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 328 selfloop transitions, 41 changer transitions 5/378 dead transitions. [2025-03-04 02:26:33,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 378 transitions, 5041 flow [2025-03-04 02:26:33,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2025-03-04 02:26:33,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-03-04 02:26:33,900 INFO L175 Difference]: Start difference. First operand has 319 places, 308 transitions, 3594 flow. Second operand 11 states and 209 transitions. [2025-03-04 02:26:33,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 378 transitions, 5041 flow [2025-03-04 02:26:34,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 378 transitions, 4777 flow, removed 116 selfloop flow, removed 5 redundant places. [2025-03-04 02:26:34,462 INFO L231 Difference]: Finished difference. Result has 327 places, 313 transitions, 3561 flow [2025-03-04 02:26:34,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3330, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3561, PETRI_PLACES=327, PETRI_TRANSITIONS=313} [2025-03-04 02:26:34,463 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 286 predicate places. [2025-03-04 02:26:34,463 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 313 transitions, 3561 flow [2025-03-04 02:26:34,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:34,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:34,463 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-03-04 02:26:34,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-04 02:26:34,463 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:34,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:34,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1398801664, now seen corresponding path program 41 times [2025-03-04 02:26:34,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:34,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735165532] [2025-03-04 02:26:34,464 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:26:34,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:34,468 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:34,474 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:26:34,474 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:34,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:34,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:34,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735165532] [2025-03-04 02:26:34,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735165532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:34,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:34,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:34,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338876126] [2025-03-04 02:26:34,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:34,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:34,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:34,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:34,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:34,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:34,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 313 transitions, 3561 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:34,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:34,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:34,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:35,792 INFO L124 PetriNetUnfolderBase]: 4613/7895 cut-off events. [2025-03-04 02:26:35,792 INFO L125 PetriNetUnfolderBase]: For 236449/236449 co-relation queries the response was YES. [2025-03-04 02:26:35,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43117 conditions, 7895 events. 4613/7895 cut-off events. For 236449/236449 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 57090 event pairs, 2158 based on Foata normal form. 1/7726 useless extension candidates. Maximal degree in co-relation 42964. Up to 6897 conditions per place. [2025-03-04 02:26:35,890 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 315 selfloop transitions, 40 changer transitions 4/364 dead transitions. [2025-03-04 02:26:35,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 364 transitions, 4738 flow [2025-03-04 02:26:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:35,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2025-03-04 02:26:35,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-04 02:26:35,891 INFO L175 Difference]: Start difference. First operand has 327 places, 313 transitions, 3561 flow. Second operand 11 states and 198 transitions. [2025-03-04 02:26:35,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 364 transitions, 4738 flow [2025-03-04 02:26:36,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 364 transitions, 4539 flow, removed 67 selfloop flow, removed 6 redundant places. [2025-03-04 02:26:36,576 INFO L231 Difference]: Finished difference. Result has 333 places, 317 transitions, 3548 flow [2025-03-04 02:26:36,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3362, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3548, PETRI_PLACES=333, PETRI_TRANSITIONS=317} [2025-03-04 02:26:36,577 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 292 predicate places. [2025-03-04 02:26:36,577 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 317 transitions, 3548 flow [2025-03-04 02:26:36,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:36,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:36,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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:36,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-04 02:26:36,577 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:36,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:36,578 INFO L85 PathProgramCache]: Analyzing trace with hash -683604332, now seen corresponding path program 42 times [2025-03-04 02:26:36,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:36,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427864267] [2025-03-04 02:26:36,578 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:26:36,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:36,584 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:36,590 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 02:26:36,590 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:26:36,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:36,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:36,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427864267] [2025-03-04 02:26:36,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427864267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:36,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:36,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:36,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731928131] [2025-03-04 02:26:36,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:36,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:36,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:36,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:36,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:36,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:36,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 317 transitions, 3548 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:36,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:36,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:36,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:38,367 INFO L124 PetriNetUnfolderBase]: 4649/7962 cut-off events. [2025-03-04 02:26:38,367 INFO L125 PetriNetUnfolderBase]: For 231510/231510 co-relation queries the response was YES. [2025-03-04 02:26:38,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42922 conditions, 7962 events. 4649/7962 cut-off events. For 231510/231510 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 57730 event pairs, 2220 based on Foata normal form. 1/7794 useless extension candidates. Maximal degree in co-relation 42767. Up to 7031 conditions per place. [2025-03-04 02:26:38,472 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 319 selfloop transitions, 36 changer transitions 3/363 dead transitions. [2025-03-04 02:26:38,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 363 transitions, 4696 flow [2025-03-04 02:26:38,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2025-03-04 02:26:38,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4155844155844156 [2025-03-04 02:26:38,473 INFO L175 Difference]: Start difference. First operand has 333 places, 317 transitions, 3548 flow. Second operand 11 states and 192 transitions. [2025-03-04 02:26:38,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 363 transitions, 4696 flow [2025-03-04 02:26:39,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 363 transitions, 4512 flow, removed 54 selfloop flow, removed 8 redundant places. [2025-03-04 02:26:39,113 INFO L231 Difference]: Finished difference. Result has 337 places, 320 transitions, 3530 flow [2025-03-04 02:26:39,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3364, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3530, PETRI_PLACES=337, PETRI_TRANSITIONS=320} [2025-03-04 02:26:39,113 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 296 predicate places. [2025-03-04 02:26:39,113 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 320 transitions, 3530 flow [2025-03-04 02:26:39,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:39,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:39,114 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-03-04 02:26:39,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-04 02:26:39,114 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:39,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:39,114 INFO L85 PathProgramCache]: Analyzing trace with hash 519930348, now seen corresponding path program 43 times [2025-03-04 02:26:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:39,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379341504] [2025-03-04 02:26:39,114 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:26:39,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:39,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:26:39,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:26:39,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:39,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:39,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:39,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379341504] [2025-03-04 02:26:39,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379341504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:39,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:39,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:26:39,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439746072] [2025-03-04 02:26:39,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:39,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:26:39,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:39,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:26:39,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:26:39,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:26:39,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 320 transitions, 3530 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:39,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:39,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:26:39,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:40,607 INFO L124 PetriNetUnfolderBase]: 4649/7970 cut-off events. [2025-03-04 02:26:40,607 INFO L125 PetriNetUnfolderBase]: For 225962/225962 co-relation queries the response was YES. [2025-03-04 02:26:40,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42517 conditions, 7970 events. 4649/7970 cut-off events. For 225962/225962 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 57814 event pairs, 2227 based on Foata normal form. 1/7797 useless extension candidates. Maximal degree in co-relation 42360. Up to 7044 conditions per place. [2025-03-04 02:26:40,700 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 321 selfloop transitions, 34 changer transitions 3/363 dead transitions. [2025-03-04 02:26:40,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 363 transitions, 4608 flow [2025-03-04 02:26:40,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2025-03-04 02:26:40,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-04 02:26:40,701 INFO L175 Difference]: Start difference. First operand has 337 places, 320 transitions, 3530 flow. Second operand 11 states and 189 transitions. [2025-03-04 02:26:40,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 363 transitions, 4608 flow [2025-03-04 02:26:41,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 363 transitions, 4438 flow, removed 50 selfloop flow, removed 8 redundant places. [2025-03-04 02:26:41,167 INFO L231 Difference]: Finished difference. Result has 341 places, 322 transitions, 3454 flow [2025-03-04 02:26:41,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3362, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3454, PETRI_PLACES=341, PETRI_TRANSITIONS=322} [2025-03-04 02:26:41,167 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 300 predicate places. [2025-03-04 02:26:41,167 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 322 transitions, 3454 flow [2025-03-04 02:26:41,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:41,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:41,168 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, 1, 1, 1] [2025-03-04 02:26:41,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-04 02:26:41,168 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:41,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:41,168 INFO L85 PathProgramCache]: Analyzing trace with hash 916041962, now seen corresponding path program 1 times [2025-03-04 02:26:41,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:41,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164923263] [2025-03-04 02:26:41,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:26:41,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:41,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 02:26:41,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:26:41,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:41,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:41,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:41,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164923263] [2025-03-04 02:26:41,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164923263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:41,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463504457] [2025-03-04 02:26:41,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:26:41,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:41,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:41,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:41,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:26:41,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 02:26:41,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:26:41,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:41,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:41,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:26:41,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:41,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:41,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463504457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:41,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:41,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 02:26:41,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671499279] [2025-03-04 02:26:41,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:41,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:26:41,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:41,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:26:41,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:26:41,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-04 02:26:41,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 322 transitions, 3454 flow. Second operand has 12 states, 12 states have (on average 13.833333333333334) internal successors, (166), 12 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:41,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:41,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-04 02:26:41,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:43,618 INFO L124 PetriNetUnfolderBase]: 7869/14162 cut-off events. [2025-03-04 02:26:43,619 INFO L125 PetriNetUnfolderBase]: For 489458/489754 co-relation queries the response was YES. [2025-03-04 02:26:43,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77591 conditions, 14162 events. 7869/14162 cut-off events. For 489458/489754 co-relation queries the response was YES. Maximal size of possible extension queue 1252. Compared 119582 event pairs, 4766 based on Foata normal form. 292/14013 useless extension candidates. Maximal degree in co-relation 77432. Up to 6403 conditions per place. [2025-03-04 02:26:43,846 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 543 selfloop transitions, 5 changer transitions 12/604 dead transitions. [2025-03-04 02:26:43,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 604 transitions, 7698 flow [2025-03-04 02:26:43,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:26:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:26:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2025-03-04 02:26:43,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2025-03-04 02:26:43,847 INFO L175 Difference]: Start difference. First operand has 341 places, 322 transitions, 3454 flow. Second operand 6 states and 124 transitions. [2025-03-04 02:26:43,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 604 transitions, 7698 flow [2025-03-04 02:26:44,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 604 transitions, 7566 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-03-04 02:26:44,615 INFO L231 Difference]: Finished difference. Result has 341 places, 325 transitions, 3430 flow [2025-03-04 02:26:44,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3388, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3430, PETRI_PLACES=341, PETRI_TRANSITIONS=325} [2025-03-04 02:26:44,615 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 300 predicate places. [2025-03-04 02:26:44,615 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 325 transitions, 3430 flow [2025-03-04 02:26:44,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.833333333333334) internal successors, (166), 12 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:44,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:44,616 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:44,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:26:44,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-03-04 02:26:44,816 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:44,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:44,817 INFO L85 PathProgramCache]: Analyzing trace with hash 874807726, now seen corresponding path program 1 times [2025-03-04 02:26:44,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:44,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763573805] [2025-03-04 02:26:44,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:26:44,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:44,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 02:26:44,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:26:44,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:44,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:44,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:44,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763573805] [2025-03-04 02:26:44,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763573805] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:44,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137768564] [2025-03-04 02:26:44,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:26:44,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:44,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:44,899 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:44,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:26:44,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 02:26:44,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:26:44,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:44,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:44,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:26:44,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:45,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:45,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137768564] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:45,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:45,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-03-04 02:26:45,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543253786] [2025-03-04 02:26:45,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:45,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:26:45,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:45,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:26:45,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:26:45,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-04 02:26:45,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 325 transitions, 3430 flow. Second operand has 13 states, 13 states have (on average 12.461538461538462) internal successors, (162), 13 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:45,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:45,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-04 02:26:45,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:49,697 INFO L124 PetriNetUnfolderBase]: 12652/24218 cut-off events. [2025-03-04 02:26:49,698 INFO L125 PetriNetUnfolderBase]: For 909331/909641 co-relation queries the response was YES. [2025-03-04 02:26:50,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129721 conditions, 24218 events. 12652/24218 cut-off events. For 909331/909641 co-relation queries the response was YES. Maximal size of possible extension queue 2171. Compared 238082 event pairs, 5048 based on Foata normal form. 1706/25151 useless extension candidates. Maximal degree in co-relation 129559. Up to 10926 conditions per place. [2025-03-04 02:26:50,143 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 488 selfloop transitions, 9 changer transitions 51/592 dead transitions. [2025-03-04 02:26:50,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 592 transitions, 8028 flow [2025-03-04 02:26:50,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:26:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:26:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2025-03-04 02:26:50,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49702380952380953 [2025-03-04 02:26:50,144 INFO L175 Difference]: Start difference. First operand has 341 places, 325 transitions, 3430 flow. Second operand 8 states and 167 transitions. [2025-03-04 02:26:50,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 592 transitions, 8028 flow [2025-03-04 02:26:51,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 592 transitions, 7996 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-03-04 02:26:51,425 INFO L231 Difference]: Finished difference. Result has 348 places, 329 transitions, 3627 flow [2025-03-04 02:26:51,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3415, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3627, PETRI_PLACES=348, PETRI_TRANSITIONS=329} [2025-03-04 02:26:51,425 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 307 predicate places. [2025-03-04 02:26:51,425 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 329 transitions, 3627 flow [2025-03-04 02:26:51,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.461538461538462) internal successors, (162), 13 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:51,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:51,426 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:51,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:26:51,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-04 02:26:51,626 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:51,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:51,627 INFO L85 PathProgramCache]: Analyzing trace with hash -964197066, now seen corresponding path program 1 times [2025-03-04 02:26:51,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:51,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406217217] [2025-03-04 02:26:51,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:26:51,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:51,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 02:26:51,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 02:26:51,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:51,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:51,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:51,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406217217] [2025-03-04 02:26:51,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406217217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:51,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255792636] [2025-03-04 02:26:51,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:26:51,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:51,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:51,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:51,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:26:51,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 02:26:51,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 02:26:51,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:51,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:51,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:26:51,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:51,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:51,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:51,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255792636] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:51,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:51,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-04 02:26:51,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377582515] [2025-03-04 02:26:51,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:51,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:26:51,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:51,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:26:51,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:26:51,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-04 02:26:51,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 329 transitions, 3627 flow. Second operand has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:51,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:51,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-04 02:26:51,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:55,517 INFO L124 PetriNetUnfolderBase]: 9550/18958 cut-off events. [2025-03-04 02:26:55,517 INFO L125 PetriNetUnfolderBase]: For 695804/695952 co-relation queries the response was YES. [2025-03-04 02:26:55,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104080 conditions, 18958 events. 9550/18958 cut-off events. For 695804/695952 co-relation queries the response was YES. Maximal size of possible extension queue 1663. Compared 185604 event pairs, 4869 based on Foata normal form. 889/19167 useless extension candidates. Maximal degree in co-relation 103916. Up to 11266 conditions per place. [2025-03-04 02:26:55,776 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 434 selfloop transitions, 8 changer transitions 28/514 dead transitions. [2025-03-04 02:26:55,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 514 transitions, 6856 flow [2025-03-04 02:26:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:26:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:26:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2025-03-04 02:26:55,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-03-04 02:26:55,776 INFO L175 Difference]: Start difference. First operand has 348 places, 329 transitions, 3627 flow. Second operand 8 states and 154 transitions. [2025-03-04 02:26:55,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 514 transitions, 6856 flow [2025-03-04 02:26:57,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 514 transitions, 6602 flow, removed 121 selfloop flow, removed 4 redundant places. [2025-03-04 02:26:57,042 INFO L231 Difference]: Finished difference. Result has 353 places, 330 transitions, 3524 flow [2025-03-04 02:26:57,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3497, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3524, PETRI_PLACES=353, PETRI_TRANSITIONS=330} [2025-03-04 02:26:57,043 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 312 predicate places. [2025-03-04 02:26:57,043 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 330 transitions, 3524 flow [2025-03-04 02:26:57,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:57,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:57,043 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:57,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:26:57,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:57,244 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:26:57,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:57,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1117771289, now seen corresponding path program 2 times [2025-03-04 02:26:57,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:57,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667241304] [2025-03-04 02:26:57,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:57,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:57,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 02:26:57,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 02:26:57,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:57,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:57,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:26:57,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:57,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667241304] [2025-03-04 02:26:57,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667241304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:57,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:57,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:26:57,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068255772] [2025-03-04 02:26:57,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:57,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:26:57,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:57,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:26:57,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:26:57,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-04 02:26:57,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 330 transitions, 3524 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:57,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:57,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-04 02:26:57,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:00,975 INFO L124 PetriNetUnfolderBase]: 10758/21303 cut-off events. [2025-03-04 02:27:00,976 INFO L125 PetriNetUnfolderBase]: For 704871/706325 co-relation queries the response was YES. [2025-03-04 02:27:01,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114258 conditions, 21303 events. 10758/21303 cut-off events. For 704871/706325 co-relation queries the response was YES. Maximal size of possible extension queue 1748. Compared 209947 event pairs, 5217 based on Foata normal form. 712/21255 useless extension candidates. Maximal degree in co-relation 114093. Up to 11351 conditions per place. [2025-03-04 02:27:01,263 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 429 selfloop transitions, 36 changer transitions 3/512 dead transitions. [2025-03-04 02:27:01,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 512 transitions, 6706 flow [2025-03-04 02:27:01,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:27:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:27:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-04 02:27:01,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-03-04 02:27:01,264 INFO L175 Difference]: Start difference. First operand has 353 places, 330 transitions, 3524 flow. Second operand 4 states and 106 transitions. [2025-03-04 02:27:01,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 512 transitions, 6706 flow