./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 f8ab0bd5 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-?-f8ab0bd-m [2025-03-13 21:49:19,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:49:19,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:49:19,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:49:19,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:49:19,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:49:19,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:49:19,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:49:19,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:49:19,324 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:49:19,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:49:19,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:49:19,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:49:19,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:49:19,325 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:49:19,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:49:19,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:49:19,326 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:49:19,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:49:19,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:49:19,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:49:19,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:49:19,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:49:19,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:49:19,326 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:49:19,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:49:19,326 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:49:19,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:49:19,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:49:19,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:49:19,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:49:19,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:49:19,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:49:19,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:49:19,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:49:19,328 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:49:19,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:49:19,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:49:19,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:49:19,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:49:19,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:49:19,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:49:19,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:49:19,328 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-13 21:49:19,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:49:19,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:49:19,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:49:19,541 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:49:19,541 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:49:19,541 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-13 21:49:20,672 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01297671e/670c3e77c5d148d79bf1075dbcb3b726/FLAG33cb613df [2025-03-13 21:49:20,935 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:49:20,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-03-13 21:49:20,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01297671e/670c3e77c5d148d79bf1075dbcb3b726/FLAG33cb613df [2025-03-13 21:49:20,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01297671e/670c3e77c5d148d79bf1075dbcb3b726 [2025-03-13 21:49:20,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:49:20,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:49:20,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:49:20,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:49:20,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:49:20,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:49:20" (1/1) ... [2025-03-13 21:49:20,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405d5fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:20, skipping insertion in model container [2025-03-13 21:49:20,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:49:20" (1/1) ... [2025-03-13 21:49:20,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:49:21,138 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-13 21:49:21,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:49:21,159 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:49:21,181 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-13 21:49:21,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:49:21,203 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:49:21,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:21 WrapperNode [2025-03-13 21:49:21,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:49:21,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:49:21,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:49:21,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:49:21,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:21" (1/1) ... [2025-03-13 21:49:21,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:21" (1/1) ... [2025-03-13 21:49:21,231 INFO L138 Inliner]: procedures = 25, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 237 [2025-03-13 21:49:21,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:49:21,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:49:21,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:49:21,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:49:21,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:21" (1/1) ... [2025-03-13 21:49:21,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:21" (1/1) ... [2025-03-13 21:49:21,239 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:21" (1/1) ... [2025-03-13 21:49:21,251 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-13 21:49:21,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:21" (1/1) ... [2025-03-13 21:49:21,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:21" (1/1) ... [2025-03-13 21:49:21,259 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:21" (1/1) ... [2025-03-13 21:49:21,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:21" (1/1) ... [2025-03-13 21:49:21,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:21" (1/1) ... [2025-03-13 21:49:21,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:21" (1/1) ... [2025-03-13 21:49:21,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:49:21,267 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:49:21,267 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:49:21,268 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:49:21,268 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:21" (1/1) ... [2025-03-13 21:49:21,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:49:21,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:21,293 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-13 21:49:21,295 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-13 21:49:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:49:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:49:21,312 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:49:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:49:21,312 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:49:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:49:21,312 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:49:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:49:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:49:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:49:21,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:49:21,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:49:21,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:49:21,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:49:21,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:49:21,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:49:21,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:49:21,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:49:21,314 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:49:21,405 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:49:21,407 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:49:21,707 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:49:21,707 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:49:21,708 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:49:22,061 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:49:22,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:49:22 BoogieIcfgContainer [2025-03-13 21:49:22,061 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:49:22,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:49:22,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:49:22,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:49:22,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:49:20" (1/3) ... [2025-03-13 21:49:22,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58852212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:49:22, skipping insertion in model container [2025-03-13 21:49:22,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:21" (2/3) ... [2025-03-13 21:49:22,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58852212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:49:22, skipping insertion in model container [2025-03-13 21:49:22,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:49:22" (3/3) ... [2025-03-13 21:49:22,069 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2025-03-13 21:49:22,080 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:49:22,082 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-13 21:49:22,083 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:49:22,126 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:49:22,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 42 transitions, 105 flow [2025-03-13 21:49:22,179 INFO L124 PetriNetUnfolderBase]: 7/39 cut-off events. [2025-03-13 21:49:22,182 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:49:22,184 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-13 21:49:22,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 42 transitions, 105 flow [2025-03-13 21:49:22,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 38 transitions, 94 flow [2025-03-13 21:49:22,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:49:22,207 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;@2be1c393, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:49:22,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:49:22,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:49:22,223 INFO L124 PetriNetUnfolderBase]: 7/37 cut-off events. [2025-03-13 21:49:22,224 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:49:22,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:22,224 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-13 21:49:22,225 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-13 21:49:22,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:22,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1624782182, now seen corresponding path program 1 times [2025-03-13 21:49:22,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:22,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573984156] [2025-03-13 21:49:22,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:22,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:22,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:49:22,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:49:22,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:22,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:22,409 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-13 21:49:22,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:22,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573984156] [2025-03-13 21:49:22,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573984156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:22,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:22,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:49:22,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634864401] [2025-03-13 21:49:22,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:22,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:49:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:22,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:49:22,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:49:22,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-13 21:49:22,443 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-13 21:49:22,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:22,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-13 21:49:22,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:22,694 INFO L124 PetriNetUnfolderBase]: 1088/1694 cut-off events. [2025-03-13 21:49:22,694 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-13 21:49:22,701 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-13 21:49:22,713 INFO L140 encePairwiseOnDemand]: 40/42 looper letters, 30 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2025-03-13 21:49:22,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 150 flow [2025-03-13 21:49:22,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:49:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:49:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2025-03-13 21:49:22,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-03-13 21:49:22,725 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 94 flow. Second operand 2 states and 50 transitions. [2025-03-13 21:49:22,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 150 flow [2025-03-13 21:49:22,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 138 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 21:49:22,733 INFO L231 Difference]: Finished difference. Result has 36 places, 36 transitions, 78 flow [2025-03-13 21:49:22,735 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-13 21:49:22,739 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2025-03-13 21:49:22,739 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 78 flow [2025-03-13 21:49:22,739 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-13 21:49:22,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:22,739 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-13 21:49:22,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:49:22,740 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-13 21:49:22,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:22,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1086528074, now seen corresponding path program 1 times [2025-03-13 21:49:22,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:22,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699789365] [2025-03-13 21:49:22,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:22,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:22,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:49:22,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:49:22,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:22,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:23,022 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-13 21:49:23,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:23,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699789365] [2025-03-13 21:49:23,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699789365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:23,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:23,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:49:23,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174614417] [2025-03-13 21:49:23,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:23,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:49:23,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:23,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:49:23,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:49:23,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-13 21:49:23,025 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-13 21:49:23,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:23,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-13 21:49:23,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:23,266 INFO L124 PetriNetUnfolderBase]: 1209/1910 cut-off events. [2025-03-13 21:49:23,266 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 21:49:23,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3609 conditions, 1910 events. 1209/1910 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8587 event pairs, 999 based on Foata normal form. 87/1847 useless extension candidates. Maximal degree in co-relation 3606. Up to 1453 conditions per place. [2025-03-13 21:49:23,278 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 29 selfloop transitions, 2 changer transitions 18/55 dead transitions. [2025-03-13 21:49:23,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 217 flow [2025-03-13 21:49:23,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:49:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:49:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-03-13 21:49:23,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2025-03-13 21:49:23,281 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 78 flow. Second operand 5 states and 97 transitions. [2025-03-13 21:49:23,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 217 flow [2025-03-13 21:49:23,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 217 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:49:23,284 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 100 flow [2025-03-13 21:49:23,284 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=5, PETRI_FLOW=100, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2025-03-13 21:49:23,284 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2025-03-13 21:49:23,284 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 100 flow [2025-03-13 21:49:23,284 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-13 21:49:23,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:23,284 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-13 21:49:23,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:49:23,285 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-13 21:49:23,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:23,285 INFO L85 PathProgramCache]: Analyzing trace with hash 737147797, now seen corresponding path program 1 times [2025-03-13 21:49:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:23,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184708545] [2025-03-13 21:49:23,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:23,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:23,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:49:23,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:49:23,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:23,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:23,462 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-13 21:49:23,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:23,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184708545] [2025-03-13 21:49:23,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184708545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:23,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:23,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:49:23,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848040225] [2025-03-13 21:49:23,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:23,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:49:23,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:23,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:49:23,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:49:23,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-13 21:49:23,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 100 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-13 21:49:23,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:23,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-13 21:49:23,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:23,653 INFO L124 PetriNetUnfolderBase]: 1288/2024 cut-off events. [2025-03-13 21:49:23,653 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2025-03-13 21:49:23,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4192 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 9201 event pairs, 1072 based on Foata normal form. 77/1964 useless extension candidates. Maximal degree in co-relation 4185. Up to 1454 conditions per place. [2025-03-13 21:49:23,663 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 30 selfloop transitions, 2 changer transitions 17/55 dead transitions. [2025-03-13 21:49:23,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 248 flow [2025-03-13 21:49:23,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:49:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:49:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-03-13 21:49:23,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2025-03-13 21:49:23,665 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 100 flow. Second operand 4 states and 86 transitions. [2025-03-13 21:49:23,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 248 flow [2025-03-13 21:49:23,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 236 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-13 21:49:23,667 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 108 flow [2025-03-13 21:49:23,667 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-13 21:49:23,668 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2025-03-13 21:49:23,668 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 108 flow [2025-03-13 21:49:23,668 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-13 21:49:23,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:23,668 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-13 21:49:23,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:49:23,668 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-13 21:49:23,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:23,669 INFO L85 PathProgramCache]: Analyzing trace with hash 855943922, now seen corresponding path program 1 times [2025-03-13 21:49:23,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:23,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860127587] [2025-03-13 21:49:23,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:23,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:23,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:49:23,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:49:23,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:23,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:24,806 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-13 21:49:24,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:24,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860127587] [2025-03-13 21:49:24,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860127587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:24,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:24,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:24,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980485049] [2025-03-13 21:49:24,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:24,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:24,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:24,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:24,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:24,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:24,847 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-13 21:49:24,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:24,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:24,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:25,436 INFO L124 PetriNetUnfolderBase]: 1957/3008 cut-off events. [2025-03-13 21:49:25,436 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2025-03-13 21:49:25,442 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 14646 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-13 21:49:25,453 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 102 selfloop transitions, 27 changer transitions 3/137 dead transitions. [2025-03-13 21:49:25,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 137 transitions, 645 flow [2025-03-13 21:49:25,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:49:25,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:49:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 227 transitions. [2025-03-13 21:49:25,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4503968253968254 [2025-03-13 21:49:25,455 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 108 flow. Second operand 12 states and 227 transitions. [2025-03-13 21:49:25,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 137 transitions, 645 flow [2025-03-13 21:49:25,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 137 transitions, 641 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:49:25,457 INFO L231 Difference]: Finished difference. Result has 59 places, 63 transitions, 256 flow [2025-03-13 21:49:25,457 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-13 21:49:25,458 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2025-03-13 21:49:25,458 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 256 flow [2025-03-13 21:49:25,458 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-13 21:49:25,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:25,458 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-13 21:49:25,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:49:25,458 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-13 21:49:25,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:25,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1633324682, now seen corresponding path program 2 times [2025-03-13 21:49:25,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:25,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705596206] [2025-03-13 21:49:25,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:25,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:25,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:25,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:49:25,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:49:25,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:25,522 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-13 21:49:25,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:25,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705596206] [2025-03-13 21:49:25,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705596206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:25,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:25,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:49:25,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620420096] [2025-03-13 21:49:25,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:25,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:49:25,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:25,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:49:25,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:49:25,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-13 21:49:25,524 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-13 21:49:25,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:25,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-13 21:49:25,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:25,712 INFO L124 PetriNetUnfolderBase]: 1549/2450 cut-off events. [2025-03-13 21:49:25,712 INFO L125 PetriNetUnfolderBase]: For 1602/1623 co-relation queries the response was YES. [2025-03-13 21:49:25,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6658 conditions, 2450 events. 1549/2450 cut-off events. For 1602/1623 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11678 event pairs, 395 based on Foata normal form. 47/2430 useless extension candidates. Maximal degree in co-relation 6644. Up to 1926 conditions per place. [2025-03-13 21:49:25,727 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 69 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2025-03-13 21:49:25,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 458 flow [2025-03-13 21:49:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:49:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:49:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-13 21:49:25,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2025-03-13 21:49:25,730 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 256 flow. Second operand 3 states and 71 transitions. [2025-03-13 21:49:25,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 458 flow [2025-03-13 21:49:25,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 79 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:49:25,737 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 272 flow [2025-03-13 21:49:25,737 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-13 21:49:25,739 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2025-03-13 21:49:25,739 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 272 flow [2025-03-13 21:49:25,739 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-13 21:49:25,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:25,739 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-13 21:49:25,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:49:25,740 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-13 21:49:25,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:25,740 INFO L85 PathProgramCache]: Analyzing trace with hash -514924666, now seen corresponding path program 3 times [2025-03-13 21:49:25,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:25,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615536868] [2025-03-13 21:49:25,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:25,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:25,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:25,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:49:25,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:49:25,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:25,798 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-13 21:49:25,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:25,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615536868] [2025-03-13 21:49:25,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615536868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:25,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:25,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:49:25,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142553604] [2025-03-13 21:49:25,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:25,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:49:25,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:25,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:49:25,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:49:25,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-13 21:49:25,800 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-13 21:49:25,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:25,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-13 21:49:25,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:25,955 INFO L124 PetriNetUnfolderBase]: 1191/1960 cut-off events. [2025-03-13 21:49:25,956 INFO L125 PetriNetUnfolderBase]: For 1930/1931 co-relation queries the response was YES. [2025-03-13 21:49:25,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5676 conditions, 1960 events. 1191/1960 cut-off events. For 1930/1931 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9314 event pairs, 430 based on Foata normal form. 86/1995 useless extension candidates. Maximal degree in co-relation 5660. Up to 1183 conditions per place. [2025-03-13 21:49:25,968 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 70 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2025-03-13 21:49:25,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 482 flow [2025-03-13 21:49:25,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:49:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:49:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-13 21:49:25,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-13 21:49:25,970 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 272 flow. Second operand 3 states and 70 transitions. [2025-03-13 21:49:25,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 482 flow [2025-03-13 21:49:25,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 459 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-13 21:49:25,975 INFO L231 Difference]: Finished difference. Result has 60 places, 63 transitions, 260 flow [2025-03-13 21:49:25,975 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-13 21:49:25,975 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2025-03-13 21:49:25,975 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 63 transitions, 260 flow [2025-03-13 21:49:25,975 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-13 21:49:25,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:25,975 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-13 21:49:25,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:49:25,976 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-13 21:49:25,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:25,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1795163178, now seen corresponding path program 4 times [2025-03-13 21:49:25,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:25,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505847857] [2025-03-13 21:49:25,976 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:25,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:25,987 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:26,024 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:49:26,024 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:26,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:26,521 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-13 21:49:26,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:26,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505847857] [2025-03-13 21:49:26,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505847857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:26,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:26,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:26,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354971958] [2025-03-13 21:49:26,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:26,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:26,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:26,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:26,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:26,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-13 21:49:26,548 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-13 21:49:26,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:26,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-13 21:49:26,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:27,038 INFO L124 PetriNetUnfolderBase]: 1610/2584 cut-off events. [2025-03-13 21:49:27,039 INFO L125 PetriNetUnfolderBase]: For 1962/1962 co-relation queries the response was YES. [2025-03-13 21:49:27,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7299 conditions, 2584 events. 1610/2584 cut-off events. For 1962/1962 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12919 event pairs, 350 based on Foata normal form. 1/2518 useless extension candidates. Maximal degree in co-relation 7284. Up to 1964 conditions per place. [2025-03-13 21:49:27,053 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 95 selfloop transitions, 28 changer transitions 3/130 dead transitions. [2025-03-13 21:49:27,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 130 transitions, 782 flow [2025-03-13 21:49:27,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:27,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions. [2025-03-13 21:49:27,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4025974025974026 [2025-03-13 21:49:27,055 INFO L175 Difference]: Start difference. First operand has 60 places, 63 transitions, 260 flow. Second operand 11 states and 186 transitions. [2025-03-13 21:49:27,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 130 transitions, 782 flow [2025-03-13 21:49:27,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 130 transitions, 763 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:49:27,060 INFO L231 Difference]: Finished difference. Result has 73 places, 78 transitions, 418 flow [2025-03-13 21:49:27,060 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=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=418, PETRI_PLACES=73, PETRI_TRANSITIONS=78} [2025-03-13 21:49:27,061 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2025-03-13 21:49:27,061 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 78 transitions, 418 flow [2025-03-13 21:49:27,061 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-13 21:49:27,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:27,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:27,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:49:27,061 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-13 21:49:27,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:27,062 INFO L85 PathProgramCache]: Analyzing trace with hash -936356474, now seen corresponding path program 5 times [2025-03-13 21:49:27,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:27,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348367115] [2025-03-13 21:49:27,062 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:27,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:27,074 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:27,095 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:49:27,095 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:27,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:27,680 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-13 21:49:27,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:27,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348367115] [2025-03-13 21:49:27,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348367115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:27,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:27,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:27,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150518250] [2025-03-13 21:49:27,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:27,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:27,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:27,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:27,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:27,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:27,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 78 transitions, 418 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-13 21:49:27,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:27,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:27,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:28,131 INFO L124 PetriNetUnfolderBase]: 1516/2485 cut-off events. [2025-03-13 21:49:28,132 INFO L125 PetriNetUnfolderBase]: For 3117/3117 co-relation queries the response was YES. [2025-03-13 21:49:28,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7583 conditions, 2485 events. 1516/2485 cut-off events. For 3117/3117 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 12543 event pairs, 391 based on Foata normal form. 1/2421 useless extension candidates. Maximal degree in co-relation 7564. Up to 1821 conditions per place. [2025-03-13 21:49:28,144 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 104 selfloop transitions, 34 changer transitions 3/146 dead transitions. [2025-03-13 21:49:28,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 146 transitions, 1004 flow [2025-03-13 21:49:28,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-03-13 21:49:28,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2025-03-13 21:49:28,146 INFO L175 Difference]: Start difference. First operand has 73 places, 78 transitions, 418 flow. Second operand 11 states and 202 transitions. [2025-03-13 21:49:28,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 146 transitions, 1004 flow [2025-03-13 21:49:28,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 146 transitions, 971 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-13 21:49:28,151 INFO L231 Difference]: Finished difference. Result has 88 places, 92 transitions, 615 flow [2025-03-13 21:49:28,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=615, PETRI_PLACES=88, PETRI_TRANSITIONS=92} [2025-03-13 21:49:28,152 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2025-03-13 21:49:28,153 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 92 transitions, 615 flow [2025-03-13 21:49:28,154 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-13 21:49:28,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:28,154 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-13 21:49:28,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:49:28,154 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-13 21:49:28,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:28,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1734295744, now seen corresponding path program 6 times [2025-03-13 21:49:28,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:28,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586298756] [2025-03-13 21:49:28,154 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:28,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:28,170 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:28,191 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:49:28,192 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:49:28,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:28,649 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-13 21:49:28,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:28,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586298756] [2025-03-13 21:49:28,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586298756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:28,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:28,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:28,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538229955] [2025-03-13 21:49:28,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:28,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:28,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:28,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:28,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:28,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:28,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 92 transitions, 615 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-13 21:49:28,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:28,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:28,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:29,210 INFO L124 PetriNetUnfolderBase]: 1683/2795 cut-off events. [2025-03-13 21:49:29,210 INFO L125 PetriNetUnfolderBase]: For 6169/6169 co-relation queries the response was YES. [2025-03-13 21:49:29,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9448 conditions, 2795 events. 1683/2795 cut-off events. For 6169/6169 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14920 event pairs, 305 based on Foata normal form. 1/2713 useless extension candidates. Maximal degree in co-relation 9421. Up to 1830 conditions per place. [2025-03-13 21:49:29,225 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 118 selfloop transitions, 45 changer transitions 3/171 dead transitions. [2025-03-13 21:49:29,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 171 transitions, 1292 flow [2025-03-13 21:49:29,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:49:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:49:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions. [2025-03-13 21:49:29,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2025-03-13 21:49:29,227 INFO L175 Difference]: Start difference. First operand has 88 places, 92 transitions, 615 flow. Second operand 12 states and 225 transitions. [2025-03-13 21:49:29,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 171 transitions, 1292 flow [2025-03-13 21:49:29,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 171 transitions, 1260 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-03-13 21:49:29,239 INFO L231 Difference]: Finished difference. Result has 101 places, 101 transitions, 772 flow [2025-03-13 21:49:29,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=772, PETRI_PLACES=101, PETRI_TRANSITIONS=101} [2025-03-13 21:49:29,240 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2025-03-13 21:49:29,240 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 101 transitions, 772 flow [2025-03-13 21:49:29,240 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-13 21:49:29,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:29,240 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-13 21:49:29,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:49:29,241 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-13 21:49:29,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:29,242 INFO L85 PathProgramCache]: Analyzing trace with hash -28524596, now seen corresponding path program 7 times [2025-03-13 21:49:29,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:29,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067488186] [2025-03-13 21:49:29,242 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:49:29,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:29,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:49:29,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:49:29,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:29,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:29,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-13 21:49:29,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:29,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067488186] [2025-03-13 21:49:29,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067488186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:29,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:29,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:29,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885003132] [2025-03-13 21:49:29,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:29,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:29,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:29,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:29,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:29,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:29,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 101 transitions, 772 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-13 21:49:29,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:29,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:29,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:30,220 INFO L124 PetriNetUnfolderBase]: 1787/2998 cut-off events. [2025-03-13 21:49:30,220 INFO L125 PetriNetUnfolderBase]: For 9036/9036 co-relation queries the response was YES. [2025-03-13 21:49:30,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10795 conditions, 2998 events. 1787/2998 cut-off events. For 9036/9036 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 16563 event pairs, 403 based on Foata normal form. 1/2911 useless extension candidates. Maximal degree in co-relation 10764. Up to 2167 conditions per place. [2025-03-13 21:49:30,237 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 125 selfloop transitions, 41 changer transitions 3/174 dead transitions. [2025-03-13 21:49:30,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 174 transitions, 1453 flow [2025-03-13 21:49:30,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:49:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:49:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 221 transitions. [2025-03-13 21:49:30,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4384920634920635 [2025-03-13 21:49:30,240 INFO L175 Difference]: Start difference. First operand has 101 places, 101 transitions, 772 flow. Second operand 12 states and 221 transitions. [2025-03-13 21:49:30,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 174 transitions, 1453 flow [2025-03-13 21:49:30,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 174 transitions, 1362 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-03-13 21:49:30,253 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 854 flow [2025-03-13 21:49:30,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=854, PETRI_PLACES=109, PETRI_TRANSITIONS=107} [2025-03-13 21:49:30,253 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2025-03-13 21:49:30,253 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 854 flow [2025-03-13 21:49:30,254 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-13 21:49:30,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:30,254 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-13 21:49:30,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:49:30,254 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-13 21:49:30,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:30,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1954244786, now seen corresponding path program 8 times [2025-03-13 21:49:30,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:30,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500196489] [2025-03-13 21:49:30,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:30,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:30,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:30,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:49:30,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:49:30,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:30,672 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-13 21:49:30,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:30,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500196489] [2025-03-13 21:49:30,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500196489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:30,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:30,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:30,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134437417] [2025-03-13 21:49:30,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:30,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:30,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:30,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:30,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:30,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:30,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 854 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-13 21:49:30,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:30,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:30,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:31,244 INFO L124 PetriNetUnfolderBase]: 1787/2996 cut-off events. [2025-03-13 21:49:31,245 INFO L125 PetriNetUnfolderBase]: For 10890/10890 co-relation queries the response was YES. [2025-03-13 21:49:31,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11130 conditions, 2996 events. 1787/2996 cut-off events. For 10890/10890 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 16521 event pairs, 423 based on Foata normal form. 1/2909 useless extension candidates. Maximal degree in co-relation 11095. Up to 2251 conditions per place. [2025-03-13 21:49:31,261 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 121 selfloop transitions, 40 changer transitions 3/169 dead transitions. [2025-03-13 21:49:31,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 169 transitions, 1472 flow [2025-03-13 21:49:31,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:49:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:49:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 212 transitions. [2025-03-13 21:49:31,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2025-03-13 21:49:31,264 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 854 flow. Second operand 12 states and 212 transitions. [2025-03-13 21:49:31,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 169 transitions, 1472 flow [2025-03-13 21:49:31,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 169 transitions, 1361 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-03-13 21:49:31,276 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 874 flow [2025-03-13 21:49:31,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=874, PETRI_PLACES=115, PETRI_TRANSITIONS=110} [2025-03-13 21:49:31,277 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2025-03-13 21:49:31,277 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 874 flow [2025-03-13 21:49:31,277 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-13 21:49:31,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:31,278 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-13 21:49:31,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:49:31,278 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-13 21:49:31,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:31,278 INFO L85 PathProgramCache]: Analyzing trace with hash -498824284, now seen corresponding path program 9 times [2025-03-13 21:49:31,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:31,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401677193] [2025-03-13 21:49:31,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:31,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:31,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:31,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:49:31,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:49:31,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:31,739 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-13 21:49:31,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:31,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401677193] [2025-03-13 21:49:31,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401677193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:31,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:31,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:31,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715751816] [2025-03-13 21:49:31,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:31,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:31,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:31,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:31,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:31,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:31,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 874 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-13 21:49:31,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:31,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:31,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:32,248 INFO L124 PetriNetUnfolderBase]: 1924/3235 cut-off events. [2025-03-13 21:49:32,248 INFO L125 PetriNetUnfolderBase]: For 11848/11848 co-relation queries the response was YES. [2025-03-13 21:49:32,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12029 conditions, 3235 events. 1924/3235 cut-off events. For 11848/11848 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 18270 event pairs, 554 based on Foata normal form. 1/3140 useless extension candidates. Maximal degree in co-relation 11991. Up to 2518 conditions per place. [2025-03-13 21:49:32,267 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 129 selfloop transitions, 36 changer transitions 3/173 dead transitions. [2025-03-13 21:49:32,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 173 transitions, 1573 flow [2025-03-13 21:49:32,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2025-03-13 21:49:32,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-13 21:49:32,269 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 874 flow. Second operand 11 states and 198 transitions. [2025-03-13 21:49:32,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 173 transitions, 1573 flow [2025-03-13 21:49:32,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 173 transitions, 1479 flow, removed 9 selfloop flow, removed 9 redundant places. [2025-03-13 21:49:32,287 INFO L231 Difference]: Finished difference. Result has 120 places, 119 transitions, 1005 flow [2025-03-13 21:49:32,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1005, PETRI_PLACES=120, PETRI_TRANSITIONS=119} [2025-03-13 21:49:32,288 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 79 predicate places. [2025-03-13 21:49:32,289 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 119 transitions, 1005 flow [2025-03-13 21:49:32,289 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-13 21:49:32,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:32,289 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-13 21:49:32,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:49:32,289 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-13 21:49:32,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:32,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1611992146, now seen corresponding path program 10 times [2025-03-13 21:49:32,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:32,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468301713] [2025-03-13 21:49:32,290 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:32,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:32,298 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:32,317 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:49:32,317 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:32,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:32,724 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-13 21:49:32,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:32,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468301713] [2025-03-13 21:49:32,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468301713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:32,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:32,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:32,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732605183] [2025-03-13 21:49:32,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:32,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:32,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:32,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:32,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:32,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-13 21:49:32,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 1005 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-13 21:49:32,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:32,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-13 21:49:32,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:33,241 INFO L124 PetriNetUnfolderBase]: 2254/3734 cut-off events. [2025-03-13 21:49:33,241 INFO L125 PetriNetUnfolderBase]: For 20809/20809 co-relation queries the response was YES. [2025-03-13 21:49:33,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14758 conditions, 3734 events. 2254/3734 cut-off events. For 20809/20809 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 21412 event pairs, 719 based on Foata normal form. 1/3637 useless extension candidates. Maximal degree in co-relation 14716. Up to 2964 conditions per place. [2025-03-13 21:49:33,258 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 142 selfloop transitions, 36 changer transitions 3/185 dead transitions. [2025-03-13 21:49:33,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 185 transitions, 1768 flow [2025-03-13 21:49:33,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2025-03-13 21:49:33,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4134199134199134 [2025-03-13 21:49:33,260 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 1005 flow. Second operand 11 states and 191 transitions. [2025-03-13 21:49:33,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 185 transitions, 1768 flow [2025-03-13 21:49:33,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 185 transitions, 1650 flow, removed 42 selfloop flow, removed 5 redundant places. [2025-03-13 21:49:33,286 INFO L231 Difference]: Finished difference. Result has 128 places, 128 transitions, 1097 flow [2025-03-13 21:49:33,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1097, PETRI_PLACES=128, PETRI_TRANSITIONS=128} [2025-03-13 21:49:33,287 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 87 predicate places. [2025-03-13 21:49:33,287 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 128 transitions, 1097 flow [2025-03-13 21:49:33,287 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-13 21:49:33,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:33,288 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-13 21:49:33,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:49:33,288 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-13 21:49:33,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:33,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1516755068, now seen corresponding path program 11 times [2025-03-13 21:49:33,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:33,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874605012] [2025-03-13 21:49:33,288 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:33,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:33,294 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:33,303 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:49:33,303 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:33,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:33,692 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-13 21:49:33,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:33,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874605012] [2025-03-13 21:49:33,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874605012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:33,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:33,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:33,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767991915] [2025-03-13 21:49:33,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:33,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:33,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:33,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:33,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:33,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:33,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 128 transitions, 1097 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-13 21:49:33,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:33,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:33,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:34,256 INFO L124 PetriNetUnfolderBase]: 2222/3736 cut-off events. [2025-03-13 21:49:34,257 INFO L125 PetriNetUnfolderBase]: For 25607/25607 co-relation queries the response was YES. [2025-03-13 21:49:34,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15577 conditions, 3736 events. 2222/3736 cut-off events. For 25607/25607 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 22169 event pairs, 675 based on Foata normal form. 1/3633 useless extension candidates. Maximal degree in co-relation 15531. Up to 2931 conditions per place. [2025-03-13 21:49:34,281 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 148 selfloop transitions, 37 changer transitions 3/193 dead transitions. [2025-03-13 21:49:34,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 193 transitions, 1905 flow [2025-03-13 21:49:34,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2025-03-13 21:49:34,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-13 21:49:34,282 INFO L175 Difference]: Start difference. First operand has 128 places, 128 transitions, 1097 flow. Second operand 11 states and 203 transitions. [2025-03-13 21:49:34,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 193 transitions, 1905 flow [2025-03-13 21:49:34,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 193 transitions, 1779 flow, removed 46 selfloop flow, removed 5 redundant places. [2025-03-13 21:49:34,306 INFO L231 Difference]: Finished difference. Result has 136 places, 135 transitions, 1197 flow [2025-03-13 21:49:34,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1197, PETRI_PLACES=136, PETRI_TRANSITIONS=135} [2025-03-13 21:49:34,307 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 95 predicate places. [2025-03-13 21:49:34,307 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 135 transitions, 1197 flow [2025-03-13 21:49:34,307 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-13 21:49:34,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:34,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:34,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:49:34,307 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-13 21:49:34,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:34,307 INFO L85 PathProgramCache]: Analyzing trace with hash 574700112, now seen corresponding path program 12 times [2025-03-13 21:49:34,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:34,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662413117] [2025-03-13 21:49:34,308 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:34,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:34,313 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:34,322 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:49:34,322 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:49:34,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:34,655 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-13 21:49:34,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:34,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662413117] [2025-03-13 21:49:34,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662413117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:34,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:34,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:34,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156314471] [2025-03-13 21:49:34,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:34,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:34,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:34,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:34,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:34,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:34,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 135 transitions, 1197 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-13 21:49:34,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:34,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:34,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:35,189 INFO L124 PetriNetUnfolderBase]: 2283/3844 cut-off events. [2025-03-13 21:49:35,189 INFO L125 PetriNetUnfolderBase]: For 29917/29917 co-relation queries the response was YES. [2025-03-13 21:49:35,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16381 conditions, 3844 events. 2283/3844 cut-off events. For 29917/29917 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 22860 event pairs, 769 based on Foata normal form. 1/3743 useless extension candidates. Maximal degree in co-relation 16331. Up to 3170 conditions per place. [2025-03-13 21:49:35,214 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 142 selfloop transitions, 36 changer transitions 4/187 dead transitions. [2025-03-13 21:49:35,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 187 transitions, 1855 flow [2025-03-13 21:49:35,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2025-03-13 21:49:35,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2025-03-13 21:49:35,216 INFO L175 Difference]: Start difference. First operand has 136 places, 135 transitions, 1197 flow. Second operand 11 states and 190 transitions. [2025-03-13 21:49:35,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 187 transitions, 1855 flow [2025-03-13 21:49:35,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 187 transitions, 1723 flow, removed 47 selfloop flow, removed 6 redundant places. [2025-03-13 21:49:35,285 INFO L231 Difference]: Finished difference. Result has 143 places, 141 transitions, 1232 flow [2025-03-13 21:49:35,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1232, PETRI_PLACES=143, PETRI_TRANSITIONS=141} [2025-03-13 21:49:35,286 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 102 predicate places. [2025-03-13 21:49:35,286 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 141 transitions, 1232 flow [2025-03-13 21:49:35,286 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-13 21:49:35,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:35,287 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-13 21:49:35,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:49:35,287 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-13 21:49:35,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:35,288 INFO L85 PathProgramCache]: Analyzing trace with hash -141022006, now seen corresponding path program 13 times [2025-03-13 21:49:35,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:35,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686507716] [2025-03-13 21:49:35,288 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:49:35,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:35,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:49:35,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:49:35,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:35,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:35,652 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-13 21:49:35,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:35,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686507716] [2025-03-13 21:49:35,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686507716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:35,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:35,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:35,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141778446] [2025-03-13 21:49:35,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:35,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:35,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:35,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:35,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:35,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:35,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 141 transitions, 1232 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-13 21:49:35,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:35,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:35,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:36,207 INFO L124 PetriNetUnfolderBase]: 2434/4088 cut-off events. [2025-03-13 21:49:36,207 INFO L125 PetriNetUnfolderBase]: For 31477/31477 co-relation queries the response was YES. [2025-03-13 21:49:36,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17437 conditions, 4088 events. 2434/4088 cut-off events. For 31477/31477 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 24663 event pairs, 795 based on Foata normal form. 1/3991 useless extension candidates. Maximal degree in co-relation 17383. Up to 3194 conditions per place. [2025-03-13 21:49:36,231 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 153 selfloop transitions, 42 changer transitions 3/203 dead transitions. [2025-03-13 21:49:36,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 203 transitions, 2070 flow [2025-03-13 21:49:36,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2025-03-13 21:49:36,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43506493506493504 [2025-03-13 21:49:36,232 INFO L175 Difference]: Start difference. First operand has 143 places, 141 transitions, 1232 flow. Second operand 11 states and 201 transitions. [2025-03-13 21:49:36,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 203 transitions, 2070 flow [2025-03-13 21:49:36,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 203 transitions, 1962 flow, removed 34 selfloop flow, removed 6 redundant places. [2025-03-13 21:49:36,272 INFO L231 Difference]: Finished difference. Result has 150 places, 148 transitions, 1393 flow [2025-03-13 21:49:36,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1393, PETRI_PLACES=150, PETRI_TRANSITIONS=148} [2025-03-13 21:49:36,272 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 109 predicate places. [2025-03-13 21:49:36,272 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 148 transitions, 1393 flow [2025-03-13 21:49:36,272 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-13 21:49:36,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:36,272 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-13 21:49:36,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 21:49:36,272 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-13 21:49:36,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:36,273 INFO L85 PathProgramCache]: Analyzing trace with hash -864560098, now seen corresponding path program 14 times [2025-03-13 21:49:36,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:36,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850709277] [2025-03-13 21:49:36,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:36,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:36,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:36,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:49:36,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:49:36,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:36,556 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-13 21:49:36,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:36,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850709277] [2025-03-13 21:49:36,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850709277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:36,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:36,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:36,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845449049] [2025-03-13 21:49:36,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:36,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:36,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:36,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:36,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:36,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:36,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 148 transitions, 1393 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-13 21:49:36,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:36,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:36,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:37,090 INFO L124 PetriNetUnfolderBase]: 2434/4080 cut-off events. [2025-03-13 21:49:37,090 INFO L125 PetriNetUnfolderBase]: For 37579/37605 co-relation queries the response was YES. [2025-03-13 21:49:37,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18067 conditions, 4080 events. 2434/4080 cut-off events. For 37579/37605 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 24670 event pairs, 831 based on Foata normal form. 3/3988 useless extension candidates. Maximal degree in co-relation 18009. Up to 3352 conditions per place. [2025-03-13 21:49:37,116 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 158 selfloop transitions, 37 changer transitions 4/204 dead transitions. [2025-03-13 21:49:37,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 204 transitions, 2118 flow [2025-03-13 21:49:37,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2025-03-13 21:49:37,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4264069264069264 [2025-03-13 21:49:37,117 INFO L175 Difference]: Start difference. First operand has 150 places, 148 transitions, 1393 flow. Second operand 11 states and 197 transitions. [2025-03-13 21:49:37,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 204 transitions, 2118 flow [2025-03-13 21:49:37,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 204 transitions, 1960 flow, removed 59 selfloop flow, removed 6 redundant places. [2025-03-13 21:49:37,159 INFO L231 Difference]: Finished difference. Result has 156 places, 152 transitions, 1362 flow [2025-03-13 21:49:37,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1362, PETRI_PLACES=156, PETRI_TRANSITIONS=152} [2025-03-13 21:49:37,160 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 115 predicate places. [2025-03-13 21:49:37,160 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 152 transitions, 1362 flow [2025-03-13 21:49:37,160 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-13 21:49:37,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:37,160 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-13 21:49:37,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 21:49:37,160 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-13 21:49:37,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:37,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1050441446, now seen corresponding path program 15 times [2025-03-13 21:49:37,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:37,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675310598] [2025-03-13 21:49:37,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:37,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:37,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:37,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:49:37,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:49:37,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:37,458 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-13 21:49:37,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:37,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675310598] [2025-03-13 21:49:37,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675310598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:37,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:37,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:37,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278103995] [2025-03-13 21:49:37,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:37,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:37,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:37,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:37,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:37,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:37,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 152 transitions, 1362 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-13 21:49:37,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:37,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:37,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:38,065 INFO L124 PetriNetUnfolderBase]: 2434/4084 cut-off events. [2025-03-13 21:49:38,065 INFO L125 PetriNetUnfolderBase]: For 32987/32987 co-relation queries the response was YES. [2025-03-13 21:49:38,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17600 conditions, 4084 events. 2434/4084 cut-off events. For 32987/32987 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 24627 event pairs, 831 based on Foata normal form. 1/3987 useless extension candidates. Maximal degree in co-relation 17539. Up to 3348 conditions per place. [2025-03-13 21:49:38,086 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 156 selfloop transitions, 41 changer transitions 4/206 dead transitions. [2025-03-13 21:49:38,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 206 transitions, 2055 flow [2025-03-13 21:49:38,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2025-03-13 21:49:38,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-03-13 21:49:38,087 INFO L175 Difference]: Start difference. First operand has 156 places, 152 transitions, 1362 flow. Second operand 11 states and 196 transitions. [2025-03-13 21:49:38,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 206 transitions, 2055 flow [2025-03-13 21:49:38,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 206 transitions, 1949 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-03-13 21:49:38,115 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 1402 flow [2025-03-13 21:49:38,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1402, PETRI_PLACES=160, PETRI_TRANSITIONS=156} [2025-03-13 21:49:38,116 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 119 predicate places. [2025-03-13 21:49:38,116 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 1402 flow [2025-03-13 21:49:38,116 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-13 21:49:38,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:38,116 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-13 21:49:38,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 21:49:38,116 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-13 21:49:38,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:38,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1748755234, now seen corresponding path program 16 times [2025-03-13 21:49:38,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:38,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935162537] [2025-03-13 21:49:38,117 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:38,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:38,125 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:38,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-13 21:49:38,133 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:38,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:38,468 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-13 21:49:38,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:38,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935162537] [2025-03-13 21:49:38,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935162537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:38,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:38,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:38,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778219465] [2025-03-13 21:49:38,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:38,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:38,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:38,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:38,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:38,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-13 21:49:38,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 1402 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-13 21:49:38,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:38,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-13 21:49:38,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:39,071 INFO L124 PetriNetUnfolderBase]: 2668/4423 cut-off events. [2025-03-13 21:49:39,071 INFO L125 PetriNetUnfolderBase]: For 35776/35776 co-relation queries the response was YES. [2025-03-13 21:49:39,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18872 conditions, 4423 events. 2668/4423 cut-off events. For 35776/35776 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 26617 event pairs, 985 based on Foata normal form. 1/4321 useless extension candidates. Maximal degree in co-relation 18809. Up to 3724 conditions per place. [2025-03-13 21:49:39,106 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 162 selfloop transitions, 37 changer transitions 3/206 dead transitions. [2025-03-13 21:49:39,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 206 transitions, 2072 flow [2025-03-13 21:49:39,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:39,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2025-03-13 21:49:39,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3917748917748918 [2025-03-13 21:49:39,107 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 1402 flow. Second operand 11 states and 181 transitions. [2025-03-13 21:49:39,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 206 transitions, 2072 flow [2025-03-13 21:49:39,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 206 transitions, 1948 flow, removed 23 selfloop flow, removed 8 redundant places. [2025-03-13 21:49:39,177 INFO L231 Difference]: Finished difference. Result has 164 places, 159 transitions, 1404 flow [2025-03-13 21:49:39,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1404, PETRI_PLACES=164, PETRI_TRANSITIONS=159} [2025-03-13 21:49:39,177 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 123 predicate places. [2025-03-13 21:49:39,177 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 159 transitions, 1404 flow [2025-03-13 21:49:39,177 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-13 21:49:39,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:39,177 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-13 21:49:39,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 21:49:39,178 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-13 21:49:39,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:39,178 INFO L85 PathProgramCache]: Analyzing trace with hash -545220554, now seen corresponding path program 17 times [2025-03-13 21:49:39,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:39,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164226242] [2025-03-13 21:49:39,178 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:39,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:39,183 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:39,190 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:49:39,191 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:39,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:39,523 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-13 21:49:39,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:39,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164226242] [2025-03-13 21:49:39,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164226242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:39,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:39,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:39,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033821712] [2025-03-13 21:49:39,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:39,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:39,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:39,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:39,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:39,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:39,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 159 transitions, 1404 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-13 21:49:39,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:39,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:39,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:40,092 INFO L124 PetriNetUnfolderBase]: 2470/4159 cut-off events. [2025-03-13 21:49:40,093 INFO L125 PetriNetUnfolderBase]: For 32368/32368 co-relation queries the response was YES. [2025-03-13 21:49:40,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17644 conditions, 4159 events. 2470/4159 cut-off events. For 32368/32368 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 25338 event pairs, 900 based on Foata normal form. 1/4058 useless extension candidates. Maximal degree in co-relation 17579. Up to 3495 conditions per place. [2025-03-13 21:49:40,124 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 162 selfloop transitions, 35 changer transitions 3/205 dead transitions. [2025-03-13 21:49:40,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 205 transitions, 2040 flow [2025-03-13 21:49:40,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:40,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2025-03-13 21:49:40,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-03-13 21:49:40,125 INFO L175 Difference]: Start difference. First operand has 164 places, 159 transitions, 1404 flow. Second operand 11 states and 187 transitions. [2025-03-13 21:49:40,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 205 transitions, 2040 flow [2025-03-13 21:49:40,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 205 transitions, 1932 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-03-13 21:49:40,159 INFO L231 Difference]: Finished difference. Result has 168 places, 161 transitions, 1392 flow [2025-03-13 21:49:40,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1392, PETRI_PLACES=168, PETRI_TRANSITIONS=161} [2025-03-13 21:49:40,159 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 127 predicate places. [2025-03-13 21:49:40,159 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 161 transitions, 1392 flow [2025-03-13 21:49:40,159 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-13 21:49:40,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:40,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-13 21:49:40,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 21:49:40,159 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-13 21:49:40,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:40,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2079611608, now seen corresponding path program 18 times [2025-03-13 21:49:40,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:40,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233618942] [2025-03-13 21:49:40,160 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:40,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:40,165 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:40,171 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:49:40,172 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:49:40,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:40,538 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-13 21:49:40,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:40,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233618942] [2025-03-13 21:49:40,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233618942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:40,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:40,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:40,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758248435] [2025-03-13 21:49:40,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:40,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:40,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:40,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:40,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:40,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:40,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 161 transitions, 1392 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-13 21:49:40,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:40,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:40,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:41,217 INFO L124 PetriNetUnfolderBase]: 2709/4568 cut-off events. [2025-03-13 21:49:41,217 INFO L125 PetriNetUnfolderBase]: For 42353/42353 co-relation queries the response was YES. [2025-03-13 21:49:41,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20178 conditions, 4568 events. 2709/4568 cut-off events. For 42353/42353 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 28608 event pairs, 928 based on Foata normal form. 1/4464 useless extension candidates. Maximal degree in co-relation 20111. Up to 3530 conditions per place. [2025-03-13 21:49:41,250 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 189 selfloop transitions, 44 changer transitions 3/241 dead transitions. [2025-03-13 21:49:41,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 241 transitions, 2489 flow [2025-03-13 21:49:41,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:49:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:49:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 223 transitions. [2025-03-13 21:49:41,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44246031746031744 [2025-03-13 21:49:41,251 INFO L175 Difference]: Start difference. First operand has 168 places, 161 transitions, 1392 flow. Second operand 12 states and 223 transitions. [2025-03-13 21:49:41,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 241 transitions, 2489 flow [2025-03-13 21:49:41,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 241 transitions, 2421 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-13 21:49:41,303 INFO L231 Difference]: Finished difference. Result has 175 places, 173 transitions, 1663 flow [2025-03-13 21:49:41,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1663, PETRI_PLACES=175, PETRI_TRANSITIONS=173} [2025-03-13 21:49:41,304 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 134 predicate places. [2025-03-13 21:49:41,304 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 173 transitions, 1663 flow [2025-03-13 21:49:41,304 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-13 21:49:41,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:41,304 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-13 21:49:41,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 21:49:41,304 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-13 21:49:41,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash 341346484, now seen corresponding path program 19 times [2025-03-13 21:49:41,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:41,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281082272] [2025-03-13 21:49:41,305 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:49:41,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:41,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:49:41,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:49:41,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:41,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:41,634 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-13 21:49:41,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:41,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281082272] [2025-03-13 21:49:41,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281082272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:41,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:41,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:41,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468649754] [2025-03-13 21:49:41,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:41,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:41,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:41,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:41,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:41,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:41,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 173 transitions, 1663 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-13 21:49:41,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:41,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:41,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:42,370 INFO L124 PetriNetUnfolderBase]: 2908/4911 cut-off events. [2025-03-13 21:49:42,371 INFO L125 PetriNetUnfolderBase]: For 58161/58161 co-relation queries the response was YES. [2025-03-13 21:49:42,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23123 conditions, 4911 events. 2908/4911 cut-off events. For 58161/58161 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 31354 event pairs, 939 based on Foata normal form. 1/4802 useless extension candidates. Maximal degree in co-relation 23052. Up to 3717 conditions per place. [2025-03-13 21:49:42,399 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 187 selfloop transitions, 54 changer transitions 3/249 dead transitions. [2025-03-13 21:49:42,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 249 transitions, 2832 flow [2025-03-13 21:49:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:49:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:49:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 222 transitions. [2025-03-13 21:49:42,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2025-03-13 21:49:42,401 INFO L175 Difference]: Start difference. First operand has 175 places, 173 transitions, 1663 flow. Second operand 12 states and 222 transitions. [2025-03-13 21:49:42,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 249 transitions, 2832 flow [2025-03-13 21:49:42,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 249 transitions, 2606 flow, removed 96 selfloop flow, removed 5 redundant places. [2025-03-13 21:49:42,467 INFO L231 Difference]: Finished difference. Result has 185 places, 184 transitions, 1842 flow [2025-03-13 21:49:42,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1842, PETRI_PLACES=185, PETRI_TRANSITIONS=184} [2025-03-13 21:49:42,468 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places. [2025-03-13 21:49:42,468 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 184 transitions, 1842 flow [2025-03-13 21:49:42,468 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-13 21:49:42,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:42,468 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-13 21:49:42,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 21:49:42,468 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-13 21:49:42,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:42,469 INFO L85 PathProgramCache]: Analyzing trace with hash 260109490, now seen corresponding path program 20 times [2025-03-13 21:49:42,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:42,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244056808] [2025-03-13 21:49:42,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:42,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:42,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:42,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:49:42,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:49:42,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:42,797 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-13 21:49:42,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:42,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244056808] [2025-03-13 21:49:42,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244056808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:42,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:42,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:42,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940754369] [2025-03-13 21:49:42,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:42,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:42,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:42,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:42,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:42,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:42,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 184 transitions, 1842 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-13 21:49:42,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:42,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:42,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:43,577 INFO L124 PetriNetUnfolderBase]: 3004/5097 cut-off events. [2025-03-13 21:49:43,577 INFO L125 PetriNetUnfolderBase]: For 69548/69548 co-relation queries the response was YES. [2025-03-13 21:49:43,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24649 conditions, 5097 events. 3004/5097 cut-off events. For 69548/69548 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 33408 event pairs, 988 based on Foata normal form. 1/4978 useless extension candidates. Maximal degree in co-relation 24573. Up to 3989 conditions per place. [2025-03-13 21:49:43,616 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 196 selfloop transitions, 49 changer transitions 3/253 dead transitions. [2025-03-13 21:49:43,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 253 transitions, 2900 flow [2025-03-13 21:49:43,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:49:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:49:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 219 transitions. [2025-03-13 21:49:43,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2025-03-13 21:49:43,617 INFO L175 Difference]: Start difference. First operand has 185 places, 184 transitions, 1842 flow. Second operand 12 states and 219 transitions. [2025-03-13 21:49:43,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 253 transitions, 2900 flow [2025-03-13 21:49:43,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 253 transitions, 2693 flow, removed 79 selfloop flow, removed 7 redundant places. [2025-03-13 21:49:43,716 INFO L231 Difference]: Finished difference. Result has 192 places, 190 transitions, 1901 flow [2025-03-13 21:49:43,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1901, PETRI_PLACES=192, PETRI_TRANSITIONS=190} [2025-03-13 21:49:43,717 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 151 predicate places. [2025-03-13 21:49:43,717 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 190 transitions, 1901 flow [2025-03-13 21:49:43,717 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-13 21:49:43,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:43,717 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-13 21:49:43,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 21:49:43,717 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-13 21:49:43,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash 893032410, now seen corresponding path program 21 times [2025-03-13 21:49:43,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:43,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608268098] [2025-03-13 21:49:43,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:43,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:43,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:43,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:49:43,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:49:43,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:43,962 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-13 21:49:43,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:43,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608268098] [2025-03-13 21:49:43,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608268098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:43,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:43,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:43,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418177776] [2025-03-13 21:49:43,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:43,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:43,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:43,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:43,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:43,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:43,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 190 transitions, 1901 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-13 21:49:43,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:43,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:43,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:44,614 INFO L124 PetriNetUnfolderBase]: 3004/5087 cut-off events. [2025-03-13 21:49:44,614 INFO L125 PetriNetUnfolderBase]: For 68879/68879 co-relation queries the response was YES. [2025-03-13 21:49:44,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24498 conditions, 5087 events. 3004/5087 cut-off events. For 68879/68879 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 32926 event pairs, 1066 based on Foata normal form. 1/4976 useless extension candidates. Maximal degree in co-relation 24419. Up to 4066 conditions per place. [2025-03-13 21:49:44,655 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 193 selfloop transitions, 51 changer transitions 4/253 dead transitions. [2025-03-13 21:49:44,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 253 transitions, 2837 flow [2025-03-13 21:49:44,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:49:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:49:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 216 transitions. [2025-03-13 21:49:44,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-13 21:49:44,656 INFO L175 Difference]: Start difference. First operand has 192 places, 190 transitions, 1901 flow. Second operand 12 states and 216 transitions. [2025-03-13 21:49:44,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 253 transitions, 2837 flow [2025-03-13 21:49:44,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 253 transitions, 2684 flow, removed 51 selfloop flow, removed 8 redundant places. [2025-03-13 21:49:44,780 INFO L231 Difference]: Finished difference. Result has 197 places, 194 transitions, 1928 flow [2025-03-13 21:49:44,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1748, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1928, PETRI_PLACES=197, PETRI_TRANSITIONS=194} [2025-03-13 21:49:44,781 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 156 predicate places. [2025-03-13 21:49:44,781 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 194 transitions, 1928 flow [2025-03-13 21:49:44,781 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-13 21:49:44,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:44,781 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-13 21:49:44,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 21:49:44,781 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-13 21:49:44,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:44,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1722680612, now seen corresponding path program 22 times [2025-03-13 21:49:44,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:44,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000567635] [2025-03-13 21:49:44,782 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:44,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:44,786 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:44,794 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:49:44,794 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:44,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:45,131 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-13 21:49:45,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:45,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000567635] [2025-03-13 21:49:45,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000567635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:45,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:45,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:45,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399940132] [2025-03-13 21:49:45,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:45,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:45,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:45,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:45,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:45,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-13 21:49:45,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 194 transitions, 1928 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-13 21:49:45,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:45,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-13 21:49:45,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:45,879 INFO L124 PetriNetUnfolderBase]: 3330/5583 cut-off events. [2025-03-13 21:49:45,879 INFO L125 PetriNetUnfolderBase]: For 77676/77676 co-relation queries the response was YES. [2025-03-13 21:49:45,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27220 conditions, 5583 events. 3330/5583 cut-off events. For 77676/77676 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 36359 event pairs, 1385 based on Foata normal form. 1/5461 useless extension candidates. Maximal degree in co-relation 27139. Up to 4717 conditions per place. [2025-03-13 21:49:45,918 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 216 selfloop transitions, 36 changer transitions 3/259 dead transitions. [2025-03-13 21:49:45,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 259 transitions, 3147 flow [2025-03-13 21:49:45,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:45,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-13 21:49:45,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2025-03-13 21:49:45,919 INFO L175 Difference]: Start difference. First operand has 197 places, 194 transitions, 1928 flow. Second operand 11 states and 193 transitions. [2025-03-13 21:49:45,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 259 transitions, 3147 flow [2025-03-13 21:49:46,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 259 transitions, 2993 flow, removed 30 selfloop flow, removed 9 redundant places. [2025-03-13 21:49:46,026 INFO L231 Difference]: Finished difference. Result has 202 places, 203 transitions, 2157 flow [2025-03-13 21:49:46,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1780, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2157, PETRI_PLACES=202, PETRI_TRANSITIONS=203} [2025-03-13 21:49:46,027 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 161 predicate places. [2025-03-13 21:49:46,027 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 203 transitions, 2157 flow [2025-03-13 21:49:46,027 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-13 21:49:46,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:46,027 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-13 21:49:46,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 21:49:46,027 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-13 21:49:46,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:46,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1731878102, now seen corresponding path program 23 times [2025-03-13 21:49:46,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:46,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239986159] [2025-03-13 21:49:46,027 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:46,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:46,032 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:46,039 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:49:46,039 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:46,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:46,339 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-13 21:49:46,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:46,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239986159] [2025-03-13 21:49:46,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239986159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:46,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:46,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:46,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418315984] [2025-03-13 21:49:46,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:46,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:46,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:46,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:46,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:46,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:46,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 203 transitions, 2157 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-13 21:49:46,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:46,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:46,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:47,005 INFO L124 PetriNetUnfolderBase]: 3334/5646 cut-off events. [2025-03-13 21:49:47,005 INFO L125 PetriNetUnfolderBase]: For 103172/103172 co-relation queries the response was YES. [2025-03-13 21:49:47,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29238 conditions, 5646 events. 3334/5646 cut-off events. For 103172/103172 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 37489 event pairs, 1344 based on Foata normal form. 1/5514 useless extension candidates. Maximal degree in co-relation 29153. Up to 4717 conditions per place. [2025-03-13 21:49:47,059 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 226 selfloop transitions, 37 changer transitions 3/271 dead transitions. [2025-03-13 21:49:47,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 271 transitions, 3434 flow [2025-03-13 21:49:47,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions. [2025-03-13 21:49:47,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4458874458874459 [2025-03-13 21:49:47,060 INFO L175 Difference]: Start difference. First operand has 202 places, 203 transitions, 2157 flow. Second operand 11 states and 206 transitions. [2025-03-13 21:49:47,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 271 transitions, 3434 flow [2025-03-13 21:49:47,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 271 transitions, 3140 flow, removed 130 selfloop flow, removed 5 redundant places. [2025-03-13 21:49:47,202 INFO L231 Difference]: Finished difference. Result has 211 places, 213 transitions, 2256 flow [2025-03-13 21:49:47,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2256, PETRI_PLACES=211, PETRI_TRANSITIONS=213} [2025-03-13 21:49:47,202 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 170 predicate places. [2025-03-13 21:49:47,202 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 213 transitions, 2256 flow [2025-03-13 21:49:47,203 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-13 21:49:47,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:47,203 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-13 21:49:47,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-13 21:49:47,203 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-13 21:49:47,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:47,203 INFO L85 PathProgramCache]: Analyzing trace with hash -649156216, now seen corresponding path program 24 times [2025-03-13 21:49:47,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:47,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255515400] [2025-03-13 21:49:47,203 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:47,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:47,208 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:47,221 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:49:47,221 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:49:47,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:47,517 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-13 21:49:47,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:47,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255515400] [2025-03-13 21:49:47,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255515400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:47,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:47,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:47,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094576975] [2025-03-13 21:49:47,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:47,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:47,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:47,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:47,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:47,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:47,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 213 transitions, 2256 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-13 21:49:47,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:47,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:47,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:48,234 INFO L124 PetriNetUnfolderBase]: 3395/5768 cut-off events. [2025-03-13 21:49:48,234 INFO L125 PetriNetUnfolderBase]: For 96320/96320 co-relation queries the response was YES. [2025-03-13 21:49:48,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29281 conditions, 5768 events. 3395/5768 cut-off events. For 96320/96320 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 38925 event pairs, 1402 based on Foata normal form. 1/5623 useless extension candidates. Maximal degree in co-relation 29191. Up to 4956 conditions per place. [2025-03-13 21:49:48,280 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 220 selfloop transitions, 36 changer transitions 4/265 dead transitions. [2025-03-13 21:49:48,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 265 transitions, 3220 flow [2025-03-13 21:49:48,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-13 21:49:48,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2025-03-13 21:49:48,281 INFO L175 Difference]: Start difference. First operand has 211 places, 213 transitions, 2256 flow. Second operand 11 states and 193 transitions. [2025-03-13 21:49:48,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 265 transitions, 3220 flow [2025-03-13 21:49:48,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 265 transitions, 3010 flow, removed 88 selfloop flow, removed 5 redundant places. [2025-03-13 21:49:48,405 INFO L231 Difference]: Finished difference. Result has 219 places, 219 transitions, 2257 flow [2025-03-13 21:49:48,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2046, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2257, PETRI_PLACES=219, PETRI_TRANSITIONS=219} [2025-03-13 21:49:48,406 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 178 predicate places. [2025-03-13 21:49:48,406 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 219 transitions, 2257 flow [2025-03-13 21:49:48,406 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-13 21:49:48,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:48,406 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-13 21:49:48,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-13 21:49:48,406 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-13 21:49:48,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:48,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1364878334, now seen corresponding path program 25 times [2025-03-13 21:49:48,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:48,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914848012] [2025-03-13 21:49:48,407 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:49:48,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:48,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:49:48,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:49:48,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:48,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:48,725 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-13 21:49:48,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:48,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914848012] [2025-03-13 21:49:48,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914848012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:48,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:48,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:48,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303261880] [2025-03-13 21:49:48,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:48,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:48,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:48,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:48,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:48,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:48,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 219 transitions, 2257 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-13 21:49:48,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:48,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:48,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:49,735 INFO L124 PetriNetUnfolderBase]: 3540/5996 cut-off events. [2025-03-13 21:49:49,735 INFO L125 PetriNetUnfolderBase]: For 98717/98717 co-relation queries the response was YES. [2025-03-13 21:49:49,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30287 conditions, 5996 events. 3540/5996 cut-off events. For 98717/98717 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 40450 event pairs, 1442 based on Foata normal form. 1/5868 useless extension candidates. Maximal degree in co-relation 30193. Up to 4980 conditions per place. [2025-03-13 21:49:49,791 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 231 selfloop transitions, 42 changer transitions 3/281 dead transitions. [2025-03-13 21:49:49,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 281 transitions, 3483 flow [2025-03-13 21:49:49,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2025-03-13 21:49:49,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2025-03-13 21:49:49,792 INFO L175 Difference]: Start difference. First operand has 219 places, 219 transitions, 2257 flow. Second operand 11 states and 204 transitions. [2025-03-13 21:49:49,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 281 transitions, 3483 flow [2025-03-13 21:49:49,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 281 transitions, 3321 flow, removed 61 selfloop flow, removed 6 redundant places. [2025-03-13 21:49:49,902 INFO L231 Difference]: Finished difference. Result has 226 places, 226 transitions, 2454 flow [2025-03-13 21:49:49,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2095, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2454, PETRI_PLACES=226, PETRI_TRANSITIONS=226} [2025-03-13 21:49:49,902 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 185 predicate places. [2025-03-13 21:49:49,902 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 226 transitions, 2454 flow [2025-03-13 21:49:49,903 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-13 21:49:49,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:49,903 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-13 21:49:49,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-13 21:49:49,903 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-13 21:49:49,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:49,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1518125206, now seen corresponding path program 26 times [2025-03-13 21:49:49,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:49,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493978939] [2025-03-13 21:49:49,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:49,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:49,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:49,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:49:49,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:49:49,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:50,261 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-13 21:49:50,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:50,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493978939] [2025-03-13 21:49:50,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493978939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:50,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:50,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:50,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013063372] [2025-03-13 21:49:50,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:50,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:50,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:50,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:50,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:50,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:50,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 226 transitions, 2454 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-13 21:49:50,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:50,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:50,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:51,055 INFO L124 PetriNetUnfolderBase]: 3646/6198 cut-off events. [2025-03-13 21:49:51,056 INFO L125 PetriNetUnfolderBase]: For 126150/126150 co-relation queries the response was YES. [2025-03-13 21:49:51,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32726 conditions, 6198 events. 3646/6198 cut-off events. For 126150/126150 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 42300 event pairs, 1525 based on Foata normal form. 1/6060 useless extension candidates. Maximal degree in co-relation 32628. Up to 5291 conditions per place. [2025-03-13 21:49:51,121 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 246 selfloop transitions, 35 changer transitions 3/289 dead transitions. [2025-03-13 21:49:51,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 289 transitions, 3674 flow [2025-03-13 21:49:51,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2025-03-13 21:49:51,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-13 21:49:51,122 INFO L175 Difference]: Start difference. First operand has 226 places, 226 transitions, 2454 flow. Second operand 11 states and 203 transitions. [2025-03-13 21:49:51,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 289 transitions, 3674 flow [2025-03-13 21:49:51,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 289 transitions, 3430 flow, removed 102 selfloop flow, removed 6 redundant places. [2025-03-13 21:49:51,392 INFO L231 Difference]: Finished difference. Result has 233 places, 232 transitions, 2473 flow [2025-03-13 21:49:51,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2214, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2473, PETRI_PLACES=233, PETRI_TRANSITIONS=232} [2025-03-13 21:49:51,393 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 192 predicate places. [2025-03-13 21:49:51,394 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 232 transitions, 2473 flow [2025-03-13 21:49:51,394 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-13 21:49:51,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:51,394 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-13 21:49:51,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-13 21:49:51,394 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-13 21:49:51,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:51,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1937118092, now seen corresponding path program 27 times [2025-03-13 21:49:51,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:51,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687822166] [2025-03-13 21:49:51,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:51,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:51,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:51,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:49:51,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:49:51,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:51,757 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-13 21:49:51,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:51,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687822166] [2025-03-13 21:49:51,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687822166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:51,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:51,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:51,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338633075] [2025-03-13 21:49:51,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:51,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:51,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:51,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:51,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:51,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:51,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 232 transitions, 2473 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-13 21:49:51,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:51,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:51,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:52,572 INFO L124 PetriNetUnfolderBase]: 3708/6296 cut-off events. [2025-03-13 21:49:52,572 INFO L125 PetriNetUnfolderBase]: For 127151/127151 co-relation queries the response was YES. [2025-03-13 21:49:52,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32813 conditions, 6296 events. 3708/6296 cut-off events. For 127151/127151 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 43097 event pairs, 1557 based on Foata normal form. 1/6161 useless extension candidates. Maximal degree in co-relation 32711. Up to 5378 conditions per place. [2025-03-13 21:49:52,641 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 245 selfloop transitions, 37 changer transitions 4/291 dead transitions. [2025-03-13 21:49:52,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 291 transitions, 3635 flow [2025-03-13 21:49:52,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-03-13 21:49:52,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2025-03-13 21:49:52,642 INFO L175 Difference]: Start difference. First operand has 233 places, 232 transitions, 2473 flow. Second operand 11 states and 202 transitions. [2025-03-13 21:49:52,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 291 transitions, 3635 flow [2025-03-13 21:49:52,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 291 transitions, 3452 flow, removed 73 selfloop flow, removed 6 redundant places. [2025-03-13 21:49:52,872 INFO L231 Difference]: Finished difference. Result has 239 places, 236 transitions, 2542 flow [2025-03-13 21:49:52,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2290, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2542, PETRI_PLACES=239, PETRI_TRANSITIONS=236} [2025-03-13 21:49:52,873 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 198 predicate places. [2025-03-13 21:49:52,873 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 236 transitions, 2542 flow [2025-03-13 21:49:52,873 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-13 21:49:52,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:52,873 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-13 21:49:52,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-13 21:49:52,873 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-13 21:49:52,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:52,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1459118822, now seen corresponding path program 28 times [2025-03-13 21:49:52,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:52,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066277232] [2025-03-13 21:49:52,874 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:52,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:52,878 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:52,885 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:49:52,885 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:52,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:53,209 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-13 21:49:53,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:53,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066277232] [2025-03-13 21:49:53,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066277232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:53,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:53,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:53,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601500990] [2025-03-13 21:49:53,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:53,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:53,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:53,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:53,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:53,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-13 21:49:53,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 236 transitions, 2542 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-13 21:49:53,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:53,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-13 21:49:53,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:54,186 INFO L124 PetriNetUnfolderBase]: 4002/6745 cut-off events. [2025-03-13 21:49:54,186 INFO L125 PetriNetUnfolderBase]: For 149092/149092 co-relation queries the response was YES. [2025-03-13 21:49:54,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35678 conditions, 6745 events. 4002/6745 cut-off events. For 149092/149092 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 46317 event pairs, 1730 based on Foata normal form. 1/6600 useless extension candidates. Maximal degree in co-relation 35573. Up to 5787 conditions per place. [2025-03-13 21:49:54,248 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 257 selfloop transitions, 36 changer transitions 3/300 dead transitions. [2025-03-13 21:49:54,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 300 transitions, 3829 flow [2025-03-13 21:49:54,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2025-03-13 21:49:54,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42207792207792205 [2025-03-13 21:49:54,249 INFO L175 Difference]: Start difference. First operand has 239 places, 236 transitions, 2542 flow. Second operand 11 states and 195 transitions. [2025-03-13 21:49:54,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 300 transitions, 3829 flow [2025-03-13 21:49:54,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 300 transitions, 3634 flow, removed 77 selfloop flow, removed 7 redundant places. [2025-03-13 21:49:54,454 INFO L231 Difference]: Finished difference. Result has 245 places, 242 transitions, 2628 flow [2025-03-13 21:49:54,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2351, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2628, PETRI_PLACES=245, PETRI_TRANSITIONS=242} [2025-03-13 21:49:54,455 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 204 predicate places. [2025-03-13 21:49:54,455 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 242 transitions, 2628 flow [2025-03-13 21:49:54,456 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-13 21:49:54,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:54,456 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-13 21:49:54,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-13 21:49:54,456 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-13 21:49:54,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:54,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1487542224, now seen corresponding path program 29 times [2025-03-13 21:49:54,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:54,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688251946] [2025-03-13 21:49:54,456 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:54,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:54,461 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:54,466 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:49:54,466 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:54,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:54,720 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-13 21:49:54,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:54,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688251946] [2025-03-13 21:49:54,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688251946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:54,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:54,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:54,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587143637] [2025-03-13 21:49:54,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:54,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:54,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:54,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:54,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:54,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:54,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 242 transitions, 2628 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-13 21:49:54,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:54,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:54,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:55,617 INFO L124 PetriNetUnfolderBase]: 3804/6476 cut-off events. [2025-03-13 21:49:55,617 INFO L125 PetriNetUnfolderBase]: For 141357/141357 co-relation queries the response was YES. [2025-03-13 21:49:55,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34103 conditions, 6476 events. 3804/6476 cut-off events. For 141357/141357 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 44774 event pairs, 1641 based on Foata normal form. 1/6337 useless extension candidates. Maximal degree in co-relation 33994. Up to 5583 conditions per place. [2025-03-13 21:49:55,682 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 252 selfloop transitions, 37 changer transitions 4/298 dead transitions. [2025-03-13 21:49:55,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 298 transitions, 3721 flow [2025-03-13 21:49:55,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2025-03-13 21:49:55,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4329004329004329 [2025-03-13 21:49:55,683 INFO L175 Difference]: Start difference. First operand has 245 places, 242 transitions, 2628 flow. Second operand 11 states and 200 transitions. [2025-03-13 21:49:55,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 298 transitions, 3721 flow [2025-03-13 21:49:55,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 298 transitions, 3521 flow, removed 81 selfloop flow, removed 6 redundant places. [2025-03-13 21:49:55,899 INFO L231 Difference]: Finished difference. Result has 251 places, 246 transitions, 2577 flow [2025-03-13 21:49:55,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2428, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2577, PETRI_PLACES=251, PETRI_TRANSITIONS=246} [2025-03-13 21:49:55,900 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 210 predicate places. [2025-03-13 21:49:55,900 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 246 transitions, 2577 flow [2025-03-13 21:49:55,900 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-13 21:49:55,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:55,900 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-13 21:49:55,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-13 21:49:55,900 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-13 21:49:55,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1322355734, now seen corresponding path program 30 times [2025-03-13 21:49:55,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:55,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123882118] [2025-03-13 21:49:55,901 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:55,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:55,905 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:55,912 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:49:55,912 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:49:55,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:56,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-13 21:49:56,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:56,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123882118] [2025-03-13 21:49:56,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123882118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:56,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:56,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:56,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640403960] [2025-03-13 21:49:56,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:56,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:56,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:56,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:56,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:56,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:56,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 246 transitions, 2577 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-13 21:49:56,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:56,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:56,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:57,470 INFO L124 PetriNetUnfolderBase]: 3840/6543 cut-off events. [2025-03-13 21:49:57,470 INFO L125 PetriNetUnfolderBase]: For 132939/132939 co-relation queries the response was YES. [2025-03-13 21:49:57,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33798 conditions, 6543 events. 3840/6543 cut-off events. For 132939/132939 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 45377 event pairs, 1699 based on Foata normal form. 1/6405 useless extension candidates. Maximal degree in co-relation 33686. Up to 5714 conditions per place. [2025-03-13 21:49:57,550 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 250 selfloop transitions, 37 changer transitions 3/295 dead transitions. [2025-03-13 21:49:57,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 295 transitions, 3575 flow [2025-03-13 21:49:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-13 21:49:57,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2025-03-13 21:49:57,551 INFO L175 Difference]: Start difference. First operand has 251 places, 246 transitions, 2577 flow. Second operand 11 states and 193 transitions. [2025-03-13 21:49:57,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 295 transitions, 3575 flow [2025-03-13 21:49:57,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 295 transitions, 3439 flow, removed 33 selfloop flow, removed 8 redundant places. [2025-03-13 21:49:57,773 INFO L231 Difference]: Finished difference. Result has 255 places, 249 transitions, 2587 flow [2025-03-13 21:49:57,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2441, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2587, PETRI_PLACES=255, PETRI_TRANSITIONS=249} [2025-03-13 21:49:57,774 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 214 predicate places. [2025-03-13 21:49:57,774 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 249 transitions, 2587 flow [2025-03-13 21:49:57,774 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-13 21:49:57,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:57,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:57,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-13 21:49:57,774 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-13 21:49:57,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:57,774 INFO L85 PathProgramCache]: Analyzing trace with hash -890205566, now seen corresponding path program 31 times [2025-03-13 21:49:57,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:57,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834769923] [2025-03-13 21:49:57,775 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:49:57,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:57,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:49:57,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:49:57,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:57,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:58,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-13 21:49:58,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:58,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834769923] [2025-03-13 21:49:58,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834769923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:58,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:58,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:58,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104624955] [2025-03-13 21:49:58,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:58,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:58,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:58,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:58,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:58,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:58,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 249 transitions, 2587 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-13 21:49:58,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:58,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:58,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:59,180 INFO L124 PetriNetUnfolderBase]: 3840/6555 cut-off events. [2025-03-13 21:49:59,181 INFO L125 PetriNetUnfolderBase]: For 131251/131251 co-relation queries the response was YES. [2025-03-13 21:49:59,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33596 conditions, 6555 events. 3840/6555 cut-off events. For 131251/131251 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 45595 event pairs, 1659 based on Foata normal form. 1/6410 useless extension candidates. Maximal degree in co-relation 33482. Up to 5648 conditions per place. [2025-03-13 21:49:59,238 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 253 selfloop transitions, 41 changer transitions 4/303 dead transitions. [2025-03-13 21:49:59,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 303 transitions, 3632 flow [2025-03-13 21:49:59,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:49:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:49:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2025-03-13 21:49:59,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43073593073593075 [2025-03-13 21:49:59,239 INFO L175 Difference]: Start difference. First operand has 255 places, 249 transitions, 2587 flow. Second operand 11 states and 199 transitions. [2025-03-13 21:49:59,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 303 transitions, 3632 flow [2025-03-13 21:49:59,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 303 transitions, 3496 flow, removed 33 selfloop flow, removed 8 redundant places. [2025-03-13 21:49:59,438 INFO L231 Difference]: Finished difference. Result has 259 places, 253 transitions, 2621 flow [2025-03-13 21:49:59,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2451, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2621, PETRI_PLACES=259, PETRI_TRANSITIONS=253} [2025-03-13 21:49:59,439 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 218 predicate places. [2025-03-13 21:49:59,439 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 253 transitions, 2621 flow [2025-03-13 21:49:59,439 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-13 21:49:59,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:59,439 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-13 21:49:59,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-13 21:49:59,439 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-13 21:49:59,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:59,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1461521862, now seen corresponding path program 32 times [2025-03-13 21:49:59,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:59,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16845783] [2025-03-13 21:49:59,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:59,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:59,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:49:59,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:49:59,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:49:59,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:59,683 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-13 21:49:59,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:59,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16845783] [2025-03-13 21:49:59,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16845783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:59,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:59,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:49:59,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435242205] [2025-03-13 21:49:59,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:59,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:49:59,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:59,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:49:59,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:49:59,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:49:59,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 253 transitions, 2621 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-13 21:49:59,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:59,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:49:59,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:00,568 INFO L124 PetriNetUnfolderBase]: 3840/6565 cut-off events. [2025-03-13 21:50:00,568 INFO L125 PetriNetUnfolderBase]: For 131800/131800 co-relation queries the response was YES. [2025-03-13 21:50:00,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33641 conditions, 6565 events. 3840/6565 cut-off events. For 131800/131800 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 45981 event pairs, 1674 based on Foata normal form. 1/6398 useless extension candidates. Maximal degree in co-relation 33525. Up to 5726 conditions per place. [2025-03-13 21:50:00,656 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 256 selfloop transitions, 35 changer transitions 3/299 dead transitions. [2025-03-13 21:50:00,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 299 transitions, 3577 flow [2025-03-13 21:50:00,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:50:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:50:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2025-03-13 21:50:00,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2025-03-13 21:50:00,657 INFO L175 Difference]: Start difference. First operand has 259 places, 253 transitions, 2621 flow. Second operand 11 states and 190 transitions. [2025-03-13 21:50:00,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 299 transitions, 3577 flow [2025-03-13 21:50:00,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 299 transitions, 3421 flow, removed 39 selfloop flow, removed 8 redundant places. [2025-03-13 21:50:00,852 INFO L231 Difference]: Finished difference. Result has 263 places, 255 transitions, 2559 flow [2025-03-13 21:50:00,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2465, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2559, PETRI_PLACES=263, PETRI_TRANSITIONS=255} [2025-03-13 21:50:00,852 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 222 predicate places. [2025-03-13 21:50:00,852 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 255 transitions, 2559 flow [2025-03-13 21:50:00,853 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-13 21:50:00,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:00,853 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-13 21:50:00,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-13 21:50:00,853 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-13 21:50:00,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:00,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2059719796, now seen corresponding path program 33 times [2025-03-13 21:50:00,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:00,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215205486] [2025-03-13 21:50:00,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:50:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:00,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:50:00,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:50:00,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:50:00,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:01,213 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-13 21:50:01,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:01,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215205486] [2025-03-13 21:50:01,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215205486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:01,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:01,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:50:01,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207635060] [2025-03-13 21:50:01,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:01,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:50:01,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:01,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:50:01,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:50:01,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:50:01,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 255 transitions, 2559 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-13 21:50:01,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:01,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:50:01,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:02,118 INFO L124 PetriNetUnfolderBase]: 3971/6772 cut-off events. [2025-03-13 21:50:02,118 INFO L125 PetriNetUnfolderBase]: For 145221/145221 co-relation queries the response was YES. [2025-03-13 21:50:02,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35306 conditions, 6772 events. 3971/6772 cut-off events. For 145221/145221 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 47431 event pairs, 1744 based on Foata normal form. 1/6621 useless extension candidates. Maximal degree in co-relation 35188. Up to 5839 conditions per place. [2025-03-13 21:50:02,190 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 272 selfloop transitions, 35 changer transitions 3/315 dead transitions. [2025-03-13 21:50:02,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 315 transitions, 4044 flow [2025-03-13 21:50:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:50:02,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:50:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2025-03-13 21:50:02,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4329004329004329 [2025-03-13 21:50:02,191 INFO L175 Difference]: Start difference. First operand has 263 places, 255 transitions, 2559 flow. Second operand 11 states and 200 transitions. [2025-03-13 21:50:02,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 315 transitions, 4044 flow [2025-03-13 21:50:02,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 315 transitions, 3976 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-13 21:50:02,424 INFO L231 Difference]: Finished difference. Result has 269 places, 264 transitions, 2976 flow [2025-03-13 21:50:02,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2491, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2976, PETRI_PLACES=269, PETRI_TRANSITIONS=264} [2025-03-13 21:50:02,425 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 228 predicate places. [2025-03-13 21:50:02,425 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 264 transitions, 2976 flow [2025-03-13 21:50:02,425 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-13 21:50:02,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:02,425 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-13 21:50:02,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-13 21:50:02,425 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-13 21:50:02,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:02,426 INFO L85 PathProgramCache]: Analyzing trace with hash -274081964, now seen corresponding path program 34 times [2025-03-13 21:50:02,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:02,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95527359] [2025-03-13 21:50:02,426 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:02,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:02,431 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:50:02,437 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:50:02,437 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:50:02,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:02,719 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-13 21:50:02,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:02,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95527359] [2025-03-13 21:50:02,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95527359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:02,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:02,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:50:02,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048303070] [2025-03-13 21:50:02,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:02,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:50:02,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:02,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:50:02,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:50:02,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-13 21:50:02,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 264 transitions, 2976 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-13 21:50:02,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:02,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-13 21:50:02,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:03,831 INFO L124 PetriNetUnfolderBase]: 4381/7427 cut-off events. [2025-03-13 21:50:03,831 INFO L125 PetriNetUnfolderBase]: For 209074/209074 co-relation queries the response was YES. [2025-03-13 21:50:03,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41146 conditions, 7427 events. 4381/7427 cut-off events. For 209074/209074 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 52014 event pairs, 1891 based on Foata normal form. 1/7253 useless extension candidates. Maximal degree in co-relation 41024. Up to 6270 conditions per place. [2025-03-13 21:50:03,914 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 299 selfloop transitions, 39 changer transitions 3/345 dead transitions. [2025-03-13 21:50:03,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 345 transitions, 4712 flow [2025-03-13 21:50:03,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:50:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:50:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2025-03-13 21:50:03,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45670995670995673 [2025-03-13 21:50:03,915 INFO L175 Difference]: Start difference. First operand has 269 places, 264 transitions, 2976 flow. Second operand 11 states and 211 transitions. [2025-03-13 21:50:03,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 345 transitions, 4712 flow [2025-03-13 21:50:04,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 345 transitions, 4378 flow, removed 151 selfloop flow, removed 5 redundant places. [2025-03-13 21:50:04,268 INFO L231 Difference]: Finished difference. Result has 279 places, 276 transitions, 3184 flow [2025-03-13 21:50:04,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2642, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3184, PETRI_PLACES=279, PETRI_TRANSITIONS=276} [2025-03-13 21:50:04,268 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 238 predicate places. [2025-03-13 21:50:04,268 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 276 transitions, 3184 flow [2025-03-13 21:50:04,268 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-13 21:50:04,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:04,269 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-13 21:50:04,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-13 21:50:04,269 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-13 21:50:04,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:04,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1639851014, now seen corresponding path program 35 times [2025-03-13 21:50:04,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:04,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600220304] [2025-03-13 21:50:04,269 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:50:04,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:04,274 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:50:04,280 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:50:04,280 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:04,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:04,527 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-13 21:50:04,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:04,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600220304] [2025-03-13 21:50:04,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600220304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:04,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:04,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:50:04,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954089971] [2025-03-13 21:50:04,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:04,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:50:04,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:04,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:50:04,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:50:04,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:50:04,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 276 transitions, 3184 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-13 21:50:04,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:04,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:50:04,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:05,640 INFO L124 PetriNetUnfolderBase]: 4244/7255 cut-off events. [2025-03-13 21:50:05,641 INFO L125 PetriNetUnfolderBase]: For 206970/206970 co-relation queries the response was YES. [2025-03-13 21:50:05,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40118 conditions, 7255 events. 4244/7255 cut-off events. For 206970/206970 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 51470 event pairs, 1916 based on Foata normal form. 1/7088 useless extension candidates. Maximal degree in co-relation 39990. Up to 6355 conditions per place. [2025-03-13 21:50:05,707 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 281 selfloop transitions, 35 changer transitions 4/325 dead transitions. [2025-03-13 21:50:05,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 325 transitions, 4322 flow [2025-03-13 21:50:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:50:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:50:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2025-03-13 21:50:05,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4155844155844156 [2025-03-13 21:50:05,708 INFO L175 Difference]: Start difference. First operand has 279 places, 276 transitions, 3184 flow. Second operand 11 states and 192 transitions. [2025-03-13 21:50:05,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 325 transitions, 4322 flow [2025-03-13 21:50:06,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 325 transitions, 3998 flow, removed 147 selfloop flow, removed 4 redundant places. [2025-03-13 21:50:06,137 INFO L231 Difference]: Finished difference. Result has 288 places, 282 transitions, 3115 flow [2025-03-13 21:50:06,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2860, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3115, PETRI_PLACES=288, PETRI_TRANSITIONS=282} [2025-03-13 21:50:06,137 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 247 predicate places. [2025-03-13 21:50:06,137 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 282 transitions, 3115 flow [2025-03-13 21:50:06,137 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-13 21:50:06,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:06,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-13 21:50:06,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-13 21:50:06,138 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-13 21:50:06,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:06,138 INFO L85 PathProgramCache]: Analyzing trace with hash 924128896, now seen corresponding path program 36 times [2025-03-13 21:50:06,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:06,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650582419] [2025-03-13 21:50:06,138 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:50:06,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:06,142 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:50:06,148 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:50:06,148 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:50:06,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:06,409 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-13 21:50:06,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:06,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650582419] [2025-03-13 21:50:06,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650582419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:06,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:06,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:50:06,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709585835] [2025-03-13 21:50:06,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:06,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:50:06,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:06,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:50:06,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:50:06,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:50:06,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 282 transitions, 3115 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-13 21:50:06,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:06,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:50:06,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:07,467 INFO L124 PetriNetUnfolderBase]: 4395/7499 cut-off events. [2025-03-13 21:50:07,467 INFO L125 PetriNetUnfolderBase]: For 208634/208634 co-relation queries the response was YES. [2025-03-13 21:50:07,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41009 conditions, 7499 events. 4395/7499 cut-off events. For 208634/208634 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 53567 event pairs, 1948 based on Foata normal form. 1/7336 useless extension candidates. Maximal degree in co-relation 40877. Up to 6379 conditions per place. [2025-03-13 21:50:07,554 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 292 selfloop transitions, 41 changer transitions 3/341 dead transitions. [2025-03-13 21:50:07,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 341 transitions, 4607 flow [2025-03-13 21:50:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:50:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:50:07,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2025-03-13 21:50:07,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-13 21:50:07,555 INFO L175 Difference]: Start difference. First operand has 288 places, 282 transitions, 3115 flow. Second operand 11 states and 203 transitions. [2025-03-13 21:50:07,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 341 transitions, 4607 flow [2025-03-13 21:50:08,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 341 transitions, 4389 flow, removed 90 selfloop flow, removed 6 redundant places. [2025-03-13 21:50:08,077 INFO L231 Difference]: Finished difference. Result has 295 places, 289 transitions, 3350 flow [2025-03-13 21:50:08,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2897, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3350, PETRI_PLACES=295, PETRI_TRANSITIONS=289} [2025-03-13 21:50:08,079 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 254 predicate places. [2025-03-13 21:50:08,079 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 289 transitions, 3350 flow [2025-03-13 21:50:08,079 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-13 21:50:08,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:08,079 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-13 21:50:08,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-13 21:50:08,079 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-13 21:50:08,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:08,080 INFO L85 PathProgramCache]: Analyzing trace with hash 770882024, now seen corresponding path program 37 times [2025-03-13 21:50:08,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:08,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303186564] [2025-03-13 21:50:08,080 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:50:08,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:08,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:50:08,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:50:08,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:08,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:08,506 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-13 21:50:08,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:08,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303186564] [2025-03-13 21:50:08,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303186564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:08,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:08,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:50:08,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931274336] [2025-03-13 21:50:08,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:08,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:50:08,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:08,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:50:08,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:50:08,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:50:08,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 289 transitions, 3350 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-13 21:50:08,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:08,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:50:08,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:09,643 INFO L124 PetriNetUnfolderBase]: 4458/7614 cut-off events. [2025-03-13 21:50:09,643 INFO L125 PetriNetUnfolderBase]: For 241409/241409 co-relation queries the response was YES. [2025-03-13 21:50:09,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42838 conditions, 7614 events. 4458/7614 cut-off events. For 241409/241409 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 54640 event pairs, 2030 based on Foata normal form. 1/7450 useless extension candidates. Maximal degree in co-relation 42702. Up to 6612 conditions per place. [2025-03-13 21:50:09,733 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 306 selfloop transitions, 34 changer transitions 3/348 dead transitions. [2025-03-13 21:50:09,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 348 transitions, 4787 flow [2025-03-13 21:50:09,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:50:09,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:50:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-03-13 21:50:09,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2025-03-13 21:50:09,734 INFO L175 Difference]: Start difference. First operand has 295 places, 289 transitions, 3350 flow. Second operand 11 states and 202 transitions. [2025-03-13 21:50:09,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 348 transitions, 4787 flow [2025-03-13 21:50:10,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 348 transitions, 4461 flow, removed 144 selfloop flow, removed 6 redundant places. [2025-03-13 21:50:10,187 INFO L231 Difference]: Finished difference. Result has 302 places, 294 transitions, 3338 flow [2025-03-13 21:50:10,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3028, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3338, PETRI_PLACES=302, PETRI_TRANSITIONS=294} [2025-03-13 21:50:10,187 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 261 predicate places. [2025-03-13 21:50:10,187 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 294 transitions, 3338 flow [2025-03-13 21:50:10,187 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-13 21:50:10,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:10,188 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-13 21:50:10,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-13 21:50:10,188 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-13 21:50:10,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:10,188 INFO L85 PathProgramCache]: Analyzing trace with hash 47756430, now seen corresponding path program 38 times [2025-03-13 21:50:10,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:10,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238546197] [2025-03-13 21:50:10,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:50:10,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:10,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:50:10,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:50:10,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:50:10,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:10,494 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-13 21:50:10,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:10,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238546197] [2025-03-13 21:50:10,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238546197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:10,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:10,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:50:10,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71606140] [2025-03-13 21:50:10,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:10,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:50:10,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:10,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:50:10,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:50:10,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:50:10,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 294 transitions, 3338 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-13 21:50:10,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:10,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:50:10,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:11,682 INFO L124 PetriNetUnfolderBase]: 4458/7606 cut-off events. [2025-03-13 21:50:11,682 INFO L125 PetriNetUnfolderBase]: For 230027/230027 co-relation queries the response was YES. [2025-03-13 21:50:11,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41705 conditions, 7606 events. 4458/7606 cut-off events. For 230027/230027 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 54561 event pairs, 2054 based on Foata normal form. 1/7446 useless extension candidates. Maximal degree in co-relation 41565. Up to 6689 conditions per place. [2025-03-13 21:50:11,811 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 302 selfloop transitions, 33 changer transitions 3/343 dead transitions. [2025-03-13 21:50:11,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 343 transitions, 4517 flow [2025-03-13 21:50:11,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:50:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:50:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-13 21:50:11,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2025-03-13 21:50:11,812 INFO L175 Difference]: Start difference. First operand has 302 places, 294 transitions, 3338 flow. Second operand 11 states and 193 transitions. [2025-03-13 21:50:11,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 343 transitions, 4517 flow [2025-03-13 21:50:12,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 343 transitions, 4272 flow, removed 105 selfloop flow, removed 6 redundant places. [2025-03-13 21:50:12,360 INFO L231 Difference]: Finished difference. Result has 308 places, 297 transitions, 3244 flow [2025-03-13 21:50:12,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3093, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3244, PETRI_PLACES=308, PETRI_TRANSITIONS=297} [2025-03-13 21:50:12,361 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 267 predicate places. [2025-03-13 21:50:12,361 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 297 transitions, 3244 flow [2025-03-13 21:50:12,361 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-13 21:50:12,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:12,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:12,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-13 21:50:12,361 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-13 21:50:12,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:12,362 INFO L85 PathProgramCache]: Analyzing trace with hash -546841244, now seen corresponding path program 39 times [2025-03-13 21:50:12,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:12,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285872055] [2025-03-13 21:50:12,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:50:12,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:12,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:50:12,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:50:12,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:50:12,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:12,659 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-13 21:50:12,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:12,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285872055] [2025-03-13 21:50:12,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285872055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:12,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:12,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:50:12,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918499000] [2025-03-13 21:50:12,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:12,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:50:12,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:12,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:50:12,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:50:12,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:50:12,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 297 transitions, 3244 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-13 21:50:12,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:12,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:50:12,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:13,867 INFO L124 PetriNetUnfolderBase]: 4521/7722 cut-off events. [2025-03-13 21:50:13,867 INFO L125 PetriNetUnfolderBase]: For 232723/232723 co-relation queries the response was YES. [2025-03-13 21:50:13,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42221 conditions, 7722 events. 4521/7722 cut-off events. For 232723/232723 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 55602 event pairs, 2100 based on Foata normal form. 1/7559 useless extension candidates. Maximal degree in co-relation 42078. Up to 6704 conditions per place. [2025-03-13 21:50:13,949 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 312 selfloop transitions, 35 changer transitions 3/355 dead transitions. [2025-03-13 21:50:13,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 355 transitions, 4712 flow [2025-03-13 21:50:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:50:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:50:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-03-13 21:50:13,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2025-03-13 21:50:13,950 INFO L175 Difference]: Start difference. First operand has 308 places, 297 transitions, 3244 flow. Second operand 11 states and 202 transitions. [2025-03-13 21:50:13,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 355 transitions, 4712 flow [2025-03-13 21:50:14,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 355 transitions, 4586 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-03-13 21:50:14,554 INFO L231 Difference]: Finished difference. Result has 313 places, 302 transitions, 3442 flow [2025-03-13 21:50:14,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3118, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3442, PETRI_PLACES=313, PETRI_TRANSITIONS=302} [2025-03-13 21:50:14,555 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 272 predicate places. [2025-03-13 21:50:14,555 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 302 transitions, 3442 flow [2025-03-13 21:50:14,555 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-13 21:50:14,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:14,555 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-13 21:50:14,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-13 21:50:14,556 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-13 21:50:14,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:14,556 INFO L85 PathProgramCache]: Analyzing trace with hash 801465006, now seen corresponding path program 40 times [2025-03-13 21:50:14,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:14,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614125207] [2025-03-13 21:50:14,556 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:14,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:14,561 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:50:14,567 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:50:14,567 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:50:14,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:14,794 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-13 21:50:14,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:14,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614125207] [2025-03-13 21:50:14,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614125207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:14,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:14,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:50:14,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045808137] [2025-03-13 21:50:14,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:14,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:50:14,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:14,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:50:14,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:50:14,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-13 21:50:14,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 302 transitions, 3442 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-13 21:50:14,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:14,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-13 21:50:14,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:16,109 INFO L124 PetriNetUnfolderBase]: 4748/8067 cut-off events. [2025-03-13 21:50:16,110 INFO L125 PetriNetUnfolderBase]: For 259442/259442 co-relation queries the response was YES. [2025-03-13 21:50:16,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44512 conditions, 8067 events. 4748/8067 cut-off events. For 259442/259442 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 57613 event pairs, 2165 based on Foata normal form. 1/7897 useless extension candidates. Maximal degree in co-relation 44366. Up to 6864 conditions per place. [2025-03-13 21:50:16,212 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 322 selfloop transitions, 41 changer transitions 5/372 dead transitions. [2025-03-13 21:50:16,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 372 transitions, 4873 flow [2025-03-13 21:50:16,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:50:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:50:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2025-03-13 21:50:16,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-03-13 21:50:16,213 INFO L175 Difference]: Start difference. First operand has 313 places, 302 transitions, 3442 flow. Second operand 11 states and 209 transitions. [2025-03-13 21:50:16,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 372 transitions, 4873 flow [2025-03-13 21:50:16,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 372 transitions, 4617 flow, removed 112 selfloop flow, removed 5 redundant places. [2025-03-13 21:50:16,868 INFO L231 Difference]: Finished difference. Result has 321 places, 307 transitions, 3413 flow [2025-03-13 21:50:16,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3186, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3413, PETRI_PLACES=321, PETRI_TRANSITIONS=307} [2025-03-13 21:50:16,869 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 280 predicate places. [2025-03-13 21:50:16,869 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 307 transitions, 3413 flow [2025-03-13 21:50:16,869 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-13 21:50:16,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:16,869 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-13 21:50:16,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-13 21:50:16,869 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-13 21:50:16,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:16,869 INFO L85 PathProgramCache]: Analyzing trace with hash -683604332, now seen corresponding path program 41 times [2025-03-13 21:50:16,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:16,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380433194] [2025-03-13 21:50:16,870 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:50:16,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:16,875 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:50:16,881 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:50:16,881 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:16,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:17,168 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-13 21:50:17,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:17,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380433194] [2025-03-13 21:50:17,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380433194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:17,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:17,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:50:17,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621732602] [2025-03-13 21:50:17,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:17,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:50:17,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:17,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:50:17,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:50:17,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:50:17,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 307 transitions, 3413 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-13 21:50:17,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:17,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:50:17,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:18,243 INFO L124 PetriNetUnfolderBase]: 4586/7862 cut-off events. [2025-03-13 21:50:18,243 INFO L125 PetriNetUnfolderBase]: For 231667/231667 co-relation queries the response was YES. [2025-03-13 21:50:18,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42404 conditions, 7862 events. 4586/7862 cut-off events. For 231667/231667 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 56875 event pairs, 2178 based on Foata normal form. 1/7694 useless extension candidates. Maximal degree in co-relation 42254. Up to 6930 conditions per place. [2025-03-13 21:50:18,341 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 309 selfloop transitions, 36 changer transitions 3/353 dead transitions. [2025-03-13 21:50:18,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 353 transitions, 4539 flow [2025-03-13 21:50:18,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:50:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:50:18,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2025-03-13 21:50:18,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4155844155844156 [2025-03-13 21:50:18,342 INFO L175 Difference]: Start difference. First operand has 321 places, 307 transitions, 3413 flow. Second operand 11 states and 192 transitions. [2025-03-13 21:50:18,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 353 transitions, 4539 flow [2025-03-13 21:50:18,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 353 transitions, 4344 flow, removed 65 selfloop flow, removed 6 redundant places. [2025-03-13 21:50:18,750 INFO L231 Difference]: Finished difference. Result has 327 places, 310 transitions, 3382 flow [2025-03-13 21:50:18,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3218, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3382, PETRI_PLACES=327, PETRI_TRANSITIONS=310} [2025-03-13 21:50:18,751 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 286 predicate places. [2025-03-13 21:50:18,751 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 310 transitions, 3382 flow [2025-03-13 21:50:18,751 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-13 21:50:18,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:18,751 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-13 21:50:18,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-13 21:50:18,751 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-13 21:50:18,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1398801664, now seen corresponding path program 42 times [2025-03-13 21:50:18,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:18,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336014210] [2025-03-13 21:50:18,752 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:50:18,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:18,756 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:50:18,761 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-13 21:50:18,762 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:50:18,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:18,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-13 21:50:18,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:18,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336014210] [2025-03-13 21:50:18,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336014210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:18,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:18,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:50:18,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970816964] [2025-03-13 21:50:18,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:18,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:50:18,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:18,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:50:18,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:50:18,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:50:18,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 310 transitions, 3382 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-13 21:50:18,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:18,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:50:18,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:20,427 INFO L124 PetriNetUnfolderBase]: 4586/7874 cut-off events. [2025-03-13 21:50:20,427 INFO L125 PetriNetUnfolderBase]: For 226022/226022 co-relation queries the response was YES. [2025-03-13 21:50:20,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41953 conditions, 7874 events. 4586/7874 cut-off events. For 226022/226022 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 57025 event pairs, 2138 based on Foata normal form. 1/7699 useless extension candidates. Maximal degree in co-relation 41801. Up to 6864 conditions per place. [2025-03-13 21:50:20,534 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 312 selfloop transitions, 40 changer transitions 4/361 dead transitions. [2025-03-13 21:50:20,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 361 transitions, 4555 flow [2025-03-13 21:50:20,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:50:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:50:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2025-03-13 21:50:20,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-13 21:50:20,535 INFO L175 Difference]: Start difference. First operand has 327 places, 310 transitions, 3382 flow. Second operand 11 states and 198 transitions. [2025-03-13 21:50:20,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 361 transitions, 4555 flow [2025-03-13 21:50:20,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 361 transitions, 4389 flow, removed 49 selfloop flow, removed 8 redundant places. [2025-03-13 21:50:20,943 INFO L231 Difference]: Finished difference. Result has 331 places, 314 transitions, 3404 flow [2025-03-13 21:50:20,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3216, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3404, PETRI_PLACES=331, PETRI_TRANSITIONS=314} [2025-03-13 21:50:20,944 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 290 predicate places. [2025-03-13 21:50:20,944 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 314 transitions, 3404 flow [2025-03-13 21:50:20,944 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-13 21:50:20,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:20,944 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-13 21:50:20,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-13 21:50:20,944 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-13 21:50:20,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:20,945 INFO L85 PathProgramCache]: Analyzing trace with hash -544438204, now seen corresponding path program 43 times [2025-03-13 21:50:20,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:20,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409184261] [2025-03-13 21:50:20,945 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:50:20,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:20,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:50:20,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:50:20,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:20,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:21,192 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-13 21:50:21,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:21,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409184261] [2025-03-13 21:50:21,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409184261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:21,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:21,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:50:21,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212367239] [2025-03-13 21:50:21,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:21,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:50:21,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:21,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:50:21,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:50:21,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:50:21,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 314 transitions, 3404 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-13 21:50:21,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:21,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:50:21,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:22,323 INFO L124 PetriNetUnfolderBase]: 4586/7868 cut-off events. [2025-03-13 21:50:22,323 INFO L125 PetriNetUnfolderBase]: For 225500/225500 co-relation queries the response was YES. [2025-03-13 21:50:22,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41921 conditions, 7868 events. 4586/7868 cut-off events. For 225500/225500 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 57000 event pairs, 2185 based on Foata normal form. 1/7695 useless extension candidates. Maximal degree in co-relation 41767. Up to 6942 conditions per place. [2025-03-13 21:50:22,439 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 315 selfloop transitions, 34 changer transitions 3/357 dead transitions. [2025-03-13 21:50:22,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 357 transitions, 4468 flow [2025-03-13 21:50:22,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:50:22,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:50:22,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2025-03-13 21:50:22,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-13 21:50:22,440 INFO L175 Difference]: Start difference. First operand has 331 places, 314 transitions, 3404 flow. Second operand 11 states and 189 transitions. [2025-03-13 21:50:22,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 357 transitions, 4468 flow [2025-03-13 21:50:23,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 357 transitions, 4282 flow, removed 55 selfloop flow, removed 8 redundant places. [2025-03-13 21:50:23,005 INFO L231 Difference]: Finished difference. Result has 335 places, 316 transitions, 3310 flow [2025-03-13 21:50:23,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3218, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3310, PETRI_PLACES=335, PETRI_TRANSITIONS=316} [2025-03-13 21:50:23,005 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 294 predicate places. [2025-03-13 21:50:23,005 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 316 transitions, 3310 flow [2025-03-13 21:50:23,005 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-13 21:50:23,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:23,005 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-13 21:50:23,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-13 21:50:23,005 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-13 21:50:23,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:23,006 INFO L85 PathProgramCache]: Analyzing trace with hash 916041962, now seen corresponding path program 1 times [2025-03-13 21:50:23,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:23,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405571932] [2025-03-13 21:50:23,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:50:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:23,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:50:23,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:50:23,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:23,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:23,055 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-13 21:50:23,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:23,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405571932] [2025-03-13 21:50:23,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405571932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:23,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965815800] [2025-03-13 21:50:23,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:50:23,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:23,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:23,058 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-13 21:50:23,059 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-13 21:50:23,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:50:23,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:50:23,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:23,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:23,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:50:23,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:23,249 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-13 21:50:23,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:23,330 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-13 21:50:23,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965815800] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:23,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:23,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-13 21:50:23,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523544746] [2025-03-13 21:50:23,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:23,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:50:23,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:23,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:50:23,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:50:23,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-13 21:50:23,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 316 transitions, 3310 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-13 21:50:23,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:23,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-13 21:50:23,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:25,149 INFO L124 PetriNetUnfolderBase]: 7743/13966 cut-off events. [2025-03-13 21:50:25,149 INFO L125 PetriNetUnfolderBase]: For 474128/474416 co-relation queries the response was YES. [2025-03-13 21:50:25,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75827 conditions, 13966 events. 7743/13966 cut-off events. For 474128/474416 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 117793 event pairs, 4670 based on Foata normal form. 292/13813 useless extension candidates. Maximal degree in co-relation 75671. Up to 6301 conditions per place. [2025-03-13 21:50:25,373 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 530 selfloop transitions, 6 changer transitions 12/592 dead transitions. [2025-03-13 21:50:25,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 592 transitions, 7392 flow [2025-03-13 21:50:25,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:50:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:50:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2025-03-13 21:50:25,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-03-13 21:50:25,374 INFO L175 Difference]: Start difference. First operand has 335 places, 316 transitions, 3310 flow. Second operand 7 states and 133 transitions. [2025-03-13 21:50:25,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 592 transitions, 7392 flow [2025-03-13 21:50:26,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 592 transitions, 7260 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-03-13 21:50:26,254 INFO L231 Difference]: Finished difference. Result has 337 places, 320 transitions, 3302 flow [2025-03-13 21:50:26,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3244, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3302, PETRI_PLACES=337, PETRI_TRANSITIONS=320} [2025-03-13 21:50:26,254 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 296 predicate places. [2025-03-13 21:50:26,254 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 320 transitions, 3302 flow [2025-03-13 21:50:26,255 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-13 21:50:26,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:26,255 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-13 21:50:26,261 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-13 21:50:26,455 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-13 21:50:26,455 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-13 21:50:26,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:26,456 INFO L85 PathProgramCache]: Analyzing trace with hash 874807726, now seen corresponding path program 1 times [2025-03-13 21:50:26,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:26,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353511801] [2025-03-13 21:50:26,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:50:26,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:26,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:50:26,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:50:26,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:26,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:26,510 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-13 21:50:26,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:26,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353511801] [2025-03-13 21:50:26,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353511801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:26,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326445791] [2025-03-13 21:50:26,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:50:26,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:26,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:26,513 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-13 21:50:26,513 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-13 21:50:26,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:50:26,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:50:26,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:26,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:26,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:50:26,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:50:26,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:50:26,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326445791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:26,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:50:26,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-13 21:50:26,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920383355] [2025-03-13 21:50:26,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:26,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:50:26,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:26,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:50:26,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:50:26,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-13 21:50:26,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 320 transitions, 3302 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-13 21:50:26,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:26,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-13 21:50:26,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:29,089 INFO L124 PetriNetUnfolderBase]: 8576/15703 cut-off events. [2025-03-13 21:50:29,089 INFO L125 PetriNetUnfolderBase]: For 682206/684276 co-relation queries the response was YES. [2025-03-13 21:50:29,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87541 conditions, 15703 events. 8576/15703 cut-off events. For 682206/684276 co-relation queries the response was YES. Maximal size of possible extension queue 1358. Compared 137923 event pairs, 3238 based on Foata normal form. 894/16140 useless extension candidates. Maximal degree in co-relation 87381. Up to 6797 conditions per place. [2025-03-13 21:50:29,335 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 423 selfloop transitions, 34 changer transitions 0/501 dead transitions. [2025-03-13 21:50:29,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 501 transitions, 6416 flow [2025-03-13 21:50:29,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:50:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:50:29,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-13 21:50:29,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-03-13 21:50:29,336 INFO L175 Difference]: Start difference. First operand has 337 places, 320 transitions, 3302 flow. Second operand 4 states and 106 transitions. [2025-03-13 21:50:29,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 501 transitions, 6416 flow [2025-03-13 21:50:30,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 501 transitions, 6393 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-03-13 21:50:30,623 INFO L231 Difference]: Finished difference. Result has 339 places, 331 transitions, 3697 flow [2025-03-13 21:50:30,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3227, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3697, PETRI_PLACES=339, PETRI_TRANSITIONS=331} [2025-03-13 21:50:30,624 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 298 predicate places. [2025-03-13 21:50:30,624 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 331 transitions, 3697 flow [2025-03-13 21:50:30,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-13 21:50:30,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:30,624 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:30,629 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-13 21:50:30,824 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-13 21:50:30,825 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-13 21:50:30,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:30,825 INFO L85 PathProgramCache]: Analyzing trace with hash 833299377, now seen corresponding path program 2 times [2025-03-13 21:50:30,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:30,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833369964] [2025-03-13 21:50:30,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:50:30,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:30,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-13 21:50:30,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 35 statements. [2025-03-13 21:50:30,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:50:30,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:50:31,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:31,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833369964] [2025-03-13 21:50:31,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833369964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:31,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:50:31,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:50:31,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136772108] [2025-03-13 21:50:31,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:31,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:50:31,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:31,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:50:31,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:50:31,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-13 21:50:31,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 331 transitions, 3697 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-13 21:50:31,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:31,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-13 21:50:31,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:33,794 INFO L124 PetriNetUnfolderBase]: 10183/18230 cut-off events. [2025-03-13 21:50:33,795 INFO L125 PetriNetUnfolderBase]: For 779977/781855 co-relation queries the response was YES. [2025-03-13 21:50:34,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106123 conditions, 18230 events. 10183/18230 cut-off events. For 779977/781855 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 156568 event pairs, 4592 based on Foata normal form. 129/18114 useless extension candidates. Maximal degree in co-relation 105962. Up to 15449 conditions per place. [2025-03-13 21:50:34,062 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 324 selfloop transitions, 6 changer transitions 0/373 dead transitions. [2025-03-13 21:50:34,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 373 transitions, 4797 flow [2025-03-13 21:50:34,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:50:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:50:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2025-03-13 21:50:34,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-13 21:50:34,063 INFO L175 Difference]: Start difference. First operand has 339 places, 331 transitions, 3697 flow. Second operand 5 states and 112 transitions. [2025-03-13 21:50:34,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 373 transitions, 4797 flow [2025-03-13 21:50:35,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 373 transitions, 4618 flow, removed 79 selfloop flow, removed 5 redundant places. [2025-03-13 21:50:35,828 INFO L231 Difference]: Finished difference. Result has 339 places, 333 transitions, 3558 flow [2025-03-13 21:50:35,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3532, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3558, PETRI_PLACES=339, PETRI_TRANSITIONS=333} [2025-03-13 21:50:35,829 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 298 predicate places. [2025-03-13 21:50:35,829 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 333 transitions, 3558 flow [2025-03-13 21:50:35,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-13 21:50:35,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:35,829 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-13 21:50:35,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-13 21:50:35,829 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-13 21:50:35,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:35,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1494129970, now seen corresponding path program 1 times [2025-03-13 21:50:35,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:35,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277480810] [2025-03-13 21:50:35,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:50:35,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:35,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:50:35,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:50:35,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:35,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:35,898 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-13 21:50:35,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:35,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277480810] [2025-03-13 21:50:35,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277480810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:35,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449267346] [2025-03-13 21:50:35,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:50:35,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:35,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:35,902 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-13 21:50:35,914 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-13 21:50:36,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:50:36,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:50:36,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:36,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:36,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:50:36,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:36,055 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-13 21:50:36,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:50:36,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449267346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:50:36,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:50:36,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-13 21:50:36,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728373212] [2025-03-13 21:50:36,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:36,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:50:36,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:36,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:50:36,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:50:36,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-13 21:50:36,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 333 transitions, 3558 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-13 21:50:36,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:36,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-13 21:50:36,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:38,262 INFO L124 PetriNetUnfolderBase]: 7149/13451 cut-off events. [2025-03-13 21:50:38,262 INFO L125 PetriNetUnfolderBase]: For 643500/647820 co-relation queries the response was YES. [2025-03-13 21:50:38,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87090 conditions, 13451 events. 7149/13451 cut-off events. For 643500/647820 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 111989 event pairs, 3503 based on Foata normal form. 907/14315 useless extension candidates. Maximal degree in co-relation 86932. Up to 6218 conditions per place. [2025-03-13 21:50:38,442 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 101 selfloop transitions, 9 changer transitions 136/252 dead transitions. [2025-03-13 21:50:38,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 252 transitions, 3723 flow [2025-03-13 21:50:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:50:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:50:38,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-13 21:50:38,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-13 21:50:38,443 INFO L175 Difference]: Start difference. First operand has 339 places, 333 transitions, 3558 flow. Second operand 4 states and 112 transitions. [2025-03-13 21:50:38,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 252 transitions, 3723 flow [2025-03-13 21:50:40,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 252 transitions, 3516 flow, removed 15 selfloop flow, removed 19 redundant places. [2025-03-13 21:50:40,034 INFO L231 Difference]: Finished difference. Result has 325 places, 64 transitions, 905 flow [2025-03-13 21:50:40,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2105, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=905, PETRI_PLACES=325, PETRI_TRANSITIONS=64} [2025-03-13 21:50:40,034 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 284 predicate places. [2025-03-13 21:50:40,035 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 64 transitions, 905 flow [2025-03-13 21:50:40,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-13 21:50:40,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:40,035 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:40,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 21:50:40,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:40,239 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:50:40,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:40,240 INFO L85 PathProgramCache]: Analyzing trace with hash 178971151, now seen corresponding path program 1 times [2025-03-13 21:50:40,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:40,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238417688] [2025-03-13 21:50:40,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:50:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:40,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 21:50:40,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:50:40,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:40,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:50:40,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:40,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238417688] [2025-03-13 21:50:40,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238417688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:40,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092577905] [2025-03-13 21:50:40,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:50:40,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:40,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:40,460 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:40,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:50:40,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 21:50:40,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:50:40,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:40,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:40,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:50:40,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:50:40,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:40,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:50:40,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092577905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:40,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:40,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-13 21:50:40,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518051343] [2025-03-13 21:50:40,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:40,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:50:40,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:40,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:50:40,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:50:40,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-13 21:50:40,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 64 transitions, 905 flow. Second operand has 12 states, 12 states have (on average 13.583333333333334) internal successors, (163), 12 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:40,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:40,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-13 21:50:40,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:42,312 INFO L124 PetriNetUnfolderBase]: 6401/10798 cut-off events. [2025-03-13 21:50:42,312 INFO L125 PetriNetUnfolderBase]: For 731589/735909 co-relation queries the response was YES. [2025-03-13 21:50:42,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87536 conditions, 10798 events. 6401/10798 cut-off events. For 731589/735909 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 71483 event pairs, 4332 based on Foata normal form. 195/10988 useless extension candidates. Maximal degree in co-relation 87389. Up to 7143 conditions per place. [2025-03-13 21:50:42,440 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 56 selfloop transitions, 3 changer transitions 59/124 dead transitions. [2025-03-13 21:50:42,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 124 transitions, 1903 flow [2025-03-13 21:50:42,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:50:42,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:50:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2025-03-13 21:50:42,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-03-13 21:50:42,441 INFO L175 Difference]: Start difference. First operand has 325 places, 64 transitions, 905 flow. Second operand 6 states and 120 transitions. [2025-03-13 21:50:42,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 124 transitions, 1903 flow [2025-03-13 21:50:43,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 124 transitions, 946 flow, removed 271 selfloop flow, removed 112 redundant places. [2025-03-13 21:50:43,123 INFO L231 Difference]: Finished difference. Result has 93 places, 65 transitions, 382 flow [2025-03-13 21:50:43,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=382, PETRI_PLACES=93, PETRI_TRANSITIONS=65} [2025-03-13 21:50:43,123 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 52 predicate places. [2025-03-13 21:50:43,123 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 65 transitions, 382 flow [2025-03-13 21:50:43,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.583333333333334) internal successors, (163), 12 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:43,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:43,123 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:43,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:50:43,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:43,324 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:50:43,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:43,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1362058746, now seen corresponding path program 2 times [2025-03-13 21:50:43,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:43,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048272575] [2025-03-13 21:50:43,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:50:43,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:43,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-13 21:50:43,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:50:43,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:43,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:43,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:43,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048272575] [2025-03-13 21:50:43,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048272575] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:43,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450611639] [2025-03-13 21:50:43,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:50:43,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:43,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:43,747 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:43,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:50:43,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-13 21:50:43,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:50:43,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:43,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:43,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-13 21:50:43,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:44,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2025-03-13 21:50:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:44,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:44,143 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-13 21:50:44,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2025-03-13 21:50:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:50:44,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450611639] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:44,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:44,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 27 [2025-03-13 21:50:44,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557035869] [2025-03-13 21:50:44,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:44,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-13 21:50:44,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:44,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-13 21:50:44,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2025-03-13 21:50:44,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 42 [2025-03-13 21:50:44,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 65 transitions, 382 flow. Second operand has 28 states, 28 states have (on average 8.535714285714286) internal successors, (239), 28 states have internal predecessors, (239), 0 states have call successors, (0), 0 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-13 21:50:44,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:44,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 42 [2025-03-13 21:50:44,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand