./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 735b3cc8 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-?-735b3cc-m [2025-03-14 01:08:15,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:08:15,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:08:15,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:08:15,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:08:15,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:08:15,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:08:15,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:08:15,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:08:15,634 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:08:15,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:08:15,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:08:15,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:08:15,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:08:15,634 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:08:15,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:08:15,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:08:15,634 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:08:15,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:08:15,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:08:15,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:08:15,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:08:15,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:08:15,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:08:15,636 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:08:15,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:08:15,636 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:08:15,636 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:08:15,637 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:08:15,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:08:15,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:08:15,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:08:15,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:08:15,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:08:15,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:08:15,638 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:08:15,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:08:15,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:08:15,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:08:15,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:08:15,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:08:15,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:08:15,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:08:15,638 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-14 01:08:15,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:08:15,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:08:15,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:08:15,868 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:08:15,868 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:08:15,869 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-14 01:08:16,989 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae2a2351f/85a955c770ab4fab90050a6de18f295a/FLAGda0f78e67 [2025-03-14 01:08:17,198 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:08:17,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-03-14 01:08:17,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae2a2351f/85a955c770ab4fab90050a6de18f295a/FLAGda0f78e67 [2025-03-14 01:08:17,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae2a2351f/85a955c770ab4fab90050a6de18f295a [2025-03-14 01:08:17,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:08:17,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:08:17,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:08:17,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:08:17,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:08:17,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:08:17" (1/1) ... [2025-03-14 01:08:17,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a292954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:17, skipping insertion in model container [2025-03-14 01:08:17,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:08:17" (1/1) ... [2025-03-14 01:08:17,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:08:17,709 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-14 01:08:17,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:08:17,731 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:08:17,749 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-14 01:08:17,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:08:17,769 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:08:17,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:17 WrapperNode [2025-03-14 01:08:17,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:08:17,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:08:17,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:08:17,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:08:17,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:17" (1/1) ... [2025-03-14 01:08:17,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:17" (1/1) ... [2025-03-14 01:08:17,807 INFO L138 Inliner]: procedures = 25, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 237 [2025-03-14 01:08:17,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:08:17,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:08:17,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:08:17,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:08:17,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:17" (1/1) ... [2025-03-14 01:08:17,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:17" (1/1) ... [2025-03-14 01:08:17,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:17" (1/1) ... [2025-03-14 01:08:17,838 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-14 01:08:17,838 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:17" (1/1) ... [2025-03-14 01:08:17,838 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:17" (1/1) ... [2025-03-14 01:08:17,843 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:17" (1/1) ... [2025-03-14 01:08:17,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:17" (1/1) ... [2025-03-14 01:08:17,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:17" (1/1) ... [2025-03-14 01:08:17,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:17" (1/1) ... [2025-03-14 01:08:17,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:08:17,847 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:08:17,847 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:08:17,848 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:08:17,848 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:17" (1/1) ... [2025-03-14 01:08:17,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:08:17,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:17,871 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-14 01:08:17,873 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-14 01:08:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:08:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:08:17,890 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:08:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:08:17,890 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:08:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:08:17,890 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:08:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:08:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:08:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:08:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:08:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:08:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:08:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:08:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:08:17,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:08:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:08:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:08:17,892 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:08:17,976 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:08:17,978 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:08:18,269 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:08:18,270 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:08:18,270 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:08:18,556 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:08:18,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:08:18 BoogieIcfgContainer [2025-03-14 01:08:18,557 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:08:18,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:08:18,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:08:18,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:08:18,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:08:17" (1/3) ... [2025-03-14 01:08:18,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2df3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:08:18, skipping insertion in model container [2025-03-14 01:08:18,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:17" (2/3) ... [2025-03-14 01:08:18,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2df3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:08:18, skipping insertion in model container [2025-03-14 01:08:18,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:08:18" (3/3) ... [2025-03-14 01:08:18,564 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2025-03-14 01:08:18,576 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:08:18,579 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-14 01:08:18,580 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:08:18,618 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:08:18,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 42 transitions, 105 flow [2025-03-14 01:08:18,666 INFO L124 PetriNetUnfolderBase]: 7/39 cut-off events. [2025-03-14 01:08:18,667 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:08:18,671 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-14 01:08:18,671 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 42 transitions, 105 flow [2025-03-14 01:08:18,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 38 transitions, 94 flow [2025-03-14 01:08:18,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:08:18,695 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;@37007467, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:08:18,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 01:08:18,707 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:08:18,707 INFO L124 PetriNetUnfolderBase]: 7/37 cut-off events. [2025-03-14 01:08:18,707 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:08:18,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:18,708 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-14 01:08:18,708 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-14 01:08:18,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:18,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1624782182, now seen corresponding path program 1 times [2025-03-14 01:08:18,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:18,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271068169] [2025-03-14 01:08:18,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:08:18,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:18,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:08:18,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:08:18,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:18,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:18,874 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-14 01:08:18,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:18,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271068169] [2025-03-14 01:08:18,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271068169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:18,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:18,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:08:18,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002990986] [2025-03-14 01:08:18,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:18,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:08:18,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:18,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:08:18,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:08:18,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-14 01:08:18,906 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-14 01:08:18,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:18,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-14 01:08:18,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:19,147 INFO L124 PetriNetUnfolderBase]: 1088/1694 cut-off events. [2025-03-14 01:08:19,147 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-14 01:08:19,153 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-14 01:08:19,161 INFO L140 encePairwiseOnDemand]: 40/42 looper letters, 30 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2025-03-14 01:08:19,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 150 flow [2025-03-14 01:08:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:08:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:08:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2025-03-14 01:08:19,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-03-14 01:08:19,176 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 94 flow. Second operand 2 states and 50 transitions. [2025-03-14 01:08:19,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 150 flow [2025-03-14 01:08:19,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 138 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:08:19,184 INFO L231 Difference]: Finished difference. Result has 36 places, 36 transitions, 78 flow [2025-03-14 01:08:19,186 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-14 01:08:19,190 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2025-03-14 01:08:19,190 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 78 flow [2025-03-14 01:08:19,190 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-14 01:08:19,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:19,190 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-14 01:08:19,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:08:19,191 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-14 01:08:19,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:19,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1086528074, now seen corresponding path program 1 times [2025-03-14 01:08:19,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:19,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933114644] [2025-03-14 01:08:19,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:08:19,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:19,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 01:08:19,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:08:19,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:19,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:19,495 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-14 01:08:19,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:19,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933114644] [2025-03-14 01:08:19,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933114644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:19,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:19,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:08:19,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169403709] [2025-03-14 01:08:19,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:19,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:08:19,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:19,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:08:19,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:08:19,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-14 01:08:19,498 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-14 01:08:19,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:19,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-14 01:08:19,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:19,710 INFO L124 PetriNetUnfolderBase]: 1209/1910 cut-off events. [2025-03-14 01:08:19,710 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 01:08:19,714 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-14 01:08:19,720 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 29 selfloop transitions, 2 changer transitions 18/55 dead transitions. [2025-03-14 01:08:19,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 217 flow [2025-03-14 01:08:19,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:08:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:08:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-03-14 01:08:19,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2025-03-14 01:08:19,724 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 78 flow. Second operand 5 states and 97 transitions. [2025-03-14 01:08:19,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 217 flow [2025-03-14 01:08:19,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 217 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:08:19,726 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 100 flow [2025-03-14 01:08:19,727 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-14 01:08:19,727 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2025-03-14 01:08:19,727 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 100 flow [2025-03-14 01:08:19,728 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-14 01:08:19,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:19,728 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-14 01:08:19,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:08:19,729 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-14 01:08:19,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash 737147797, now seen corresponding path program 1 times [2025-03-14 01:08:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:19,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908744898] [2025-03-14 01:08:19,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:08:19,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:19,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:08:19,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:08:19,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:19,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:19,896 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-14 01:08:19,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:19,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908744898] [2025-03-14 01:08:19,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908744898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:19,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:19,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:08:19,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486502551] [2025-03-14 01:08:19,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:19,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:08:19,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:19,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:08:19,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:08:19,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-14 01:08:19,898 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-14 01:08:19,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:19,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-14 01:08:19,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:20,131 INFO L124 PetriNetUnfolderBase]: 1288/2024 cut-off events. [2025-03-14 01:08:20,132 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2025-03-14 01:08:20,136 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-14 01:08:20,144 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 30 selfloop transitions, 2 changer transitions 17/55 dead transitions. [2025-03-14 01:08:20,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 248 flow [2025-03-14 01:08:20,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:08:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:08:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-03-14 01:08:20,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2025-03-14 01:08:20,147 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 100 flow. Second operand 4 states and 86 transitions. [2025-03-14 01:08:20,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 248 flow [2025-03-14 01:08:20,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 236 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-14 01:08:20,149 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 108 flow [2025-03-14 01:08:20,149 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-14 01:08:20,149 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2025-03-14 01:08:20,149 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 108 flow [2025-03-14 01:08:20,150 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-14 01:08:20,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:20,150 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-14 01:08:20,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:08:20,151 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-14 01:08:20,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:20,151 INFO L85 PathProgramCache]: Analyzing trace with hash 855943922, now seen corresponding path program 1 times [2025-03-14 01:08:20,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:20,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199391489] [2025-03-14 01:08:20,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:08:20,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:20,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:08:20,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:20,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:20,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:21,149 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-14 01:08:21,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:21,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199391489] [2025-03-14 01:08:21,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199391489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:21,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:21,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:21,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629081601] [2025-03-14 01:08:21,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:21,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:21,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:21,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:21,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:21,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:21,192 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-14 01:08:21,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:21,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:21,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:21,790 INFO L124 PetriNetUnfolderBase]: 1957/3008 cut-off events. [2025-03-14 01:08:21,791 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2025-03-14 01:08:21,796 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-14 01:08:21,807 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 102 selfloop transitions, 27 changer transitions 3/137 dead transitions. [2025-03-14 01:08:21,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 137 transitions, 645 flow [2025-03-14 01:08:21,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:08:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:08:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 227 transitions. [2025-03-14 01:08:21,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4503968253968254 [2025-03-14 01:08:21,809 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 108 flow. Second operand 12 states and 227 transitions. [2025-03-14 01:08:21,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 137 transitions, 645 flow [2025-03-14 01:08:21,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 137 transitions, 641 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:08:21,812 INFO L231 Difference]: Finished difference. Result has 59 places, 63 transitions, 256 flow [2025-03-14 01:08:21,812 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-14 01:08:21,812 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2025-03-14 01:08:21,812 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 256 flow [2025-03-14 01:08:21,812 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-14 01:08:21,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:21,813 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-14 01:08:21,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:08:21,813 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-14 01:08:21,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:21,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1633324682, now seen corresponding path program 2 times [2025-03-14 01:08:21,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:21,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752457302] [2025-03-14 01:08:21,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:08:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:21,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:21,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:21,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:08:21,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:21,875 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-14 01:08:21,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:21,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752457302] [2025-03-14 01:08:21,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752457302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:21,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:21,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:08:21,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053704491] [2025-03-14 01:08:21,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:21,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:08:21,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:21,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:08:21,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:08:21,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-14 01:08:21,877 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-14 01:08:21,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:21,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-14 01:08:21,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:22,059 INFO L124 PetriNetUnfolderBase]: 1549/2450 cut-off events. [2025-03-14 01:08:22,062 INFO L125 PetriNetUnfolderBase]: For 1602/1623 co-relation queries the response was YES. [2025-03-14 01:08:22,082 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-14 01:08:22,092 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 69 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2025-03-14 01:08:22,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 458 flow [2025-03-14 01:08:22,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:08:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:08:22,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-14 01:08:22,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2025-03-14 01:08:22,095 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 256 flow. Second operand 3 states and 71 transitions. [2025-03-14 01:08:22,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 458 flow [2025-03-14 01:08:22,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 79 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:08:22,100 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 272 flow [2025-03-14 01:08:22,100 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-14 01:08:22,100 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2025-03-14 01:08:22,100 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 272 flow [2025-03-14 01:08:22,104 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-14 01:08:22,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:22,105 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-14 01:08:22,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:08:22,105 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-14 01:08:22,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash -514924666, now seen corresponding path program 3 times [2025-03-14 01:08:22,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:22,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564993150] [2025-03-14 01:08:22,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:08:22,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:22,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:22,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:22,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:08:22,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:22,178 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-14 01:08:22,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:22,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564993150] [2025-03-14 01:08:22,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564993150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:22,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:22,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:08:22,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646812706] [2025-03-14 01:08:22,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:22,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:08:22,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:22,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:08:22,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:08:22,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-14 01:08:22,181 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-14 01:08:22,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:22,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-14 01:08:22,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:22,342 INFO L124 PetriNetUnfolderBase]: 1191/1960 cut-off events. [2025-03-14 01:08:22,342 INFO L125 PetriNetUnfolderBase]: For 1930/1931 co-relation queries the response was YES. [2025-03-14 01:08:22,346 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-14 01:08:22,354 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 70 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2025-03-14 01:08:22,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 482 flow [2025-03-14 01:08:22,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:08:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:08:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-14 01:08:22,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-14 01:08:22,356 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 272 flow. Second operand 3 states and 70 transitions. [2025-03-14 01:08:22,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 482 flow [2025-03-14 01:08:22,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 459 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-14 01:08:22,380 INFO L231 Difference]: Finished difference. Result has 60 places, 63 transitions, 260 flow [2025-03-14 01:08:22,380 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-14 01:08:22,380 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2025-03-14 01:08:22,380 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 63 transitions, 260 flow [2025-03-14 01:08:22,381 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-14 01:08:22,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:22,382 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-14 01:08:22,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:08:22,382 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-14 01:08:22,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:22,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1795163178, now seen corresponding path program 4 times [2025-03-14 01:08:22,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:22,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127436292] [2025-03-14 01:08:22,383 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:08:22,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:22,391 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:22,429 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:22,430 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:08:22,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:22,978 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-14 01:08:22,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:22,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127436292] [2025-03-14 01:08:22,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127436292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:22,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:22,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:22,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240522816] [2025-03-14 01:08:22,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:22,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:22,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:22,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:22,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:23,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-14 01:08:23,009 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-14 01:08:23,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:23,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-14 01:08:23,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:23,540 INFO L124 PetriNetUnfolderBase]: 1610/2584 cut-off events. [2025-03-14 01:08:23,542 INFO L125 PetriNetUnfolderBase]: For 1962/1962 co-relation queries the response was YES. [2025-03-14 01:08:23,547 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-14 01:08:23,558 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 95 selfloop transitions, 28 changer transitions 3/130 dead transitions. [2025-03-14 01:08:23,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 130 transitions, 782 flow [2025-03-14 01:08:23,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions. [2025-03-14 01:08:23,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4025974025974026 [2025-03-14 01:08:23,560 INFO L175 Difference]: Start difference. First operand has 60 places, 63 transitions, 260 flow. Second operand 11 states and 186 transitions. [2025-03-14 01:08:23,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 130 transitions, 782 flow [2025-03-14 01:08:23,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 130 transitions, 763 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-14 01:08:23,564 INFO L231 Difference]: Finished difference. Result has 73 places, 78 transitions, 418 flow [2025-03-14 01:08:23,564 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-14 01:08:23,565 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2025-03-14 01:08:23,565 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 78 transitions, 418 flow [2025-03-14 01:08:23,566 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-14 01:08:23,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:23,566 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-14 01:08:23,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:08:23,566 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-14 01:08:23,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:23,566 INFO L85 PathProgramCache]: Analyzing trace with hash -936356474, now seen corresponding path program 5 times [2025-03-14 01:08:23,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:23,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544489337] [2025-03-14 01:08:23,566 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:08:23,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:23,582 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:23,605 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:23,606 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:23,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:24,179 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-14 01:08:24,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:24,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544489337] [2025-03-14 01:08:24,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544489337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:24,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:24,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:24,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100336318] [2025-03-14 01:08:24,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:24,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:24,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:24,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:24,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:24,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:24,213 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-14 01:08:24,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:24,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:24,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:24,599 INFO L124 PetriNetUnfolderBase]: 1516/2485 cut-off events. [2025-03-14 01:08:24,599 INFO L125 PetriNetUnfolderBase]: For 3117/3117 co-relation queries the response was YES. [2025-03-14 01:08:24,606 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-14 01:08:24,617 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 104 selfloop transitions, 34 changer transitions 3/146 dead transitions. [2025-03-14 01:08:24,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 146 transitions, 1004 flow [2025-03-14 01:08:24,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-03-14 01:08:24,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2025-03-14 01:08:24,619 INFO L175 Difference]: Start difference. First operand has 73 places, 78 transitions, 418 flow. Second operand 11 states and 202 transitions. [2025-03-14 01:08:24,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 146 transitions, 1004 flow [2025-03-14 01:08:24,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 146 transitions, 971 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-14 01:08:24,626 INFO L231 Difference]: Finished difference. Result has 88 places, 92 transitions, 615 flow [2025-03-14 01:08:24,627 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-14 01:08:24,632 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2025-03-14 01:08:24,632 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 92 transitions, 615 flow [2025-03-14 01:08:24,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:24,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:24,632 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-14 01:08:24,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:08:24,632 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-14 01:08:24,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:24,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1734295744, now seen corresponding path program 6 times [2025-03-14 01:08:24,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:24,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900655477] [2025-03-14 01:08:24,633 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:08:24,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:24,642 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:24,660 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:24,660 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:08:24,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:25,139 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-14 01:08:25,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:25,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900655477] [2025-03-14 01:08:25,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900655477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:25,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:25,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:25,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456170226] [2025-03-14 01:08:25,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:25,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:25,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:25,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:25,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:25,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:25,170 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-14 01:08:25,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:25,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:25,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:25,693 INFO L124 PetriNetUnfolderBase]: 1683/2795 cut-off events. [2025-03-14 01:08:25,693 INFO L125 PetriNetUnfolderBase]: For 6169/6169 co-relation queries the response was YES. [2025-03-14 01:08:25,701 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-14 01:08:25,709 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 118 selfloop transitions, 45 changer transitions 3/171 dead transitions. [2025-03-14 01:08:25,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 171 transitions, 1292 flow [2025-03-14 01:08:25,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:08:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:08:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions. [2025-03-14 01:08:25,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2025-03-14 01:08:25,710 INFO L175 Difference]: Start difference. First operand has 88 places, 92 transitions, 615 flow. Second operand 12 states and 225 transitions. [2025-03-14 01:08:25,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 171 transitions, 1292 flow [2025-03-14 01:08:25,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 171 transitions, 1260 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-03-14 01:08:25,725 INFO L231 Difference]: Finished difference. Result has 101 places, 101 transitions, 772 flow [2025-03-14 01:08:25,725 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-14 01:08:25,726 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2025-03-14 01:08:25,726 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 101 transitions, 772 flow [2025-03-14 01:08:25,726 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-14 01:08:25,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:25,726 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-14 01:08:25,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:08:25,727 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-14 01:08:25,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:25,729 INFO L85 PathProgramCache]: Analyzing trace with hash -28524596, now seen corresponding path program 7 times [2025-03-14 01:08:25,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:25,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124994371] [2025-03-14 01:08:25,729 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:08:25,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:25,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:08:25,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:25,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:25,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:26,208 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-14 01:08:26,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:26,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124994371] [2025-03-14 01:08:26,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124994371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:26,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:26,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:26,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146686850] [2025-03-14 01:08:26,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:26,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:26,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:26,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:26,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:26,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:26,249 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-14 01:08:26,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:26,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:26,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:26,726 INFO L124 PetriNetUnfolderBase]: 1787/2998 cut-off events. [2025-03-14 01:08:26,727 INFO L125 PetriNetUnfolderBase]: For 9036/9036 co-relation queries the response was YES. [2025-03-14 01:08:26,733 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-14 01:08:26,739 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 125 selfloop transitions, 41 changer transitions 3/174 dead transitions. [2025-03-14 01:08:26,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 174 transitions, 1453 flow [2025-03-14 01:08:26,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:08:26,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:08:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 221 transitions. [2025-03-14 01:08:26,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4384920634920635 [2025-03-14 01:08:26,740 INFO L175 Difference]: Start difference. First operand has 101 places, 101 transitions, 772 flow. Second operand 12 states and 221 transitions. [2025-03-14 01:08:26,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 174 transitions, 1453 flow [2025-03-14 01:08:26,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 174 transitions, 1362 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-03-14 01:08:26,751 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 854 flow [2025-03-14 01:08:26,751 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-14 01:08:26,752 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2025-03-14 01:08:26,752 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 854 flow [2025-03-14 01:08:26,752 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-14 01:08:26,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:26,752 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-14 01:08:26,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:08:26,752 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-14 01:08:26,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:26,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1954244786, now seen corresponding path program 8 times [2025-03-14 01:08:26,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:26,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000921248] [2025-03-14 01:08:26,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:08:26,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:26,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:26,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:26,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:08:26,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:27,174 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-14 01:08:27,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:27,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000921248] [2025-03-14 01:08:27,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000921248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:27,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:27,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:27,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311975654] [2025-03-14 01:08:27,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:27,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:27,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:27,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:27,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:27,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:27,202 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-14 01:08:27,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:27,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:27,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:27,721 INFO L124 PetriNetUnfolderBase]: 1787/2996 cut-off events. [2025-03-14 01:08:27,722 INFO L125 PetriNetUnfolderBase]: For 10890/10890 co-relation queries the response was YES. [2025-03-14 01:08:27,730 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-14 01:08:27,739 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 121 selfloop transitions, 40 changer transitions 3/169 dead transitions. [2025-03-14 01:08:27,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 169 transitions, 1472 flow [2025-03-14 01:08:27,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:08:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:08:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 212 transitions. [2025-03-14 01:08:27,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2025-03-14 01:08:27,740 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 854 flow. Second operand 12 states and 212 transitions. [2025-03-14 01:08:27,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 169 transitions, 1472 flow [2025-03-14 01:08:27,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 169 transitions, 1361 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-03-14 01:08:27,753 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 874 flow [2025-03-14 01:08:27,753 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-14 01:08:27,754 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2025-03-14 01:08:27,754 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 874 flow [2025-03-14 01:08:27,754 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-14 01:08:27,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:27,754 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-14 01:08:27,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:08:27,754 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-14 01:08:27,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:27,755 INFO L85 PathProgramCache]: Analyzing trace with hash -498824284, now seen corresponding path program 9 times [2025-03-14 01:08:27,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:27,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491921072] [2025-03-14 01:08:27,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:08:27,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:27,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:27,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:27,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:08:27,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:28,222 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-14 01:08:28,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:28,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491921072] [2025-03-14 01:08:28,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491921072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:28,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:28,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:28,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598944092] [2025-03-14 01:08:28,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:28,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:28,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:28,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:28,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:28,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:28,258 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-14 01:08:28,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:28,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:28,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:28,772 INFO L124 PetriNetUnfolderBase]: 1924/3235 cut-off events. [2025-03-14 01:08:28,772 INFO L125 PetriNetUnfolderBase]: For 11848/11848 co-relation queries the response was YES. [2025-03-14 01:08:28,782 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-14 01:08:28,788 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 129 selfloop transitions, 36 changer transitions 3/173 dead transitions. [2025-03-14 01:08:28,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 173 transitions, 1573 flow [2025-03-14 01:08:28,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:28,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2025-03-14 01:08:28,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-14 01:08:28,791 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 874 flow. Second operand 11 states and 198 transitions. [2025-03-14 01:08:28,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 173 transitions, 1573 flow [2025-03-14 01:08:28,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 173 transitions, 1479 flow, removed 9 selfloop flow, removed 9 redundant places. [2025-03-14 01:08:28,808 INFO L231 Difference]: Finished difference. Result has 120 places, 119 transitions, 1005 flow [2025-03-14 01:08:28,809 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-14 01:08:28,809 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 79 predicate places. [2025-03-14 01:08:28,810 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 119 transitions, 1005 flow [2025-03-14 01:08:28,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:28,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:28,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:08:28,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:08:28,811 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-14 01:08:28,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:28,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1611992146, now seen corresponding path program 10 times [2025-03-14 01:08:28,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:28,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954502785] [2025-03-14 01:08:28,811 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:08:28,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:28,819 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:28,832 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:28,832 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:08:28,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:29,268 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-14 01:08:29,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:29,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954502785] [2025-03-14 01:08:29,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954502785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:29,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:29,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:29,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103974859] [2025-03-14 01:08:29,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:29,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:29,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:29,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:29,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:29,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-14 01:08:29,292 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-14 01:08:29,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:29,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-14 01:08:29,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:29,793 INFO L124 PetriNetUnfolderBase]: 2254/3734 cut-off events. [2025-03-14 01:08:29,793 INFO L125 PetriNetUnfolderBase]: For 20809/20809 co-relation queries the response was YES. [2025-03-14 01:08:29,808 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-14 01:08:29,818 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 142 selfloop transitions, 36 changer transitions 3/185 dead transitions. [2025-03-14 01:08:29,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 185 transitions, 1768 flow [2025-03-14 01:08:29,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2025-03-14 01:08:29,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4134199134199134 [2025-03-14 01:08:29,820 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 1005 flow. Second operand 11 states and 191 transitions. [2025-03-14 01:08:29,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 185 transitions, 1768 flow [2025-03-14 01:08:29,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 185 transitions, 1650 flow, removed 42 selfloop flow, removed 5 redundant places. [2025-03-14 01:08:29,901 INFO L231 Difference]: Finished difference. Result has 128 places, 128 transitions, 1097 flow [2025-03-14 01:08:29,902 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-14 01:08:29,902 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 87 predicate places. [2025-03-14 01:08:29,903 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 128 transitions, 1097 flow [2025-03-14 01:08:29,904 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-14 01:08:29,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:29,904 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-14 01:08:29,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:08:29,904 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-14 01:08:29,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:29,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1516755068, now seen corresponding path program 11 times [2025-03-14 01:08:29,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:29,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953977750] [2025-03-14 01:08:29,904 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:08:29,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:29,910 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:29,920 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:29,920 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:29,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:30,320 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-14 01:08:30,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:30,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953977750] [2025-03-14 01:08:30,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953977750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:30,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:30,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:30,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507725474] [2025-03-14 01:08:30,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:30,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:30,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:30,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:30,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:30,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:30,352 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-14 01:08:30,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:30,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:30,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:30,848 INFO L124 PetriNetUnfolderBase]: 2222/3736 cut-off events. [2025-03-14 01:08:30,849 INFO L125 PetriNetUnfolderBase]: For 25607/25607 co-relation queries the response was YES. [2025-03-14 01:08:30,862 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-14 01:08:30,870 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 148 selfloop transitions, 37 changer transitions 3/193 dead transitions. [2025-03-14 01:08:30,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 193 transitions, 1905 flow [2025-03-14 01:08:30,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:30,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2025-03-14 01:08:30,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-14 01:08:30,872 INFO L175 Difference]: Start difference. First operand has 128 places, 128 transitions, 1097 flow. Second operand 11 states and 203 transitions. [2025-03-14 01:08:30,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 193 transitions, 1905 flow [2025-03-14 01:08:30,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 193 transitions, 1779 flow, removed 46 selfloop flow, removed 5 redundant places. [2025-03-14 01:08:30,898 INFO L231 Difference]: Finished difference. Result has 136 places, 135 transitions, 1197 flow [2025-03-14 01:08:30,898 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-14 01:08:30,899 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 95 predicate places. [2025-03-14 01:08:30,899 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 135 transitions, 1197 flow [2025-03-14 01:08:30,899 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-14 01:08:30,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:30,899 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-14 01:08:30,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:08:30,899 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-14 01:08:30,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:30,900 INFO L85 PathProgramCache]: Analyzing trace with hash 574700112, now seen corresponding path program 12 times [2025-03-14 01:08:30,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:30,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642008966] [2025-03-14 01:08:30,900 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:08:30,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:30,906 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:30,915 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:30,916 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:08:30,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:31,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-14 01:08:31,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:31,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642008966] [2025-03-14 01:08:31,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642008966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:31,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:31,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:31,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237908408] [2025-03-14 01:08:31,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:31,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:31,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:31,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:31,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:31,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:31,234 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-14 01:08:31,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:31,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:31,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:31,745 INFO L124 PetriNetUnfolderBase]: 2283/3844 cut-off events. [2025-03-14 01:08:31,746 INFO L125 PetriNetUnfolderBase]: For 29917/29917 co-relation queries the response was YES. [2025-03-14 01:08:31,756 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-14 01:08:31,762 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 142 selfloop transitions, 36 changer transitions 4/187 dead transitions. [2025-03-14 01:08:31,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 187 transitions, 1855 flow [2025-03-14 01:08:31,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2025-03-14 01:08:31,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2025-03-14 01:08:31,764 INFO L175 Difference]: Start difference. First operand has 136 places, 135 transitions, 1197 flow. Second operand 11 states and 190 transitions. [2025-03-14 01:08:31,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 187 transitions, 1855 flow [2025-03-14 01:08:31,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 187 transitions, 1723 flow, removed 47 selfloop flow, removed 6 redundant places. [2025-03-14 01:08:31,795 INFO L231 Difference]: Finished difference. Result has 143 places, 141 transitions, 1232 flow [2025-03-14 01:08:31,795 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-14 01:08:31,796 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 102 predicate places. [2025-03-14 01:08:31,796 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 141 transitions, 1232 flow [2025-03-14 01:08:31,796 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-14 01:08:31,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:31,797 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-14 01:08:31,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:08:31,797 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-14 01:08:31,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash -141022006, now seen corresponding path program 13 times [2025-03-14 01:08:31,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:31,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842631598] [2025-03-14 01:08:31,798 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:08:31,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:31,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:08:31,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:31,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:31,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:32,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-14 01:08:32,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:32,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842631598] [2025-03-14 01:08:32,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842631598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:32,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:32,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:32,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875312389] [2025-03-14 01:08:32,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:32,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:32,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:32,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:32,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:32,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:32,214 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-14 01:08:32,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:32,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:32,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:32,831 INFO L124 PetriNetUnfolderBase]: 2434/4088 cut-off events. [2025-03-14 01:08:32,831 INFO L125 PetriNetUnfolderBase]: For 31477/31477 co-relation queries the response was YES. [2025-03-14 01:08:32,847 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-14 01:08:32,856 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 153 selfloop transitions, 42 changer transitions 3/203 dead transitions. [2025-03-14 01:08:32,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 203 transitions, 2070 flow [2025-03-14 01:08:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:32,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2025-03-14 01:08:32,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43506493506493504 [2025-03-14 01:08:32,858 INFO L175 Difference]: Start difference. First operand has 143 places, 141 transitions, 1232 flow. Second operand 11 states and 201 transitions. [2025-03-14 01:08:32,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 203 transitions, 2070 flow [2025-03-14 01:08:32,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 203 transitions, 1962 flow, removed 34 selfloop flow, removed 6 redundant places. [2025-03-14 01:08:32,901 INFO L231 Difference]: Finished difference. Result has 150 places, 148 transitions, 1393 flow [2025-03-14 01:08:32,901 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-14 01:08:32,901 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 109 predicate places. [2025-03-14 01:08:32,901 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 148 transitions, 1393 flow [2025-03-14 01:08:32,901 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-14 01:08:32,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:32,901 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-14 01:08:32,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:08:32,901 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-14 01:08:32,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:32,902 INFO L85 PathProgramCache]: Analyzing trace with hash -864560098, now seen corresponding path program 14 times [2025-03-14 01:08:32,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:32,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129743843] [2025-03-14 01:08:32,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:08:32,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:32,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:32,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:32,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:08:32,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:33,206 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-14 01:08:33,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:33,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129743843] [2025-03-14 01:08:33,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129743843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:33,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:33,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:33,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267841998] [2025-03-14 01:08:33,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:33,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:33,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:33,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:33,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:33,234 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-14 01:08:33,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:33,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:33,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:33,724 INFO L124 PetriNetUnfolderBase]: 2434/4080 cut-off events. [2025-03-14 01:08:33,724 INFO L125 PetriNetUnfolderBase]: For 37579/37605 co-relation queries the response was YES. [2025-03-14 01:08:33,742 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-14 01:08:33,750 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 158 selfloop transitions, 37 changer transitions 4/204 dead transitions. [2025-03-14 01:08:33,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 204 transitions, 2118 flow [2025-03-14 01:08:33,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:33,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2025-03-14 01:08:33,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4264069264069264 [2025-03-14 01:08:33,751 INFO L175 Difference]: Start difference. First operand has 150 places, 148 transitions, 1393 flow. Second operand 11 states and 197 transitions. [2025-03-14 01:08:33,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 204 transitions, 2118 flow [2025-03-14 01:08:33,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 204 transitions, 1960 flow, removed 59 selfloop flow, removed 6 redundant places. [2025-03-14 01:08:33,795 INFO L231 Difference]: Finished difference. Result has 156 places, 152 transitions, 1362 flow [2025-03-14 01:08:33,795 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-14 01:08:33,795 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 115 predicate places. [2025-03-14 01:08:33,795 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 152 transitions, 1362 flow [2025-03-14 01:08:33,795 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-14 01:08:33,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:33,795 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-14 01:08:33,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:08:33,795 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-14 01:08:33,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:33,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1050441446, now seen corresponding path program 15 times [2025-03-14 01:08:33,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:33,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418337586] [2025-03-14 01:08:33,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:08:33,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:33,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:33,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:33,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:08:33,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:34,117 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-14 01:08:34,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:34,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418337586] [2025-03-14 01:08:34,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418337586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:34,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:34,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:34,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163458750] [2025-03-14 01:08:34,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:34,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:34,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:34,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:34,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:34,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:34,147 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-14 01:08:34,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:34,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:34,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:34,655 INFO L124 PetriNetUnfolderBase]: 2434/4084 cut-off events. [2025-03-14 01:08:34,655 INFO L125 PetriNetUnfolderBase]: For 32987/32987 co-relation queries the response was YES. [2025-03-14 01:08:34,675 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-14 01:08:34,685 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 156 selfloop transitions, 41 changer transitions 4/206 dead transitions. [2025-03-14 01:08:34,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 206 transitions, 2055 flow [2025-03-14 01:08:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2025-03-14 01:08:34,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-03-14 01:08:34,686 INFO L175 Difference]: Start difference. First operand has 156 places, 152 transitions, 1362 flow. Second operand 11 states and 196 transitions. [2025-03-14 01:08:34,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 206 transitions, 2055 flow [2025-03-14 01:08:34,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 206 transitions, 1949 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-03-14 01:08:34,720 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 1402 flow [2025-03-14 01:08:34,720 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-14 01:08:34,720 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 119 predicate places. [2025-03-14 01:08:34,720 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 1402 flow [2025-03-14 01:08:34,721 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-14 01:08:34,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:34,721 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-14 01:08:34,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:08:34,721 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-14 01:08:34,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:34,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1748755234, now seen corresponding path program 16 times [2025-03-14 01:08:34,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:34,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952762194] [2025-03-14 01:08:34,721 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:08:34,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:34,726 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:34,737 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:34,737 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:08:34,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:35,072 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-14 01:08:35,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:35,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952762194] [2025-03-14 01:08:35,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952762194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:35,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:35,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:35,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407747318] [2025-03-14 01:08:35,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:35,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:35,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:35,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:35,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:35,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-14 01:08:35,091 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-14 01:08:35,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:35,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-14 01:08:35,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:35,679 INFO L124 PetriNetUnfolderBase]: 2668/4423 cut-off events. [2025-03-14 01:08:35,680 INFO L125 PetriNetUnfolderBase]: For 35776/35776 co-relation queries the response was YES. [2025-03-14 01:08:35,699 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-14 01:08:35,708 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 162 selfloop transitions, 37 changer transitions 3/206 dead transitions. [2025-03-14 01:08:35,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 206 transitions, 2072 flow [2025-03-14 01:08:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2025-03-14 01:08:35,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3917748917748918 [2025-03-14 01:08:35,709 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 1402 flow. Second operand 11 states and 181 transitions. [2025-03-14 01:08:35,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 206 transitions, 2072 flow [2025-03-14 01:08:35,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 206 transitions, 1948 flow, removed 23 selfloop flow, removed 8 redundant places. [2025-03-14 01:08:35,772 INFO L231 Difference]: Finished difference. Result has 164 places, 159 transitions, 1404 flow [2025-03-14 01:08:35,772 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-14 01:08:35,772 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 123 predicate places. [2025-03-14 01:08:35,772 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 159 transitions, 1404 flow [2025-03-14 01:08:35,772 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-14 01:08:35,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:35,773 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-14 01:08:35,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:08:35,773 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-14 01:08:35,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:35,773 INFO L85 PathProgramCache]: Analyzing trace with hash -545220554, now seen corresponding path program 17 times [2025-03-14 01:08:35,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:35,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012005967] [2025-03-14 01:08:35,774 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:08:35,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:35,779 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:35,786 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:35,786 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:35,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:36,096 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-14 01:08:36,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:36,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012005967] [2025-03-14 01:08:36,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012005967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:36,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:36,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:36,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874191593] [2025-03-14 01:08:36,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:36,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:36,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:36,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:36,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:36,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:36,123 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-14 01:08:36,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:36,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:36,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:36,586 INFO L124 PetriNetUnfolderBase]: 2470/4159 cut-off events. [2025-03-14 01:08:36,586 INFO L125 PetriNetUnfolderBase]: For 32368/32368 co-relation queries the response was YES. [2025-03-14 01:08:36,605 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-14 01:08:36,614 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 162 selfloop transitions, 35 changer transitions 3/205 dead transitions. [2025-03-14 01:08:36,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 205 transitions, 2040 flow [2025-03-14 01:08:36,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2025-03-14 01:08:36,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-03-14 01:08:36,615 INFO L175 Difference]: Start difference. First operand has 164 places, 159 transitions, 1404 flow. Second operand 11 states and 187 transitions. [2025-03-14 01:08:36,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 205 transitions, 2040 flow [2025-03-14 01:08:36,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 205 transitions, 1932 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-03-14 01:08:36,651 INFO L231 Difference]: Finished difference. Result has 168 places, 161 transitions, 1392 flow [2025-03-14 01:08:36,651 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-14 01:08:36,651 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 127 predicate places. [2025-03-14 01:08:36,651 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 161 transitions, 1392 flow [2025-03-14 01:08:36,651 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-14 01:08:36,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:36,651 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-14 01:08:36,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:08:36,652 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-14 01:08:36,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:36,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2079611608, now seen corresponding path program 18 times [2025-03-14 01:08:36,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:36,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724134418] [2025-03-14 01:08:36,652 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:08:36,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:36,658 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:36,665 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:36,665 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:08:36,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:37,032 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-14 01:08:37,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:37,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724134418] [2025-03-14 01:08:37,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724134418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:37,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:37,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246648956] [2025-03-14 01:08:37,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:37,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:37,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:37,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:37,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:37,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:37,064 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-14 01:08:37,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:37,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:37,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:37,753 INFO L124 PetriNetUnfolderBase]: 2709/4568 cut-off events. [2025-03-14 01:08:37,753 INFO L125 PetriNetUnfolderBase]: For 42353/42353 co-relation queries the response was YES. [2025-03-14 01:08:37,770 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-14 01:08:37,779 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 189 selfloop transitions, 44 changer transitions 3/241 dead transitions. [2025-03-14 01:08:37,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 241 transitions, 2489 flow [2025-03-14 01:08:37,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:08:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:08:37,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 223 transitions. [2025-03-14 01:08:37,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44246031746031744 [2025-03-14 01:08:37,781 INFO L175 Difference]: Start difference. First operand has 168 places, 161 transitions, 1392 flow. Second operand 12 states and 223 transitions. [2025-03-14 01:08:37,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 241 transitions, 2489 flow [2025-03-14 01:08:37,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 241 transitions, 2421 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-14 01:08:37,834 INFO L231 Difference]: Finished difference. Result has 175 places, 173 transitions, 1663 flow [2025-03-14 01:08:37,834 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-14 01:08:37,834 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 134 predicate places. [2025-03-14 01:08:37,834 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 173 transitions, 1663 flow [2025-03-14 01:08:37,834 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-14 01:08:37,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:37,835 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-14 01:08:37,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:08:37,835 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-14 01:08:37,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:37,835 INFO L85 PathProgramCache]: Analyzing trace with hash 341346484, now seen corresponding path program 19 times [2025-03-14 01:08:37,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:37,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201612818] [2025-03-14 01:08:37,835 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:08:37,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:37,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:08:37,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:37,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:37,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:38,167 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-14 01:08:38,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:38,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201612818] [2025-03-14 01:08:38,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201612818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:38,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:38,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:38,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470126611] [2025-03-14 01:08:38,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:38,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:38,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:38,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:38,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:38,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:38,207 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-14 01:08:38,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:38,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:38,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:38,983 INFO L124 PetriNetUnfolderBase]: 2908/4911 cut-off events. [2025-03-14 01:08:38,983 INFO L125 PetriNetUnfolderBase]: For 58161/58161 co-relation queries the response was YES. [2025-03-14 01:08:39,012 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-14 01:08:39,023 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 187 selfloop transitions, 54 changer transitions 3/249 dead transitions. [2025-03-14 01:08:39,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 249 transitions, 2832 flow [2025-03-14 01:08:39,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:08:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:08:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 222 transitions. [2025-03-14 01:08:39,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2025-03-14 01:08:39,025 INFO L175 Difference]: Start difference. First operand has 175 places, 173 transitions, 1663 flow. Second operand 12 states and 222 transitions. [2025-03-14 01:08:39,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 249 transitions, 2832 flow [2025-03-14 01:08:39,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 249 transitions, 2606 flow, removed 96 selfloop flow, removed 5 redundant places. [2025-03-14 01:08:39,112 INFO L231 Difference]: Finished difference. Result has 185 places, 184 transitions, 1842 flow [2025-03-14 01:08:39,113 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-14 01:08:39,113 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places. [2025-03-14 01:08:39,113 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 184 transitions, 1842 flow [2025-03-14 01:08:39,113 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-14 01:08:39,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:39,113 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-14 01:08:39,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 01:08:39,113 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-14 01:08:39,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:39,114 INFO L85 PathProgramCache]: Analyzing trace with hash 260109490, now seen corresponding path program 20 times [2025-03-14 01:08:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:39,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123250217] [2025-03-14 01:08:39,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:08:39,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:39,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:39,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:39,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:08:39,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:39,451 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-14 01:08:39,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:39,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123250217] [2025-03-14 01:08:39,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123250217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:39,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:39,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:39,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845635704] [2025-03-14 01:08:39,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:39,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:39,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:39,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:39,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:39,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:39,481 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-14 01:08:39,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:39,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:39,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:40,135 INFO L124 PetriNetUnfolderBase]: 3004/5097 cut-off events. [2025-03-14 01:08:40,135 INFO L125 PetriNetUnfolderBase]: For 69548/69548 co-relation queries the response was YES. [2025-03-14 01:08:40,166 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-14 01:08:40,178 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 196 selfloop transitions, 49 changer transitions 3/253 dead transitions. [2025-03-14 01:08:40,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 253 transitions, 2900 flow [2025-03-14 01:08:40,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:08:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:08:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 219 transitions. [2025-03-14 01:08:40,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2025-03-14 01:08:40,179 INFO L175 Difference]: Start difference. First operand has 185 places, 184 transitions, 1842 flow. Second operand 12 states and 219 transitions. [2025-03-14 01:08:40,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 253 transitions, 2900 flow [2025-03-14 01:08:40,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 253 transitions, 2693 flow, removed 79 selfloop flow, removed 7 redundant places. [2025-03-14 01:08:40,281 INFO L231 Difference]: Finished difference. Result has 192 places, 190 transitions, 1901 flow [2025-03-14 01:08:40,282 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-14 01:08:40,282 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 151 predicate places. [2025-03-14 01:08:40,282 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 190 transitions, 1901 flow [2025-03-14 01:08:40,282 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-14 01:08:40,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:40,282 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-14 01:08:40,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:08:40,282 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-14 01:08:40,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:40,283 INFO L85 PathProgramCache]: Analyzing trace with hash 893032410, now seen corresponding path program 21 times [2025-03-14 01:08:40,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:40,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868057242] [2025-03-14 01:08:40,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:08:40,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:40,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:40,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:40,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:08:40,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:40,544 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-14 01:08:40,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:40,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868057242] [2025-03-14 01:08:40,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868057242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:40,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:40,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:40,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020263277] [2025-03-14 01:08:40,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:40,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:40,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:40,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:40,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:40,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:40,569 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-14 01:08:40,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:40,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:40,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:41,171 INFO L124 PetriNetUnfolderBase]: 3004/5087 cut-off events. [2025-03-14 01:08:41,171 INFO L125 PetriNetUnfolderBase]: For 68879/68879 co-relation queries the response was YES. [2025-03-14 01:08:41,203 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-14 01:08:41,215 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 193 selfloop transitions, 51 changer transitions 4/253 dead transitions. [2025-03-14 01:08:41,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 253 transitions, 2837 flow [2025-03-14 01:08:41,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:08:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:08:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 216 transitions. [2025-03-14 01:08:41,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-14 01:08:41,216 INFO L175 Difference]: Start difference. First operand has 192 places, 190 transitions, 1901 flow. Second operand 12 states and 216 transitions. [2025-03-14 01:08:41,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 253 transitions, 2837 flow [2025-03-14 01:08:41,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 253 transitions, 2684 flow, removed 51 selfloop flow, removed 8 redundant places. [2025-03-14 01:08:41,344 INFO L231 Difference]: Finished difference. Result has 197 places, 194 transitions, 1928 flow [2025-03-14 01:08:41,345 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-14 01:08:41,345 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 156 predicate places. [2025-03-14 01:08:41,345 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 194 transitions, 1928 flow [2025-03-14 01:08:41,345 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-14 01:08:41,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:41,345 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-14 01:08:41,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 01:08:41,345 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-14 01:08:41,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:41,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1722680612, now seen corresponding path program 22 times [2025-03-14 01:08:41,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:41,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232500214] [2025-03-14 01:08:41,346 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:08:41,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:41,352 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:41,362 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:41,362 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:08:41,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:41,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-14 01:08:41,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:41,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232500214] [2025-03-14 01:08:41,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232500214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:41,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:41,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:41,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145842649] [2025-03-14 01:08:41,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:41,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:41,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:41,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:41,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:41,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-14 01:08:41,755 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-14 01:08:41,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:41,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-14 01:08:41,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:42,473 INFO L124 PetriNetUnfolderBase]: 3330/5583 cut-off events. [2025-03-14 01:08:42,473 INFO L125 PetriNetUnfolderBase]: For 77676/77676 co-relation queries the response was YES. [2025-03-14 01:08:42,499 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-14 01:08:42,512 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 216 selfloop transitions, 36 changer transitions 3/259 dead transitions. [2025-03-14 01:08:42,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 259 transitions, 3147 flow [2025-03-14 01:08:42,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-14 01:08:42,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2025-03-14 01:08:42,513 INFO L175 Difference]: Start difference. First operand has 197 places, 194 transitions, 1928 flow. Second operand 11 states and 193 transitions. [2025-03-14 01:08:42,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 259 transitions, 3147 flow [2025-03-14 01:08:42,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 259 transitions, 2993 flow, removed 30 selfloop flow, removed 9 redundant places. [2025-03-14 01:08:42,620 INFO L231 Difference]: Finished difference. Result has 202 places, 203 transitions, 2157 flow [2025-03-14 01:08:42,620 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-14 01:08:42,620 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 161 predicate places. [2025-03-14 01:08:42,620 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 203 transitions, 2157 flow [2025-03-14 01:08:42,620 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-14 01:08:42,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:42,620 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-14 01:08:42,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-14 01:08:42,621 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-14 01:08:42,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1731878102, now seen corresponding path program 23 times [2025-03-14 01:08:42,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:42,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532969045] [2025-03-14 01:08:42,621 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:08:42,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:42,626 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:42,632 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:42,632 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:42,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:42,965 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-14 01:08:42,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:42,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532969045] [2025-03-14 01:08:42,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532969045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:42,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:42,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:42,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804300402] [2025-03-14 01:08:42,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:42,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:42,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:42,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:42,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:42,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:42,997 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-14 01:08:42,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:42,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:42,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:43,791 INFO L124 PetriNetUnfolderBase]: 3334/5646 cut-off events. [2025-03-14 01:08:43,791 INFO L125 PetriNetUnfolderBase]: For 103172/103172 co-relation queries the response was YES. [2025-03-14 01:08:43,830 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-14 01:08:43,847 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 226 selfloop transitions, 37 changer transitions 3/271 dead transitions. [2025-03-14 01:08:43,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 271 transitions, 3434 flow [2025-03-14 01:08:43,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions. [2025-03-14 01:08:43,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4458874458874459 [2025-03-14 01:08:43,850 INFO L175 Difference]: Start difference. First operand has 202 places, 203 transitions, 2157 flow. Second operand 11 states and 206 transitions. [2025-03-14 01:08:43,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 271 transitions, 3434 flow [2025-03-14 01:08:43,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 271 transitions, 3140 flow, removed 130 selfloop flow, removed 5 redundant places. [2025-03-14 01:08:43,991 INFO L231 Difference]: Finished difference. Result has 211 places, 213 transitions, 2256 flow [2025-03-14 01:08:43,992 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-14 01:08:43,992 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 170 predicate places. [2025-03-14 01:08:43,992 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 213 transitions, 2256 flow [2025-03-14 01:08:43,993 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-14 01:08:43,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:43,993 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-14 01:08:43,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-14 01:08:43,993 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-14 01:08:43,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:43,994 INFO L85 PathProgramCache]: Analyzing trace with hash -649156216, now seen corresponding path program 24 times [2025-03-14 01:08:43,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:43,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355248157] [2025-03-14 01:08:43,994 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:08:43,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:43,999 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:44,007 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:44,007 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:08:44,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:44,270 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-14 01:08:44,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:44,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355248157] [2025-03-14 01:08:44,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355248157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:44,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:44,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:44,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041368720] [2025-03-14 01:08:44,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:44,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:44,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:44,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:44,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:44,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:44,297 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-14 01:08:44,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:44,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:44,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:45,004 INFO L124 PetriNetUnfolderBase]: 3395/5768 cut-off events. [2025-03-14 01:08:45,005 INFO L125 PetriNetUnfolderBase]: For 96320/96320 co-relation queries the response was YES. [2025-03-14 01:08:45,047 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-14 01:08:45,060 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 220 selfloop transitions, 36 changer transitions 4/265 dead transitions. [2025-03-14 01:08:45,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 265 transitions, 3220 flow [2025-03-14 01:08:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:45,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-14 01:08:45,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2025-03-14 01:08:45,062 INFO L175 Difference]: Start difference. First operand has 211 places, 213 transitions, 2256 flow. Second operand 11 states and 193 transitions. [2025-03-14 01:08:45,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 265 transitions, 3220 flow [2025-03-14 01:08:45,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 265 transitions, 3010 flow, removed 88 selfloop flow, removed 5 redundant places. [2025-03-14 01:08:45,194 INFO L231 Difference]: Finished difference. Result has 219 places, 219 transitions, 2257 flow [2025-03-14 01:08:45,194 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-14 01:08:45,194 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 178 predicate places. [2025-03-14 01:08:45,194 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 219 transitions, 2257 flow [2025-03-14 01:08:45,194 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-14 01:08:45,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:45,194 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-14 01:08:45,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-14 01:08:45,195 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-14 01:08:45,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:45,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1364878334, now seen corresponding path program 25 times [2025-03-14 01:08:45,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:45,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138494489] [2025-03-14 01:08:45,195 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:08:45,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:45,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:08:45,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:45,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:45,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:45,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-14 01:08:45,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:45,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138494489] [2025-03-14 01:08:45,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138494489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:45,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:45,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:45,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134757326] [2025-03-14 01:08:45,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:45,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:45,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:45,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:45,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:45,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:45,553 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-14 01:08:45,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:45,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:45,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:46,319 INFO L124 PetriNetUnfolderBase]: 3540/5996 cut-off events. [2025-03-14 01:08:46,320 INFO L125 PetriNetUnfolderBase]: For 98717/98717 co-relation queries the response was YES. [2025-03-14 01:08:46,355 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-14 01:08:46,369 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 231 selfloop transitions, 42 changer transitions 3/281 dead transitions. [2025-03-14 01:08:46,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 281 transitions, 3483 flow [2025-03-14 01:08:46,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2025-03-14 01:08:46,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2025-03-14 01:08:46,370 INFO L175 Difference]: Start difference. First operand has 219 places, 219 transitions, 2257 flow. Second operand 11 states and 204 transitions. [2025-03-14 01:08:46,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 281 transitions, 3483 flow [2025-03-14 01:08:46,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 281 transitions, 3321 flow, removed 61 selfloop flow, removed 6 redundant places. [2025-03-14 01:08:46,483 INFO L231 Difference]: Finished difference. Result has 226 places, 226 transitions, 2454 flow [2025-03-14 01:08:46,483 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-14 01:08:46,484 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 185 predicate places. [2025-03-14 01:08:46,484 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 226 transitions, 2454 flow [2025-03-14 01:08:46,484 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-14 01:08:46,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:46,484 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-14 01:08:46,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-14 01:08:46,484 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-14 01:08:46,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1518125206, now seen corresponding path program 26 times [2025-03-14 01:08:46,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:46,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890172531] [2025-03-14 01:08:46,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:08:46,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:46,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:46,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:46,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:08:46,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:46,830 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-14 01:08:46,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:46,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890172531] [2025-03-14 01:08:46,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890172531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:46,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:46,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:46,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081204727] [2025-03-14 01:08:46,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:46,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:46,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:46,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:46,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:46,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:46,847 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-14 01:08:46,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:46,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:46,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:47,862 INFO L124 PetriNetUnfolderBase]: 3646/6198 cut-off events. [2025-03-14 01:08:47,862 INFO L125 PetriNetUnfolderBase]: For 126150/126150 co-relation queries the response was YES. [2025-03-14 01:08:47,915 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-14 01:08:47,933 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 246 selfloop transitions, 35 changer transitions 3/289 dead transitions. [2025-03-14 01:08:47,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 289 transitions, 3674 flow [2025-03-14 01:08:47,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2025-03-14 01:08:47,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-14 01:08:47,934 INFO L175 Difference]: Start difference. First operand has 226 places, 226 transitions, 2454 flow. Second operand 11 states and 203 transitions. [2025-03-14 01:08:47,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 289 transitions, 3674 flow [2025-03-14 01:08:48,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 289 transitions, 3430 flow, removed 102 selfloop flow, removed 6 redundant places. [2025-03-14 01:08:48,204 INFO L231 Difference]: Finished difference. Result has 233 places, 232 transitions, 2473 flow [2025-03-14 01:08:48,204 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-14 01:08:48,204 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 192 predicate places. [2025-03-14 01:08:48,204 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 232 transitions, 2473 flow [2025-03-14 01:08:48,204 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-14 01:08:48,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:48,204 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-14 01:08:48,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-14 01:08:48,205 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-14 01:08:48,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:48,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1937118092, now seen corresponding path program 27 times [2025-03-14 01:08:48,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:48,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357143043] [2025-03-14 01:08:48,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:08:48,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:48,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:48,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:48,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:08:48,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:48,557 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-14 01:08:48,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:48,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357143043] [2025-03-14 01:08:48,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357143043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:48,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:48,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:48,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123795164] [2025-03-14 01:08:48,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:48,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:48,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:48,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:48,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:48,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:48,587 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-14 01:08:48,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:48,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:48,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:49,377 INFO L124 PetriNetUnfolderBase]: 3708/6296 cut-off events. [2025-03-14 01:08:49,377 INFO L125 PetriNetUnfolderBase]: For 127151/127151 co-relation queries the response was YES. [2025-03-14 01:08:49,426 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-14 01:08:49,442 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 245 selfloop transitions, 37 changer transitions 4/291 dead transitions. [2025-03-14 01:08:49,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 291 transitions, 3635 flow [2025-03-14 01:08:49,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-03-14 01:08:49,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2025-03-14 01:08:49,443 INFO L175 Difference]: Start difference. First operand has 233 places, 232 transitions, 2473 flow. Second operand 11 states and 202 transitions. [2025-03-14 01:08:49,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 291 transitions, 3635 flow [2025-03-14 01:08:49,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 291 transitions, 3452 flow, removed 73 selfloop flow, removed 6 redundant places. [2025-03-14 01:08:49,574 INFO L231 Difference]: Finished difference. Result has 239 places, 236 transitions, 2542 flow [2025-03-14 01:08:49,575 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-14 01:08:49,575 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 198 predicate places. [2025-03-14 01:08:49,575 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 236 transitions, 2542 flow [2025-03-14 01:08:49,575 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-14 01:08:49,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:49,575 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-14 01:08:49,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-14 01:08:49,576 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-14 01:08:49,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:49,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1459118822, now seen corresponding path program 28 times [2025-03-14 01:08:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:49,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863614365] [2025-03-14 01:08:49,576 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:08:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:49,581 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:49,588 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:49,588 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:08:49,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:49,911 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-14 01:08:49,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:49,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863614365] [2025-03-14 01:08:49,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863614365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:49,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:49,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:49,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450969124] [2025-03-14 01:08:49,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:49,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:49,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:49,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:49,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:49,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-14 01:08:49,944 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-14 01:08:49,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:49,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-14 01:08:49,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:50,834 INFO L124 PetriNetUnfolderBase]: 4002/6745 cut-off events. [2025-03-14 01:08:50,835 INFO L125 PetriNetUnfolderBase]: For 149092/149092 co-relation queries the response was YES. [2025-03-14 01:08:50,887 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-14 01:08:50,904 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 257 selfloop transitions, 36 changer transitions 3/300 dead transitions. [2025-03-14 01:08:50,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 300 transitions, 3829 flow [2025-03-14 01:08:50,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:50,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2025-03-14 01:08:50,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42207792207792205 [2025-03-14 01:08:50,905 INFO L175 Difference]: Start difference. First operand has 239 places, 236 transitions, 2542 flow. Second operand 11 states and 195 transitions. [2025-03-14 01:08:50,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 300 transitions, 3829 flow [2025-03-14 01:08:51,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 300 transitions, 3634 flow, removed 77 selfloop flow, removed 7 redundant places. [2025-03-14 01:08:51,130 INFO L231 Difference]: Finished difference. Result has 245 places, 242 transitions, 2628 flow [2025-03-14 01:08:51,130 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-14 01:08:51,131 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 204 predicate places. [2025-03-14 01:08:51,131 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 242 transitions, 2628 flow [2025-03-14 01:08:51,131 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-14 01:08:51,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:51,131 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-14 01:08:51,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-14 01:08:51,131 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-14 01:08:51,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1487542224, now seen corresponding path program 29 times [2025-03-14 01:08:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678513053] [2025-03-14 01:08:51,132 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:08:51,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:51,141 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:51,147 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:51,147 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:51,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:51,375 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-14 01:08:51,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:51,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678513053] [2025-03-14 01:08:51,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678513053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:51,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:51,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:51,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778622264] [2025-03-14 01:08:51,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:51,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:51,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:51,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:51,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:51,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:51,399 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-14 01:08:51,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:51,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:51,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:52,263 INFO L124 PetriNetUnfolderBase]: 3804/6476 cut-off events. [2025-03-14 01:08:52,263 INFO L125 PetriNetUnfolderBase]: For 141357/141357 co-relation queries the response was YES. [2025-03-14 01:08:52,356 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-14 01:08:52,381 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 252 selfloop transitions, 37 changer transitions 4/298 dead transitions. [2025-03-14 01:08:52,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 298 transitions, 3721 flow [2025-03-14 01:08:52,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:52,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2025-03-14 01:08:52,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4329004329004329 [2025-03-14 01:08:52,382 INFO L175 Difference]: Start difference. First operand has 245 places, 242 transitions, 2628 flow. Second operand 11 states and 200 transitions. [2025-03-14 01:08:52,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 298 transitions, 3721 flow [2025-03-14 01:08:52,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 298 transitions, 3521 flow, removed 81 selfloop flow, removed 6 redundant places. [2025-03-14 01:08:52,640 INFO L231 Difference]: Finished difference. Result has 251 places, 246 transitions, 2577 flow [2025-03-14 01:08:52,640 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-14 01:08:52,640 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 210 predicate places. [2025-03-14 01:08:52,641 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 246 transitions, 2577 flow [2025-03-14 01:08:52,641 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-14 01:08:52,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:52,641 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-14 01:08:52,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-14 01:08:52,641 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-14 01:08:52,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:52,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1322355734, now seen corresponding path program 30 times [2025-03-14 01:08:52,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:52,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74735963] [2025-03-14 01:08:52,642 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:08:52,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:52,646 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:52,654 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:52,654 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:08:52,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:52,970 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-14 01:08:52,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:52,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74735963] [2025-03-14 01:08:52,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74735963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:52,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:52,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:52,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727485933] [2025-03-14 01:08:52,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:52,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:52,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:52,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:52,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:52,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:52,994 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-14 01:08:52,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:52,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:52,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:53,769 INFO L124 PetriNetUnfolderBase]: 3840/6543 cut-off events. [2025-03-14 01:08:53,769 INFO L125 PetriNetUnfolderBase]: For 132939/132939 co-relation queries the response was YES. [2025-03-14 01:08:53,819 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-14 01:08:53,836 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 250 selfloop transitions, 37 changer transitions 3/295 dead transitions. [2025-03-14 01:08:53,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 295 transitions, 3575 flow [2025-03-14 01:08:53,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-14 01:08:53,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2025-03-14 01:08:53,837 INFO L175 Difference]: Start difference. First operand has 251 places, 246 transitions, 2577 flow. Second operand 11 states and 193 transitions. [2025-03-14 01:08:53,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 295 transitions, 3575 flow [2025-03-14 01:08:54,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 295 transitions, 3439 flow, removed 33 selfloop flow, removed 8 redundant places. [2025-03-14 01:08:54,037 INFO L231 Difference]: Finished difference. Result has 255 places, 249 transitions, 2587 flow [2025-03-14 01:08:54,037 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-14 01:08:54,037 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 214 predicate places. [2025-03-14 01:08:54,037 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 249 transitions, 2587 flow [2025-03-14 01:08:54,037 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-14 01:08:54,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:54,037 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-14 01:08:54,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-14 01:08:54,038 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-14 01:08:54,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:54,038 INFO L85 PathProgramCache]: Analyzing trace with hash -890205566, now seen corresponding path program 31 times [2025-03-14 01:08:54,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:54,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420835339] [2025-03-14 01:08:54,038 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:08:54,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:54,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:08:54,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:54,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:54,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:54,326 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-14 01:08:54,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:54,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420835339] [2025-03-14 01:08:54,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420835339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:54,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:54,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:54,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214596877] [2025-03-14 01:08:54,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:54,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:54,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:54,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:54,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:54,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:54,353 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-14 01:08:54,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:54,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:54,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:55,176 INFO L124 PetriNetUnfolderBase]: 3840/6555 cut-off events. [2025-03-14 01:08:55,176 INFO L125 PetriNetUnfolderBase]: For 131251/131251 co-relation queries the response was YES. [2025-03-14 01:08:55,225 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-14 01:08:55,239 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 253 selfloop transitions, 41 changer transitions 4/303 dead transitions. [2025-03-14 01:08:55,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 303 transitions, 3632 flow [2025-03-14 01:08:55,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:55,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2025-03-14 01:08:55,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43073593073593075 [2025-03-14 01:08:55,240 INFO L175 Difference]: Start difference. First operand has 255 places, 249 transitions, 2587 flow. Second operand 11 states and 199 transitions. [2025-03-14 01:08:55,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 303 transitions, 3632 flow [2025-03-14 01:08:55,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 303 transitions, 3496 flow, removed 33 selfloop flow, removed 8 redundant places. [2025-03-14 01:08:55,452 INFO L231 Difference]: Finished difference. Result has 259 places, 253 transitions, 2621 flow [2025-03-14 01:08:55,452 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-14 01:08:55,452 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 218 predicate places. [2025-03-14 01:08:55,452 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 253 transitions, 2621 flow [2025-03-14 01:08:55,452 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-14 01:08:55,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:55,453 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-14 01:08:55,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-14 01:08:55,453 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-14 01:08:55,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1461521862, now seen corresponding path program 32 times [2025-03-14 01:08:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:55,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312040161] [2025-03-14 01:08:55,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:08:55,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:55,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:55,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:55,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:08:55,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:55,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-14 01:08:55,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:55,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312040161] [2025-03-14 01:08:55,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312040161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:55,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:55,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:55,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108327596] [2025-03-14 01:08:55,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:55,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:55,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:55,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:55,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:55,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:55,737 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-14 01:08:55,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:55,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:55,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:56,577 INFO L124 PetriNetUnfolderBase]: 3840/6565 cut-off events. [2025-03-14 01:08:56,577 INFO L125 PetriNetUnfolderBase]: For 131800/131800 co-relation queries the response was YES. [2025-03-14 01:08:56,631 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-14 01:08:56,647 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 256 selfloop transitions, 35 changer transitions 3/299 dead transitions. [2025-03-14 01:08:56,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 299 transitions, 3577 flow [2025-03-14 01:08:56,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2025-03-14 01:08:56,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2025-03-14 01:08:56,649 INFO L175 Difference]: Start difference. First operand has 259 places, 253 transitions, 2621 flow. Second operand 11 states and 190 transitions. [2025-03-14 01:08:56,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 299 transitions, 3577 flow [2025-03-14 01:08:56,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 299 transitions, 3421 flow, removed 39 selfloop flow, removed 8 redundant places. [2025-03-14 01:08:56,835 INFO L231 Difference]: Finished difference. Result has 263 places, 255 transitions, 2559 flow [2025-03-14 01:08:56,835 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-14 01:08:56,836 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 222 predicate places. [2025-03-14 01:08:56,836 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 255 transitions, 2559 flow [2025-03-14 01:08:56,836 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-14 01:08:56,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:56,836 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-14 01:08:56,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-14 01:08:56,836 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-14 01:08:56,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:56,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2059719796, now seen corresponding path program 33 times [2025-03-14 01:08:56,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:56,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797517885] [2025-03-14 01:08:56,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:08:56,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:56,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:56,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:08:56,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:08:56,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:08:57,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:57,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797517885] [2025-03-14 01:08:57,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797517885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:57,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:57,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:57,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936550621] [2025-03-14 01:08:57,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:57,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:57,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:57,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:57,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:57,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:08:57,261 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-14 01:08:57,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:57,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:08:57,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:58,162 INFO L124 PetriNetUnfolderBase]: 3971/6772 cut-off events. [2025-03-14 01:08:58,162 INFO L125 PetriNetUnfolderBase]: For 145221/145221 co-relation queries the response was YES. [2025-03-14 01:08:58,220 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-14 01:08:58,238 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 272 selfloop transitions, 35 changer transitions 3/315 dead transitions. [2025-03-14 01:08:58,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 315 transitions, 4044 flow [2025-03-14 01:08:58,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:08:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:08:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2025-03-14 01:08:58,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4329004329004329 [2025-03-14 01:08:58,239 INFO L175 Difference]: Start difference. First operand has 263 places, 255 transitions, 2559 flow. Second operand 11 states and 200 transitions. [2025-03-14 01:08:58,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 315 transitions, 4044 flow [2025-03-14 01:08:58,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 315 transitions, 3976 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-14 01:08:58,545 INFO L231 Difference]: Finished difference. Result has 269 places, 264 transitions, 2976 flow [2025-03-14 01:08:58,545 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-14 01:08:58,546 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 228 predicate places. [2025-03-14 01:08:58,546 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 264 transitions, 2976 flow [2025-03-14 01:08:58,546 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-14 01:08:58,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:58,546 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-14 01:08:58,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-14 01:08:58,546 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-14 01:08:58,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:58,547 INFO L85 PathProgramCache]: Analyzing trace with hash -274081964, now seen corresponding path program 34 times [2025-03-14 01:08:58,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:58,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240889597] [2025-03-14 01:08:58,547 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:08:58,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:58,551 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:08:58,557 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:08:58,557 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:08:58,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:58,821 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-14 01:08:58,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:58,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240889597] [2025-03-14 01:08:58,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240889597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:58,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:58,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:08:58,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971677844] [2025-03-14 01:08:58,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:58,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:08:58,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:58,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:08:58,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:08:58,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-14 01:08:58,841 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-14 01:08:58,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:58,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-14 01:08:58,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:59,952 INFO L124 PetriNetUnfolderBase]: 4381/7427 cut-off events. [2025-03-14 01:08:59,953 INFO L125 PetriNetUnfolderBase]: For 209074/209074 co-relation queries the response was YES. [2025-03-14 01:09:00,004 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-14 01:09:00,024 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 299 selfloop transitions, 39 changer transitions 3/345 dead transitions. [2025-03-14 01:09:00,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 345 transitions, 4712 flow [2025-03-14 01:09:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:09:00,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:09:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2025-03-14 01:09:00,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45670995670995673 [2025-03-14 01:09:00,025 INFO L175 Difference]: Start difference. First operand has 269 places, 264 transitions, 2976 flow. Second operand 11 states and 211 transitions. [2025-03-14 01:09:00,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 345 transitions, 4712 flow [2025-03-14 01:09:00,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 345 transitions, 4378 flow, removed 151 selfloop flow, removed 5 redundant places. [2025-03-14 01:09:00,341 INFO L231 Difference]: Finished difference. Result has 279 places, 276 transitions, 3184 flow [2025-03-14 01:09:00,342 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-14 01:09:00,342 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 238 predicate places. [2025-03-14 01:09:00,342 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 276 transitions, 3184 flow [2025-03-14 01:09:00,342 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-14 01:09:00,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:00,342 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-14 01:09:00,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-14 01:09:00,342 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-14 01:09:00,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:00,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1639851014, now seen corresponding path program 35 times [2025-03-14 01:09:00,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:00,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028621125] [2025-03-14 01:09:00,343 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:09:00,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:00,348 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:09:00,353 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:09:00,353 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:09:00,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:00,607 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-14 01:09:00,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:00,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028621125] [2025-03-14 01:09:00,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028621125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:00,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:00,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:09:00,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324520816] [2025-03-14 01:09:00,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:00,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:09:00,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:00,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:09:00,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:09:00,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:09:00,628 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-14 01:09:00,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:00,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:09:00,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:01,726 INFO L124 PetriNetUnfolderBase]: 4244/7255 cut-off events. [2025-03-14 01:09:01,726 INFO L125 PetriNetUnfolderBase]: For 206970/206970 co-relation queries the response was YES. [2025-03-14 01:09:01,801 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-14 01:09:01,823 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 281 selfloop transitions, 35 changer transitions 4/325 dead transitions. [2025-03-14 01:09:01,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 325 transitions, 4322 flow [2025-03-14 01:09:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:09:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:09:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2025-03-14 01:09:01,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4155844155844156 [2025-03-14 01:09:01,824 INFO L175 Difference]: Start difference. First operand has 279 places, 276 transitions, 3184 flow. Second operand 11 states and 192 transitions. [2025-03-14 01:09:01,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 325 transitions, 4322 flow [2025-03-14 01:09:02,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 325 transitions, 3998 flow, removed 147 selfloop flow, removed 4 redundant places. [2025-03-14 01:09:02,432 INFO L231 Difference]: Finished difference. Result has 288 places, 282 transitions, 3115 flow [2025-03-14 01:09:02,432 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-14 01:09:02,433 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 247 predicate places. [2025-03-14 01:09:02,433 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 282 transitions, 3115 flow [2025-03-14 01:09:02,433 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-14 01:09:02,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:02,433 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-14 01:09:02,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-14 01:09:02,433 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-14 01:09:02,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:02,433 INFO L85 PathProgramCache]: Analyzing trace with hash 924128896, now seen corresponding path program 36 times [2025-03-14 01:09:02,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:02,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808085399] [2025-03-14 01:09:02,434 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:09:02,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:02,439 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:09:02,447 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:09:02,447 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:09:02,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:02,785 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-14 01:09:02,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:02,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808085399] [2025-03-14 01:09:02,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808085399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:02,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:02,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:09:02,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856203623] [2025-03-14 01:09:02,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:02,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:09:02,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:02,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:09:02,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:09:02,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:09:02,815 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-14 01:09:02,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:02,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:09:02,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:03,972 INFO L124 PetriNetUnfolderBase]: 4395/7499 cut-off events. [2025-03-14 01:09:03,972 INFO L125 PetriNetUnfolderBase]: For 208634/208634 co-relation queries the response was YES. [2025-03-14 01:09:04,028 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-14 01:09:04,044 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 292 selfloop transitions, 41 changer transitions 3/341 dead transitions. [2025-03-14 01:09:04,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 341 transitions, 4607 flow [2025-03-14 01:09:04,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:09:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:09:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2025-03-14 01:09:04,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-14 01:09:04,045 INFO L175 Difference]: Start difference. First operand has 288 places, 282 transitions, 3115 flow. Second operand 11 states and 203 transitions. [2025-03-14 01:09:04,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 341 transitions, 4607 flow [2025-03-14 01:09:04,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 341 transitions, 4389 flow, removed 90 selfloop flow, removed 6 redundant places. [2025-03-14 01:09:04,429 INFO L231 Difference]: Finished difference. Result has 295 places, 289 transitions, 3350 flow [2025-03-14 01:09:04,429 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-14 01:09:04,430 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 254 predicate places. [2025-03-14 01:09:04,430 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 289 transitions, 3350 flow [2025-03-14 01:09:04,430 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-14 01:09:04,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:04,430 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-14 01:09:04,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-14 01:09:04,430 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-14 01:09:04,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash 770882024, now seen corresponding path program 37 times [2025-03-14 01:09:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:04,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436927615] [2025-03-14 01:09:04,431 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:09:04,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:04,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:09:04,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:09:04,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:04,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:04,731 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-14 01:09:04,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:04,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436927615] [2025-03-14 01:09:04,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436927615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:04,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:04,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:09:04,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434701745] [2025-03-14 01:09:04,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:04,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:09:04,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:04,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:09:04,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:09:04,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:09:04,754 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-14 01:09:04,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:04,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:09:04,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:05,984 INFO L124 PetriNetUnfolderBase]: 4458/7614 cut-off events. [2025-03-14 01:09:05,985 INFO L125 PetriNetUnfolderBase]: For 241409/241409 co-relation queries the response was YES. [2025-03-14 01:09:06,056 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-14 01:09:06,073 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 306 selfloop transitions, 34 changer transitions 3/348 dead transitions. [2025-03-14 01:09:06,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 348 transitions, 4787 flow [2025-03-14 01:09:06,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:09:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:09:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-03-14 01:09:06,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2025-03-14 01:09:06,081 INFO L175 Difference]: Start difference. First operand has 295 places, 289 transitions, 3350 flow. Second operand 11 states and 202 transitions. [2025-03-14 01:09:06,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 348 transitions, 4787 flow [2025-03-14 01:09:06,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 348 transitions, 4461 flow, removed 144 selfloop flow, removed 6 redundant places. [2025-03-14 01:09:06,518 INFO L231 Difference]: Finished difference. Result has 302 places, 294 transitions, 3338 flow [2025-03-14 01:09:06,519 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-14 01:09:06,519 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 261 predicate places. [2025-03-14 01:09:06,519 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 294 transitions, 3338 flow [2025-03-14 01:09:06,519 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-14 01:09:06,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:06,519 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-14 01:09:06,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-14 01:09:06,520 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-14 01:09:06,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash 47756430, now seen corresponding path program 38 times [2025-03-14 01:09:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:06,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632598530] [2025-03-14 01:09:06,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:09:06,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:06,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:09:06,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:09:06,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:09:06,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:06,823 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-14 01:09:06,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:06,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632598530] [2025-03-14 01:09:06,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632598530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:06,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:06,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:09:06,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191229399] [2025-03-14 01:09:06,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:06,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:09:06,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:06,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:09:06,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:09:06,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:09:06,848 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-14 01:09:06,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:06,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:09:06,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:08,021 INFO L124 PetriNetUnfolderBase]: 4458/7606 cut-off events. [2025-03-14 01:09:08,021 INFO L125 PetriNetUnfolderBase]: For 230027/230027 co-relation queries the response was YES. [2025-03-14 01:09:08,096 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-14 01:09:08,119 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 302 selfloop transitions, 33 changer transitions 3/343 dead transitions. [2025-03-14 01:09:08,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 343 transitions, 4517 flow [2025-03-14 01:09:08,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:09:08,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:09:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-14 01:09:08,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2025-03-14 01:09:08,120 INFO L175 Difference]: Start difference. First operand has 302 places, 294 transitions, 3338 flow. Second operand 11 states and 193 transitions. [2025-03-14 01:09:08,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 343 transitions, 4517 flow [2025-03-14 01:09:08,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 343 transitions, 4272 flow, removed 105 selfloop flow, removed 6 redundant places. [2025-03-14 01:09:08,824 INFO L231 Difference]: Finished difference. Result has 308 places, 297 transitions, 3244 flow [2025-03-14 01:09:08,824 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-14 01:09:08,825 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 267 predicate places. [2025-03-14 01:09:08,825 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 297 transitions, 3244 flow [2025-03-14 01:09:08,825 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-14 01:09:08,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:08,825 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-14 01:09:08,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-14 01:09:08,825 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-14 01:09:08,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:08,826 INFO L85 PathProgramCache]: Analyzing trace with hash -546841244, now seen corresponding path program 39 times [2025-03-14 01:09:08,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:08,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104775278] [2025-03-14 01:09:08,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:09:08,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:08,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:09:08,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:09:08,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:09:08,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:09,236 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-14 01:09:09,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:09,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104775278] [2025-03-14 01:09:09,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104775278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:09,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:09,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:09:09,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81659462] [2025-03-14 01:09:09,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:09,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:09:09,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:09,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:09:09,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:09:09,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:09:09,255 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-14 01:09:09,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:09,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:09:09,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:10,580 INFO L124 PetriNetUnfolderBase]: 4521/7722 cut-off events. [2025-03-14 01:09:10,580 INFO L125 PetriNetUnfolderBase]: For 232723/232723 co-relation queries the response was YES. [2025-03-14 01:09:10,661 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-14 01:09:10,687 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 312 selfloop transitions, 35 changer transitions 3/355 dead transitions. [2025-03-14 01:09:10,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 355 transitions, 4712 flow [2025-03-14 01:09:10,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:09:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:09:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-03-14 01:09:10,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2025-03-14 01:09:10,688 INFO L175 Difference]: Start difference. First operand has 308 places, 297 transitions, 3244 flow. Second operand 11 states and 202 transitions. [2025-03-14 01:09:10,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 355 transitions, 4712 flow [2025-03-14 01:09:11,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 355 transitions, 4586 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-03-14 01:09:11,386 INFO L231 Difference]: Finished difference. Result has 313 places, 302 transitions, 3442 flow [2025-03-14 01:09:11,386 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-14 01:09:11,386 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 272 predicate places. [2025-03-14 01:09:11,386 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 302 transitions, 3442 flow [2025-03-14 01:09:11,386 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-14 01:09:11,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:11,386 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-14 01:09:11,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-14 01:09:11,387 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-14 01:09:11,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:11,387 INFO L85 PathProgramCache]: Analyzing trace with hash 801465006, now seen corresponding path program 40 times [2025-03-14 01:09:11,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:11,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748638080] [2025-03-14 01:09:11,388 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:09:11,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:11,395 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:09:11,407 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:09:11,409 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:09:11,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:11,707 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-14 01:09:11,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:11,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748638080] [2025-03-14 01:09:11,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748638080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:11,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:11,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:09:11,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43129206] [2025-03-14 01:09:11,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:11,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:09:11,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:11,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:09:11,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:09:11,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-14 01:09:11,729 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-14 01:09:11,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:11,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-14 01:09:11,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:13,246 INFO L124 PetriNetUnfolderBase]: 4748/8067 cut-off events. [2025-03-14 01:09:13,247 INFO L125 PetriNetUnfolderBase]: For 259442/259442 co-relation queries the response was YES. [2025-03-14 01:09:13,325 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-14 01:09:13,343 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 322 selfloop transitions, 41 changer transitions 5/372 dead transitions. [2025-03-14 01:09:13,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 372 transitions, 4873 flow [2025-03-14 01:09:13,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:09:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:09:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2025-03-14 01:09:13,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-03-14 01:09:13,344 INFO L175 Difference]: Start difference. First operand has 313 places, 302 transitions, 3442 flow. Second operand 11 states and 209 transitions. [2025-03-14 01:09:13,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 372 transitions, 4873 flow [2025-03-14 01:09:13,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 372 transitions, 4617 flow, removed 112 selfloop flow, removed 5 redundant places. [2025-03-14 01:09:13,872 INFO L231 Difference]: Finished difference. Result has 321 places, 307 transitions, 3413 flow [2025-03-14 01:09:13,872 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-14 01:09:13,873 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 280 predicate places. [2025-03-14 01:09:13,873 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 307 transitions, 3413 flow [2025-03-14 01:09:13,873 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-14 01:09:13,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:13,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-14 01:09:13,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-14 01:09:13,873 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-14 01:09:13,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:13,874 INFO L85 PathProgramCache]: Analyzing trace with hash -683604332, now seen corresponding path program 41 times [2025-03-14 01:09:13,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:13,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048072793] [2025-03-14 01:09:13,875 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:09:13,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:13,879 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:09:13,885 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:09:13,885 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:09:13,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:14,179 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-14 01:09:14,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:14,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048072793] [2025-03-14 01:09:14,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048072793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:14,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:14,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:09:14,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519730976] [2025-03-14 01:09:14,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:14,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:09:14,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:14,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:09:14,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:09:14,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:09:14,204 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-14 01:09:14,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:14,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:09:14,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:15,281 INFO L124 PetriNetUnfolderBase]: 4586/7862 cut-off events. [2025-03-14 01:09:15,282 INFO L125 PetriNetUnfolderBase]: For 231667/231667 co-relation queries the response was YES. [2025-03-14 01:09:15,379 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-14 01:09:15,402 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 309 selfloop transitions, 36 changer transitions 3/353 dead transitions. [2025-03-14 01:09:15,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 353 transitions, 4539 flow [2025-03-14 01:09:15,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:09:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:09:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2025-03-14 01:09:15,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4155844155844156 [2025-03-14 01:09:15,403 INFO L175 Difference]: Start difference. First operand has 321 places, 307 transitions, 3413 flow. Second operand 11 states and 192 transitions. [2025-03-14 01:09:15,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 353 transitions, 4539 flow [2025-03-14 01:09:15,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 353 transitions, 4344 flow, removed 65 selfloop flow, removed 6 redundant places. [2025-03-14 01:09:15,834 INFO L231 Difference]: Finished difference. Result has 327 places, 310 transitions, 3382 flow [2025-03-14 01:09:15,835 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-14 01:09:15,835 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 286 predicate places. [2025-03-14 01:09:15,835 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 310 transitions, 3382 flow [2025-03-14 01:09:15,835 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-14 01:09:15,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:15,835 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-14 01:09:15,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-14 01:09:15,835 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-14 01:09:15,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:15,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1398801664, now seen corresponding path program 42 times [2025-03-14 01:09:15,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:15,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480172216] [2025-03-14 01:09:15,836 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:09:15,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:15,841 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:09:15,847 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:09:15,847 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:09:15,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:16,067 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-14 01:09:16,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:16,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480172216] [2025-03-14 01:09:16,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480172216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:16,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:16,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:09:16,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891457438] [2025-03-14 01:09:16,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:16,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:09:16,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:16,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:09:16,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:09:16,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:09:16,088 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-14 01:09:16,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:16,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:09:16,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:17,221 INFO L124 PetriNetUnfolderBase]: 4586/7874 cut-off events. [2025-03-14 01:09:17,221 INFO L125 PetriNetUnfolderBase]: For 226022/226022 co-relation queries the response was YES. [2025-03-14 01:09:17,319 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-14 01:09:17,344 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 312 selfloop transitions, 40 changer transitions 4/361 dead transitions. [2025-03-14 01:09:17,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 361 transitions, 4555 flow [2025-03-14 01:09:17,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:09:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:09:17,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2025-03-14 01:09:17,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-14 01:09:17,345 INFO L175 Difference]: Start difference. First operand has 327 places, 310 transitions, 3382 flow. Second operand 11 states and 198 transitions. [2025-03-14 01:09:17,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 361 transitions, 4555 flow [2025-03-14 01:09:17,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 361 transitions, 4389 flow, removed 49 selfloop flow, removed 8 redundant places. [2025-03-14 01:09:17,793 INFO L231 Difference]: Finished difference. Result has 331 places, 314 transitions, 3404 flow [2025-03-14 01:09:17,794 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-14 01:09:17,794 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 290 predicate places. [2025-03-14 01:09:17,794 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 314 transitions, 3404 flow [2025-03-14 01:09:17,794 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-14 01:09:17,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:17,795 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-14 01:09:17,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-14 01:09:17,795 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-14 01:09:17,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:17,796 INFO L85 PathProgramCache]: Analyzing trace with hash -544438204, now seen corresponding path program 43 times [2025-03-14 01:09:17,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:17,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825312554] [2025-03-14 01:09:17,796 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:09:17,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:17,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:09:17,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:09:17,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:17,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:18,066 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-14 01:09:18,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825312554] [2025-03-14 01:09:18,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825312554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:18,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:18,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:09:18,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111709569] [2025-03-14 01:09:18,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:18,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:09:18,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:18,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:09:18,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:09:18,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:09:18,085 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-14 01:09:18,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:18,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:09:18,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:19,221 INFO L124 PetriNetUnfolderBase]: 4586/7868 cut-off events. [2025-03-14 01:09:19,222 INFO L125 PetriNetUnfolderBase]: For 225500/225500 co-relation queries the response was YES. [2025-03-14 01:09:19,317 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-14 01:09:19,339 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 315 selfloop transitions, 34 changer transitions 3/357 dead transitions. [2025-03-14 01:09:19,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 357 transitions, 4468 flow [2025-03-14 01:09:19,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:09:19,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:09:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2025-03-14 01:09:19,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-14 01:09:19,339 INFO L175 Difference]: Start difference. First operand has 331 places, 314 transitions, 3404 flow. Second operand 11 states and 189 transitions. [2025-03-14 01:09:19,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 357 transitions, 4468 flow [2025-03-14 01:09:19,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 357 transitions, 4282 flow, removed 55 selfloop flow, removed 8 redundant places. [2025-03-14 01:09:19,812 INFO L231 Difference]: Finished difference. Result has 335 places, 316 transitions, 3310 flow [2025-03-14 01:09:19,812 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-14 01:09:19,812 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 294 predicate places. [2025-03-14 01:09:19,812 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 316 transitions, 3310 flow [2025-03-14 01:09:19,813 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-14 01:09:19,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:19,813 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-14 01:09:19,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-14 01:09:19,813 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-14 01:09:19,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:19,813 INFO L85 PathProgramCache]: Analyzing trace with hash 916041962, now seen corresponding path program 1 times [2025-03-14 01:09:19,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:19,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6250364] [2025-03-14 01:09:19,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:19,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:19,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:09:19,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:09:19,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:19,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:19,866 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-14 01:09:19,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:19,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6250364] [2025-03-14 01:09:19,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6250364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:09:19,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228590134] [2025-03-14 01:09:19,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:19,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:19,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:09:19,868 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-14 01:09:19,869 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-14 01:09:19,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:09:19,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:09:19,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:19,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:19,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:09:19,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:09:20,096 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-14 01:09:20,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:09:20,176 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-14 01:09:20,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228590134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:09:20,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:09:20,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-14 01:09:20,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207485858] [2025-03-14 01:09:20,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:09:20,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:09:20,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:20,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:09:20,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:09:20,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-14 01:09:20,178 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-14 01:09:20,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:20,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-14 01:09:20,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:22,075 INFO L124 PetriNetUnfolderBase]: 7743/13966 cut-off events. [2025-03-14 01:09:22,076 INFO L125 PetriNetUnfolderBase]: For 474128/474416 co-relation queries the response was YES. [2025-03-14 01:09:22,479 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-14 01:09:22,529 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 530 selfloop transitions, 6 changer transitions 12/592 dead transitions. [2025-03-14 01:09:22,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 592 transitions, 7392 flow [2025-03-14 01:09:22,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:09:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:09:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2025-03-14 01:09:22,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-03-14 01:09:22,531 INFO L175 Difference]: Start difference. First operand has 335 places, 316 transitions, 3310 flow. Second operand 7 states and 133 transitions. [2025-03-14 01:09:22,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 592 transitions, 7392 flow [2025-03-14 01:09:23,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 592 transitions, 7260 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-03-14 01:09:23,293 INFO L231 Difference]: Finished difference. Result has 337 places, 320 transitions, 3302 flow [2025-03-14 01:09:23,293 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-14 01:09:23,293 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 296 predicate places. [2025-03-14 01:09:23,293 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 320 transitions, 3302 flow [2025-03-14 01:09:23,294 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-14 01:09:23,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:23,294 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-14 01:09:23,300 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-14 01:09:23,494 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-14 01:09:23,494 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-14 01:09:23,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:23,495 INFO L85 PathProgramCache]: Analyzing trace with hash 874807726, now seen corresponding path program 1 times [2025-03-14 01:09:23,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:23,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610106869] [2025-03-14 01:09:23,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:23,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:23,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:09:23,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:09:23,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:23,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:23,562 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-14 01:09:23,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:23,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610106869] [2025-03-14 01:09:23,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610106869] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:09:23,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244088520] [2025-03-14 01:09:23,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:23,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:23,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:09:23,565 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-14 01:09:23,566 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-14 01:09:23,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:09:23,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:09:23,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:23,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:23,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:09:23,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:09:23,689 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-14 01:09:23,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:09:23,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244088520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:23,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:09:23,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-14 01:09:23,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406217217] [2025-03-14 01:09:23,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:23,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:09:23,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:23,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:09:23,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:09:23,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-14 01:09:23,691 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-14 01:09:23,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:23,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-14 01:09:23,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:25,733 INFO L124 PetriNetUnfolderBase]: 8576/15703 cut-off events. [2025-03-14 01:09:25,733 INFO L125 PetriNetUnfolderBase]: For 682206/684276 co-relation queries the response was YES. [2025-03-14 01:09:26,134 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-14 01:09:26,177 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 423 selfloop transitions, 34 changer transitions 0/501 dead transitions. [2025-03-14 01:09:26,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 501 transitions, 6416 flow [2025-03-14 01:09:26,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:09:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:09:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-14 01:09:26,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-03-14 01:09:26,178 INFO L175 Difference]: Start difference. First operand has 337 places, 320 transitions, 3302 flow. Second operand 4 states and 106 transitions. [2025-03-14 01:09:26,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 501 transitions, 6416 flow [2025-03-14 01:09:27,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 501 transitions, 6393 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-03-14 01:09:27,658 INFO L231 Difference]: Finished difference. Result has 339 places, 331 transitions, 3697 flow [2025-03-14 01:09:27,658 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-14 01:09:27,658 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 298 predicate places. [2025-03-14 01:09:27,658 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 331 transitions, 3697 flow [2025-03-14 01:09:27,658 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-14 01:09:27,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:27,658 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-14 01:09:27,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 01:09:27,859 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-14 01:09:27,859 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-14 01:09:27,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:27,859 INFO L85 PathProgramCache]: Analyzing trace with hash 833299377, now seen corresponding path program 2 times [2025-03-14 01:09:27,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:27,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549871659] [2025-03-14 01:09:27,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:09:27,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:27,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-14 01:09:27,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 35 statements. [2025-03-14 01:09:27,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:09:27,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:27,908 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-14 01:09:27,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:27,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549871659] [2025-03-14 01:09:27,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549871659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:27,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:27,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:09:27,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830344374] [2025-03-14 01:09:27,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:27,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:09:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:27,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:09:27,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:09:27,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-14 01:09:27,911 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-14 01:09:27,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:27,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-14 01:09:27,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:30,312 INFO L124 PetriNetUnfolderBase]: 10183/18230 cut-off events. [2025-03-14 01:09:30,312 INFO L125 PetriNetUnfolderBase]: For 779977/781855 co-relation queries the response was YES. [2025-03-14 01:09:30,570 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-14 01:09:30,618 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 324 selfloop transitions, 6 changer transitions 0/373 dead transitions. [2025-03-14 01:09:30,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 373 transitions, 4797 flow [2025-03-14 01:09:30,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:09:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:09:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2025-03-14 01:09:30,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-14 01:09:30,619 INFO L175 Difference]: Start difference. First operand has 339 places, 331 transitions, 3697 flow. Second operand 5 states and 112 transitions. [2025-03-14 01:09:30,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 373 transitions, 4797 flow [2025-03-14 01:09:32,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 373 transitions, 4618 flow, removed 79 selfloop flow, removed 5 redundant places. [2025-03-14 01:09:32,650 INFO L231 Difference]: Finished difference. Result has 339 places, 333 transitions, 3558 flow [2025-03-14 01:09:32,650 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-14 01:09:32,650 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 298 predicate places. [2025-03-14 01:09:32,651 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 333 transitions, 3558 flow [2025-03-14 01:09:32,651 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-14 01:09:32,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:32,651 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-14 01:09:32,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-14 01:09:32,651 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-14 01:09:32,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:32,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1494129970, now seen corresponding path program 1 times [2025-03-14 01:09:32,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:32,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438969946] [2025-03-14 01:09:32,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:32,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:32,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:09:32,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:09:32,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:32,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:32,715 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-14 01:09:32,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:32,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438969946] [2025-03-14 01:09:32,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438969946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:09:32,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395044773] [2025-03-14 01:09:32,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:32,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:32,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:09:32,717 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-14 01:09:32,718 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-14 01:09:32,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:09:32,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:09:32,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:32,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:32,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:09:32,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:09:32,827 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-14 01:09:32,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:09:32,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395044773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:32,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:09:32,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-14 01:09:32,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966366340] [2025-03-14 01:09:32,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:32,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:09:32,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:32,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:09:32,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:09:32,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-14 01:09:32,828 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-14 01:09:32,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:32,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-14 01:09:32,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:35,382 INFO L124 PetriNetUnfolderBase]: 7149/13451 cut-off events. [2025-03-14 01:09:35,382 INFO L125 PetriNetUnfolderBase]: For 643500/647820 co-relation queries the response was YES. [2025-03-14 01:09:35,569 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-14 01:09:35,614 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 101 selfloop transitions, 9 changer transitions 136/252 dead transitions. [2025-03-14 01:09:35,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 252 transitions, 3723 flow [2025-03-14 01:09:35,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:09:35,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:09:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-14 01:09:35,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-14 01:09:35,615 INFO L175 Difference]: Start difference. First operand has 339 places, 333 transitions, 3558 flow. Second operand 4 states and 112 transitions. [2025-03-14 01:09:35,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 252 transitions, 3723 flow [2025-03-14 01:09:37,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 252 transitions, 3516 flow, removed 15 selfloop flow, removed 19 redundant places. [2025-03-14 01:09:37,318 INFO L231 Difference]: Finished difference. Result has 325 places, 64 transitions, 905 flow [2025-03-14 01:09:37,318 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-14 01:09:37,318 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 284 predicate places. [2025-03-14 01:09:37,318 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 64 transitions, 905 flow [2025-03-14 01:09:37,319 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-14 01:09:37,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:37,319 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-14 01:09:37,325 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-14 01:09:37,519 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-14 01:09:37,519 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-14 01:09:37,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:37,520 INFO L85 PathProgramCache]: Analyzing trace with hash 178971151, now seen corresponding path program 1 times [2025-03-14 01:09:37,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:37,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056484353] [2025-03-14 01:09:37,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:37,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:37,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:09:37,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:09:37,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:37,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:37,687 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-14 01:09:37,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:37,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056484353] [2025-03-14 01:09:37,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056484353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:09:37,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189300520] [2025-03-14 01:09:37,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:37,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:37,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:09:37,689 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-14 01:09:37,690 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-14 01:09:37,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:09:37,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:09:37,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:37,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:37,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:09:37,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:09:37,831 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-14 01:09:37,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:09:37,903 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-14 01:09:37,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189300520] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:09:37,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:09:37,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-14 01:09:37,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930404339] [2025-03-14 01:09:37,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:09:37,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:09:37,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:37,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:09:37,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:09:37,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-14 01:09:37,904 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-14 01:09:37,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:37,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-14 01:09:37,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:39,221 INFO L124 PetriNetUnfolderBase]: 6401/10798 cut-off events. [2025-03-14 01:09:39,221 INFO L125 PetriNetUnfolderBase]: For 731589/735909 co-relation queries the response was YES. [2025-03-14 01:09:39,341 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-14 01:09:39,376 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 56 selfloop transitions, 3 changer transitions 59/124 dead transitions. [2025-03-14 01:09:39,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 124 transitions, 1903 flow [2025-03-14 01:09:39,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:09:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:09:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2025-03-14 01:09:39,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-03-14 01:09:39,376 INFO L175 Difference]: Start difference. First operand has 325 places, 64 transitions, 905 flow. Second operand 6 states and 120 transitions. [2025-03-14 01:09:39,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 124 transitions, 1903 flow [2025-03-14 01:09:40,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 124 transitions, 946 flow, removed 271 selfloop flow, removed 112 redundant places. [2025-03-14 01:09:40,141 INFO L231 Difference]: Finished difference. Result has 93 places, 65 transitions, 382 flow [2025-03-14 01:09:40,141 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-14 01:09:40,141 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 52 predicate places. [2025-03-14 01:09:40,142 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 65 transitions, 382 flow [2025-03-14 01:09:40,142 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-14 01:09:40,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:40,142 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-14 01:09:40,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 01:09:40,342 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-14 01:09:40,342 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-14 01:09:40,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:40,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1362058746, now seen corresponding path program 2 times [2025-03-14 01:09:40,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:40,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401585688] [2025-03-14 01:09:40,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:09:40,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:40,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-14 01:09:40,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:09:40,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:09:40,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:40,722 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-14 01:09:40,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:40,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401585688] [2025-03-14 01:09:40,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401585688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:09:40,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246945882] [2025-03-14 01:09:40,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:09:40,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:40,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:09:40,725 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-14 01:09:40,726 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-14 01:09:40,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-14 01:09:40,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:09:40,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:09:40,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:40,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-14 01:09:40,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:09:41,008 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-14 01:09:41,039 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-14 01:09:41,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:09:41,170 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-14 01:09:41,171 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-14 01:09:41,416 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-14 01:09:41,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246945882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:09:41,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:09:41,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 27 [2025-03-14 01:09:41,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051039692] [2025-03-14 01:09:41,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:09:41,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-14 01:09:41,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:41,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-14 01:09:41,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2025-03-14 01:09:41,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 42 [2025-03-14 01:09:41,436 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-14 01:09:41,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:41,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 42 [2025-03-14 01:09:41,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand