./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:41:25,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:41:25,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:41:25,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:41:25,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:41:25,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:41:25,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:41:25,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:41:25,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:41:25,934 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:41:25,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:41:25,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:41:25,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:41:25,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:41:25,934 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:41:25,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:41:25,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:41:25,935 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:41:25,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:41:25,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:41:25,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:41:25,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:41:25,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:41:25,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:41:25,935 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:41:25,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:41:25,935 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:41:25,935 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:41:25,936 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:41:25,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:41:25,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:41:25,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:41:25,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:41:25,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:41:25,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:41:25,936 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:41:25,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:41:25,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:41:25,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:41:25,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:41:25,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:41:25,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:41:25,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:41:25,937 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac [2025-02-06 04:41:26,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:41:26,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:41:26,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:41:26,129 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:41:26,129 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:41:26,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-02-06 04:41:27,272 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb24a2839/9d079085f4ed4788b537f1eca1776c6a/FLAG5ce57a21a [2025-02-06 04:41:27,516 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:41:27,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-02-06 04:41:27,525 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb24a2839/9d079085f4ed4788b537f1eca1776c6a/FLAG5ce57a21a [2025-02-06 04:41:27,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb24a2839/9d079085f4ed4788b537f1eca1776c6a [2025-02-06 04:41:27,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:41:27,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:41:27,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:41:27,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:41:27,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:41:27,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:41:27" (1/1) ... [2025-02-06 04:41:27,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1185c9e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:27, skipping insertion in model container [2025-02-06 04:41:27,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:41:27" (1/1) ... [2025-02-06 04:41:27,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:41:27,697 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c[3654,3667] [2025-02-06 04:41:27,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:41:27,715 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:41:27,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c[3654,3667] [2025-02-06 04:41:27,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:41:27,753 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:41:27,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:27 WrapperNode [2025-02-06 04:41:27,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:41:27,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:41:27,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:41:27,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:41:27,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:27" (1/1) ... [2025-02-06 04:41:27,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:27" (1/1) ... [2025-02-06 04:41:27,791 INFO L138 Inliner]: procedures = 25, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 237 [2025-02-06 04:41:27,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:41:27,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:41:27,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:41:27,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:41:27,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:27" (1/1) ... [2025-02-06 04:41:27,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:27" (1/1) ... [2025-02-06 04:41:27,800 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:27" (1/1) ... [2025-02-06 04:41:27,816 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-02-06 04:41:27,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:27" (1/1) ... [2025-02-06 04:41:27,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:27" (1/1) ... [2025-02-06 04:41:27,824 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:27" (1/1) ... [2025-02-06 04:41:27,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:27" (1/1) ... [2025-02-06 04:41:27,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:27" (1/1) ... [2025-02-06 04:41:27,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:27" (1/1) ... [2025-02-06 04:41:27,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:41:27,828 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:41:27,828 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:41:27,828 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:41:27,829 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:27" (1/1) ... [2025-02-06 04:41:27,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:41:27,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:41:27,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:41:27,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:41:27,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:41:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:41:27,874 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:41:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:41:27,874 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:41:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:41:27,874 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:41:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:41:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:41:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:41:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:41:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:41:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:41:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:41:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:41:27,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:41:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:41:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:41:27,876 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:41:27,947 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:41:27,948 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:41:28,175 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:41:28,176 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:41:28,411 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:41:28,412 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:41:28,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:41:28 BoogieIcfgContainer [2025-02-06 04:41:28,413 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:41:28,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:41:28,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:41:28,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:41:28,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:41:27" (1/3) ... [2025-02-06 04:41:28,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccce67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:41:28, skipping insertion in model container [2025-02-06 04:41:28,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:27" (2/3) ... [2025-02-06 04:41:28,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccce67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:41:28, skipping insertion in model container [2025-02-06 04:41:28,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:41:28" (3/3) ... [2025-02-06 04:41:28,421 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2025-02-06 04:41:28,432 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:41:28,434 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-3-nl.wvr.c that has 4 procedures, 38 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-06 04:41:28,435 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:41:28,486 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 04:41:28,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 109 flow [2025-02-06 04:41:28,533 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2025-02-06 04:41:28,535 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:41:28,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 7/41 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-02-06 04:41:28,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 44 transitions, 109 flow [2025-02-06 04:41:28,540 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 40 transitions, 98 flow [2025-02-06 04:41:28,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:41:28,558 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;@46a10c0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:41:28,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:41:28,569 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:41:28,569 INFO L124 PetriNetUnfolderBase]: 7/39 cut-off events. [2025-02-06 04:41:28,570 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:41:28,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:28,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:41:28,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:28,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:28,577 INFO L85 PathProgramCache]: Analyzing trace with hash -900036442, now seen corresponding path program 1 times [2025-02-06 04:41:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:28,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54992351] [2025-02-06 04:41:28,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:41:28,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:28,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:41:28,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:41:28,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:41:28,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:28,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:28,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54992351] [2025-02-06 04:41:28,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54992351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:28,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:28,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:41:28,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761389758] [2025-02-06 04:41:28,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:28,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:41:28,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:28,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:41:28,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:41:28,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-02-06 04:41:28,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 98 flow. Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:28,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:28,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-02-06 04:41:28,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:29,031 INFO L124 PetriNetUnfolderBase]: 1088/1721 cut-off events. [2025-02-06 04:41:29,032 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-02-06 04:41:29,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3300 conditions, 1721 events. 1088/1721 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8018 event pairs, 892 based on Foata normal form. 156/1718 useless extension candidates. Maximal degree in co-relation 3064. Up to 1453 conditions per place. [2025-02-06 04:41:29,045 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 30 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2025-02-06 04:41:29,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 154 flow [2025-02-06 04:41:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:41:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 04:41:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2025-02-06 04:41:29,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-02-06 04:41:29,060 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 98 flow. Second operand 2 states and 54 transitions. [2025-02-06 04:41:29,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 154 flow [2025-02-06 04:41:29,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 142 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 04:41:29,069 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 82 flow [2025-02-06 04:41:29,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2025-02-06 04:41:29,074 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2025-02-06 04:41:29,074 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 82 flow [2025-02-06 04:41:29,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:29,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:29,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:41:29,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:41:29,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:29,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:29,077 INFO L85 PathProgramCache]: Analyzing trace with hash -364780604, now seen corresponding path program 1 times [2025-02-06 04:41:29,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:29,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131994870] [2025-02-06 04:41:29,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:41:29,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:29,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:41:29,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:41:29,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:41:29,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:29,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:29,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131994870] [2025-02-06 04:41:29,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131994870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:29,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:29,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:41:29,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308955180] [2025-02-06 04:41:29,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:29,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:41:29,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:29,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:41:29,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:41:29,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-02-06 04:41:29,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:29,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:29,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-02-06 04:41:29,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:29,444 INFO L124 PetriNetUnfolderBase]: 1046/1647 cut-off events. [2025-02-06 04:41:29,445 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 04:41:29,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3157 conditions, 1647 events. 1046/1647 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7423 event pairs, 271 based on Foata normal form. 33/1594 useless extension candidates. Maximal degree in co-relation 3154. Up to 1273 conditions per place. [2025-02-06 04:41:29,454 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 40 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2025-02-06 04:41:29,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 196 flow [2025-02-06 04:41:29,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:41:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:41:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-02-06 04:41:29,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-02-06 04:41:29,458 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 82 flow. Second operand 3 states and 77 transitions. [2025-02-06 04:41:29,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 196 flow [2025-02-06 04:41:29,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 196 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:41:29,461 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 101 flow [2025-02-06 04:41:29,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2025-02-06 04:41:29,462 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-02-06 04:41:29,462 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 101 flow [2025-02-06 04:41:29,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:29,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:29,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:41:29,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:41:29,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:29,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:29,464 INFO L85 PathProgramCache]: Analyzing trace with hash -409231726, now seen corresponding path program 2 times [2025-02-06 04:41:29,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:29,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33681709] [2025-02-06 04:41:29,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:41:29,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:29,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:41:29,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:41:29,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:41:29,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:29,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:29,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33681709] [2025-02-06 04:41:29,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33681709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:29,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:29,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:41:29,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469673674] [2025-02-06 04:41:29,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:29,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:41:29,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:29,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:41:29,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:41:29,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-02-06 04:41:29,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:29,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:29,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-02-06 04:41:29,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:29,751 INFO L124 PetriNetUnfolderBase]: 900/1499 cut-off events. [2025-02-06 04:41:29,751 INFO L125 PetriNetUnfolderBase]: For 260/263 co-relation queries the response was YES. [2025-02-06 04:41:29,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3118 conditions, 1499 events. 900/1499 cut-off events. For 260/263 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6853 event pairs, 304 based on Foata normal form. 26/1445 useless extension candidates. Maximal degree in co-relation 3113. Up to 880 conditions per place. [2025-02-06 04:41:29,760 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 42 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2025-02-06 04:41:29,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 221 flow [2025-02-06 04:41:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:41:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:41:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-02-06 04:41:29,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-02-06 04:41:29,763 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 101 flow. Second operand 3 states and 76 transitions. [2025-02-06 04:41:29,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 221 flow [2025-02-06 04:41:29,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:41:29,766 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 110 flow [2025-02-06 04:41:29,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2025-02-06 04:41:29,767 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2025-02-06 04:41:29,767 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 110 flow [2025-02-06 04:41:29,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:29,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:29,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:41:29,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:41:29,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:29,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:29,768 INFO L85 PathProgramCache]: Analyzing trace with hash 679028410, now seen corresponding path program 3 times [2025-02-06 04:41:29,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:29,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650107710] [2025-02-06 04:41:29,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:41:29,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:29,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:41:29,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:41:29,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:41:29,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:29,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:29,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650107710] [2025-02-06 04:41:29,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650107710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:29,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:29,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:41:29,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526538610] [2025-02-06 04:41:29,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:29,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:41:29,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:29,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:41:29,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:41:29,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-02-06 04:41:29,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:29,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:29,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-02-06 04:41:29,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:30,181 INFO L124 PetriNetUnfolderBase]: 948/1600 cut-off events. [2025-02-06 04:41:30,181 INFO L125 PetriNetUnfolderBase]: For 362/364 co-relation queries the response was YES. [2025-02-06 04:41:30,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3470 conditions, 1600 events. 948/1600 cut-off events. For 362/364 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7369 event pairs, 700 based on Foata normal form. 27/1545 useless extension candidates. Maximal degree in co-relation 3464. Up to 1275 conditions per place. [2025-02-06 04:41:30,189 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 32 selfloop transitions, 2 changer transitions 13/55 dead transitions. [2025-02-06 04:41:30,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 235 flow [2025-02-06 04:41:30,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:41:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:41:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-02-06 04:41:30,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-02-06 04:41:30,191 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 110 flow. Second operand 4 states and 90 transitions. [2025-02-06 04:41:30,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 235 flow [2025-02-06 04:41:30,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:41:30,194 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 124 flow [2025-02-06 04:41:30,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-02-06 04:41:30,194 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2025-02-06 04:41:30,195 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 124 flow [2025-02-06 04:41:30,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:30,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:30,195 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] [2025-02-06 04:41:30,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:41:30,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:30,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:30,196 INFO L85 PathProgramCache]: Analyzing trace with hash 548337619, now seen corresponding path program 1 times [2025-02-06 04:41:30,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:30,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24007517] [2025-02-06 04:41:30,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:41:30,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:30,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 04:41:30,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:41:30,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:41:30,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:41:30,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:30,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24007517] [2025-02-06 04:41:30,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24007517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:30,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:30,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:41:30,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512788025] [2025-02-06 04:41:30,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:30,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:41:30,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:30,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:41:30,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:41:30,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-02-06 04:41:30,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-02-06 04:41:30,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:30,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-02-06 04:41:30,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:30,480 INFO L124 PetriNetUnfolderBase]: 1142/1926 cut-off events. [2025-02-06 04:41:30,480 INFO L125 PetriNetUnfolderBase]: For 549/554 co-relation queries the response was YES. [2025-02-06 04:41:30,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4247 conditions, 1926 events. 1142/1926 cut-off events. For 549/554 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 9370 event pairs, 855 based on Foata normal form. 32/1875 useless extension candidates. Maximal degree in co-relation 4239. Up to 1276 conditions per place. [2025-02-06 04:41:30,491 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 33 selfloop transitions, 2 changer transitions 19/62 dead transitions. [2025-02-06 04:41:30,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 290 flow [2025-02-06 04:41:30,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:41:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:41:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-02-06 04:41:30,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5284090909090909 [2025-02-06 04:41:30,493 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 124 flow. Second operand 4 states and 93 transitions. [2025-02-06 04:41:30,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 290 flow [2025-02-06 04:41:30,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 278 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-02-06 04:41:30,495 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 130 flow [2025-02-06 04:41:30,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2025-02-06 04:41:30,498 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2025-02-06 04:41:30,498 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 130 flow [2025-02-06 04:41:30,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-02-06 04:41:30,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:30,498 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] [2025-02-06 04:41:30,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:41:30,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:30,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:30,499 INFO L85 PathProgramCache]: Analyzing trace with hash -882837494, now seen corresponding path program 1 times [2025-02-06 04:41:30,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:30,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726277455] [2025-02-06 04:41:30,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:41:30,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:30,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 04:41:30,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:41:30,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:41:30,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:31,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:31,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726277455] [2025-02-06 04:41:31,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726277455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:31,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:31,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:31,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428065610] [2025-02-06 04:41:31,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:31,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:31,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:31,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:31,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:31,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:31,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 130 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:31,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:31,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:31,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:31,894 INFO L124 PetriNetUnfolderBase]: 1302/2208 cut-off events. [2025-02-06 04:41:31,895 INFO L125 PetriNetUnfolderBase]: For 566/566 co-relation queries the response was YES. [2025-02-06 04:41:31,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4832 conditions, 2208 events. 1302/2208 cut-off events. For 566/566 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 11606 event pairs, 135 based on Foata normal form. 1/2145 useless extension candidates. Maximal degree in co-relation 4823. Up to 1406 conditions per place. [2025-02-06 04:41:31,904 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 99 selfloop transitions, 25 changer transitions 3/134 dead transitions. [2025-02-06 04:41:31,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 134 transitions, 641 flow [2025-02-06 04:41:31,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:41:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:41:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 245 transitions. [2025-02-06 04:41:31,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4640151515151515 [2025-02-06 04:41:31,909 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 130 flow. Second operand 12 states and 245 transitions. [2025-02-06 04:41:31,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 134 transitions, 641 flow [2025-02-06 04:41:31,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 134 transitions, 625 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-02-06 04:41:31,912 INFO L231 Difference]: Finished difference. Result has 62 places, 65 transitions, 260 flow [2025-02-06 04:41:31,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=260, PETRI_PLACES=62, PETRI_TRANSITIONS=65} [2025-02-06 04:41:31,912 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2025-02-06 04:41:31,912 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 65 transitions, 260 flow [2025-02-06 04:41:31,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:31,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:31,913 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] [2025-02-06 04:41:31,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:41:31,913 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:31,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:31,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1313695442, now seen corresponding path program 2 times [2025-02-06 04:41:31,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:31,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434022644] [2025-02-06 04:41:31,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:41:31,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:31,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:31,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:41:31,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:41:31,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:32,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:32,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434022644] [2025-02-06 04:41:32,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434022644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:32,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:32,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:32,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347134491] [2025-02-06 04:41:32,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:32,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:32,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:32,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:32,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:32,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:32,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 65 transitions, 260 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:32,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:32,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:32,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:33,037 INFO L124 PetriNetUnfolderBase]: 1463/2522 cut-off events. [2025-02-06 04:41:33,038 INFO L125 PetriNetUnfolderBase]: For 1508/1508 co-relation queries the response was YES. [2025-02-06 04:41:33,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6652 conditions, 2522 events. 1463/2522 cut-off events. For 1508/1508 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 13763 event pairs, 430 based on Foata normal form. 1/2454 useless extension candidates. Maximal degree in co-relation 6639. Up to 1741 conditions per place. [2025-02-06 04:41:33,049 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 98 selfloop transitions, 33 changer transitions 3/141 dead transitions. [2025-02-06 04:41:33,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 141 transitions, 815 flow [2025-02-06 04:41:33,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:41:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:41:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions. [2025-02-06 04:41:33,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4628099173553719 [2025-02-06 04:41:33,051 INFO L175 Difference]: Start difference. First operand has 62 places, 65 transitions, 260 flow. Second operand 11 states and 224 transitions. [2025-02-06 04:41:33,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 141 transitions, 815 flow [2025-02-06 04:41:33,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 141 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:41:33,055 INFO L231 Difference]: Finished difference. Result has 77 places, 86 transitions, 484 flow [2025-02-06 04:41:33,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=484, PETRI_PLACES=77, PETRI_TRANSITIONS=86} [2025-02-06 04:41:33,056 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2025-02-06 04:41:33,056 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 86 transitions, 484 flow [2025-02-06 04:41:33,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:33,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:33,056 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] [2025-02-06 04:41:33,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:41:33,056 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:33,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:33,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1027001914, now seen corresponding path program 3 times [2025-02-06 04:41:33,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:33,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111157968] [2025-02-06 04:41:33,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:41:33,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:33,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:33,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:41:33,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:41:33,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:33,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:33,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111157968] [2025-02-06 04:41:33,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111157968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:33,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:33,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:33,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73464827] [2025-02-06 04:41:33,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:33,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:33,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:33,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:33,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:33,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:33,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 86 transitions, 484 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:33,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:33,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:33,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:34,189 INFO L124 PetriNetUnfolderBase]: 1576/2768 cut-off events. [2025-02-06 04:41:34,190 INFO L125 PetriNetUnfolderBase]: For 3298/3310 co-relation queries the response was YES. [2025-02-06 04:41:34,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8090 conditions, 2768 events. 1576/2768 cut-off events. For 3298/3310 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15791 event pairs, 306 based on Foata normal form. 4/2692 useless extension candidates. Maximal degree in co-relation 8069. Up to 1798 conditions per place. [2025-02-06 04:41:34,207 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 111 selfloop transitions, 39 changer transitions 3/160 dead transitions. [2025-02-06 04:41:34,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 160 transitions, 1073 flow [2025-02-06 04:41:34,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:41:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:41:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 245 transitions. [2025-02-06 04:41:34,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4640151515151515 [2025-02-06 04:41:34,209 INFO L175 Difference]: Start difference. First operand has 77 places, 86 transitions, 484 flow. Second operand 12 states and 245 transitions. [2025-02-06 04:41:34,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 160 transitions, 1073 flow [2025-02-06 04:41:34,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 160 transitions, 1055 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-02-06 04:41:34,218 INFO L231 Difference]: Finished difference. Result has 90 places, 92 transitions, 609 flow [2025-02-06 04:41:34,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=609, PETRI_PLACES=90, PETRI_TRANSITIONS=92} [2025-02-06 04:41:34,218 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places. [2025-02-06 04:41:34,219 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 92 transitions, 609 flow [2025-02-06 04:41:34,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:34,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:34,219 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] [2025-02-06 04:41:34,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:41:34,219 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:34,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:34,220 INFO L85 PathProgramCache]: Analyzing trace with hash -435485124, now seen corresponding path program 4 times [2025-02-06 04:41:34,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:34,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742174902] [2025-02-06 04:41:34,220 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:41:34,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:34,227 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:34,260 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:41:34,261 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:41:34,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:34,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:34,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742174902] [2025-02-06 04:41:34,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742174902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:34,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:34,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:34,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033068539] [2025-02-06 04:41:34,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:34,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:34,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:34,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:34,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:34,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 04:41:34,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 92 transitions, 609 flow. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:34,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:34,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 04:41:34,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:35,357 INFO L124 PetriNetUnfolderBase]: 1941/3385 cut-off events. [2025-02-06 04:41:35,357 INFO L125 PetriNetUnfolderBase]: For 6596/6620 co-relation queries the response was YES. [2025-02-06 04:41:35,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10517 conditions, 3385 events. 1941/3385 cut-off events. For 6596/6620 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 20196 event pairs, 450 based on Foata normal form. 7/3276 useless extension candidates. Maximal degree in co-relation 10492. Up to 2176 conditions per place. [2025-02-06 04:41:35,372 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 121 selfloop transitions, 43 changer transitions 3/173 dead transitions. [2025-02-06 04:41:35,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 173 transitions, 1288 flow [2025-02-06 04:41:35,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:41:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:41:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 239 transitions. [2025-02-06 04:41:35,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45265151515151514 [2025-02-06 04:41:35,374 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 609 flow. Second operand 12 states and 239 transitions. [2025-02-06 04:41:35,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 173 transitions, 1288 flow [2025-02-06 04:41:35,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 173 transitions, 1218 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-02-06 04:41:35,383 INFO L231 Difference]: Finished difference. Result has 97 places, 101 transitions, 721 flow [2025-02-06 04:41:35,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=721, PETRI_PLACES=97, PETRI_TRANSITIONS=101} [2025-02-06 04:41:35,384 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places. [2025-02-06 04:41:35,384 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 101 transitions, 721 flow [2025-02-06 04:41:35,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:35,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:35,384 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] [2025-02-06 04:41:35,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:41:35,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:35,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:35,385 INFO L85 PathProgramCache]: Analyzing trace with hash -845181952, now seen corresponding path program 5 times [2025-02-06 04:41:35,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:35,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419425378] [2025-02-06 04:41:35,385 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:41:35,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:35,392 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:35,408 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:41:35,408 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:41:35,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:35,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:35,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419425378] [2025-02-06 04:41:35,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419425378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:35,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:35,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:35,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444928557] [2025-02-06 04:41:35,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:35,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:35,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:35,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:35,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:35,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:35,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 101 transitions, 721 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:35,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:35,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:35,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:36,354 INFO L124 PetriNetUnfolderBase]: 1743/3097 cut-off events. [2025-02-06 04:41:36,354 INFO L125 PetriNetUnfolderBase]: For 7692/7716 co-relation queries the response was YES. [2025-02-06 04:41:36,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10251 conditions, 3097 events. 1743/3097 cut-off events. For 7692/7716 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 18571 event pairs, 410 based on Foata normal form. 16/3005 useless extension candidates. Maximal degree in co-relation 10222. Up to 2171 conditions per place. [2025-02-06 04:41:36,369 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 116 selfloop transitions, 38 changer transitions 3/164 dead transitions. [2025-02-06 04:41:36,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 164 transitions, 1293 flow [2025-02-06 04:41:36,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:41:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:41:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2025-02-06 04:41:36,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2025-02-06 04:41:36,371 INFO L175 Difference]: Start difference. First operand has 97 places, 101 transitions, 721 flow. Second operand 12 states and 236 transitions. [2025-02-06 04:41:36,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 164 transitions, 1293 flow [2025-02-06 04:41:36,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 164 transitions, 1205 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-02-06 04:41:36,383 INFO L231 Difference]: Finished difference. Result has 104 places, 104 transitions, 742 flow [2025-02-06 04:41:36,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=742, PETRI_PLACES=104, PETRI_TRANSITIONS=104} [2025-02-06 04:41:36,384 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places. [2025-02-06 04:41:36,384 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 104 transitions, 742 flow [2025-02-06 04:41:36,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:36,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:36,384 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] [2025-02-06 04:41:36,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:41:36,384 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:36,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:36,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1081696828, now seen corresponding path program 6 times [2025-02-06 04:41:36,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:36,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928435217] [2025-02-06 04:41:36,385 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:41:36,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:36,392 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:36,401 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:41:36,401 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:41:36,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:36,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:36,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928435217] [2025-02-06 04:41:36,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928435217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:36,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:36,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:36,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362615778] [2025-02-06 04:41:36,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:36,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:36,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:36,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:36,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:36,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:36,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 104 transitions, 742 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:36,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:36,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:36,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:37,323 INFO L124 PetriNetUnfolderBase]: 1865/3328 cut-off events. [2025-02-06 04:41:37,324 INFO L125 PetriNetUnfolderBase]: For 8372/8396 co-relation queries the response was YES. [2025-02-06 04:41:37,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11053 conditions, 3328 events. 1865/3328 cut-off events. For 8372/8396 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 20461 event pairs, 612 based on Foata normal form. 7/3215 useless extension candidates. Maximal degree in co-relation 11021. Up to 2438 conditions per place. [2025-02-06 04:41:37,341 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 123 selfloop transitions, 36 changer transitions 3/169 dead transitions. [2025-02-06 04:41:37,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 169 transitions, 1421 flow [2025-02-06 04:41:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:41:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:41:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 223 transitions. [2025-02-06 04:41:37,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4607438016528926 [2025-02-06 04:41:37,343 INFO L175 Difference]: Start difference. First operand has 104 places, 104 transitions, 742 flow. Second operand 11 states and 223 transitions. [2025-02-06 04:41:37,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 169 transitions, 1421 flow [2025-02-06 04:41:37,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 169 transitions, 1335 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-02-06 04:41:37,359 INFO L231 Difference]: Finished difference. Result has 110 places, 115 transitions, 889 flow [2025-02-06 04:41:37,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=889, PETRI_PLACES=110, PETRI_TRANSITIONS=115} [2025-02-06 04:41:37,360 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places. [2025-02-06 04:41:37,360 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 115 transitions, 889 flow [2025-02-06 04:41:37,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:37,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:37,360 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] [2025-02-06 04:41:37,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:41:37,361 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:37,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:37,362 INFO L85 PathProgramCache]: Analyzing trace with hash -743858852, now seen corresponding path program 7 times [2025-02-06 04:41:37,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:37,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260103491] [2025-02-06 04:41:37,362 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:41:37,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:37,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 04:41:37,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:41:37,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:41:37,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:37,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:37,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260103491] [2025-02-06 04:41:37,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260103491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:37,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:37,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:37,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39970244] [2025-02-06 04:41:37,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:37,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:37,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:37,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:37,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:37,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:37,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 115 transitions, 889 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:37,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:37,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:37,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:38,491 INFO L124 PetriNetUnfolderBase]: 2005/3579 cut-off events. [2025-02-06 04:41:38,491 INFO L125 PetriNetUnfolderBase]: For 13987/14023 co-relation queries the response was YES. [2025-02-06 04:41:38,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12645 conditions, 3579 events. 2005/3579 cut-off events. For 13987/14023 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 22360 event pairs, 592 based on Foata normal form. 9/3460 useless extension candidates. Maximal degree in co-relation 12608. Up to 2643 conditions per place. [2025-02-06 04:41:38,508 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 132 selfloop transitions, 36 changer transitions 3/178 dead transitions. [2025-02-06 04:41:38,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 178 transitions, 1604 flow [2025-02-06 04:41:38,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:41:38,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:41:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2025-02-06 04:41:38,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-02-06 04:41:38,511 INFO L175 Difference]: Start difference. First operand has 110 places, 115 transitions, 889 flow. Second operand 11 states and 220 transitions. [2025-02-06 04:41:38,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 178 transitions, 1604 flow [2025-02-06 04:41:38,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 178 transitions, 1517 flow, removed 36 selfloop flow, removed 2 redundant places. [2025-02-06 04:41:38,534 INFO L231 Difference]: Finished difference. Result has 122 places, 124 transitions, 1035 flow [2025-02-06 04:41:38,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1035, PETRI_PLACES=122, PETRI_TRANSITIONS=124} [2025-02-06 04:41:38,535 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places. [2025-02-06 04:41:38,535 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 124 transitions, 1035 flow [2025-02-06 04:41:38,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:38,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:38,537 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] [2025-02-06 04:41:38,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:41:38,537 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:38,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:38,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1375291294, now seen corresponding path program 8 times [2025-02-06 04:41:38,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:38,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141768298] [2025-02-06 04:41:38,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:41:38,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:38,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:38,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:41:38,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:41:38,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:38,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:38,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141768298] [2025-02-06 04:41:38,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141768298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:38,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:38,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:38,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576374204] [2025-02-06 04:41:38,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:38,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:38,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:38,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:38,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:38,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:38,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 124 transitions, 1035 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:38,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:38,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:38,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:39,414 INFO L124 PetriNetUnfolderBase]: 2137/3834 cut-off events. [2025-02-06 04:41:39,414 INFO L125 PetriNetUnfolderBase]: For 22599/22645 co-relation queries the response was YES. [2025-02-06 04:41:39,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14419 conditions, 3834 events. 2137/3834 cut-off events. For 22599/22645 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 24558 event pairs, 663 based on Foata normal form. 11/3720 useless extension candidates. Maximal degree in co-relation 14377. Up to 2847 conditions per place. [2025-02-06 04:41:39,435 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 143 selfloop transitions, 36 changer transitions 3/189 dead transitions. [2025-02-06 04:41:39,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 189 transitions, 1804 flow [2025-02-06 04:41:39,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:41:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:41:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2025-02-06 04:41:39,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45867768595041325 [2025-02-06 04:41:39,440 INFO L175 Difference]: Start difference. First operand has 122 places, 124 transitions, 1035 flow. Second operand 11 states and 222 transitions. [2025-02-06 04:41:39,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 189 transitions, 1804 flow [2025-02-06 04:41:39,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 189 transitions, 1676 flow, removed 47 selfloop flow, removed 5 redundant places. [2025-02-06 04:41:39,469 INFO L231 Difference]: Finished difference. Result has 130 places, 133 transitions, 1121 flow [2025-02-06 04:41:39,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1121, PETRI_PLACES=130, PETRI_TRANSITIONS=133} [2025-02-06 04:41:39,471 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 87 predicate places. [2025-02-06 04:41:39,471 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 133 transitions, 1121 flow [2025-02-06 04:41:39,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:39,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:39,471 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] [2025-02-06 04:41:39,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:41:39,471 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:39,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:39,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1485347902, now seen corresponding path program 9 times [2025-02-06 04:41:39,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:39,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329066800] [2025-02-06 04:41:39,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:41:39,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:39,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:39,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:41:39,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:41:39,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:39,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:39,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329066800] [2025-02-06 04:41:39,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329066800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:39,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:39,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:39,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381231148] [2025-02-06 04:41:39,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:39,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:39,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:39,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:39,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:39,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:39,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 133 transitions, 1121 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:39,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:39,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:39,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:40,541 INFO L124 PetriNetUnfolderBase]: 2303/4119 cut-off events. [2025-02-06 04:41:40,542 INFO L125 PetriNetUnfolderBase]: For 29414/29496 co-relation queries the response was YES. [2025-02-06 04:41:40,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16217 conditions, 4119 events. 2303/4119 cut-off events. For 29414/29496 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 26788 event pairs, 722 based on Foata normal form. 9/3988 useless extension candidates. Maximal degree in co-relation 16171. Up to 3056 conditions per place. [2025-02-06 04:41:40,561 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 151 selfloop transitions, 37 changer transitions 3/198 dead transitions. [2025-02-06 04:41:40,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 198 transitions, 1941 flow [2025-02-06 04:41:40,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:41:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:41:40,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 225 transitions. [2025-02-06 04:41:40,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46487603305785125 [2025-02-06 04:41:40,566 INFO L175 Difference]: Start difference. First operand has 130 places, 133 transitions, 1121 flow. Second operand 11 states and 225 transitions. [2025-02-06 04:41:40,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 198 transitions, 1941 flow [2025-02-06 04:41:40,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 198 transitions, 1811 flow, removed 48 selfloop flow, removed 5 redundant places. [2025-02-06 04:41:40,597 INFO L231 Difference]: Finished difference. Result has 138 places, 140 transitions, 1223 flow [2025-02-06 04:41:40,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1223, PETRI_PLACES=138, PETRI_TRANSITIONS=140} [2025-02-06 04:41:40,597 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places. [2025-02-06 04:41:40,597 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 140 transitions, 1223 flow [2025-02-06 04:41:40,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:40,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:40,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:41:40,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 04:41:40,598 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:40,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:40,598 INFO L85 PathProgramCache]: Analyzing trace with hash 863810048, now seen corresponding path program 10 times [2025-02-06 04:41:40,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:40,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192475817] [2025-02-06 04:41:40,599 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:41:40,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:40,606 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:40,619 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:41:40,620 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:41:40,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:40,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:40,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192475817] [2025-02-06 04:41:40,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192475817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:40,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:40,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:40,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583431224] [2025-02-06 04:41:40,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:40,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:40,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:40,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:40,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:41,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 04:41:41,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 140 transitions, 1223 flow. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:41,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:41,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 04:41:41,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:41,563 INFO L124 PetriNetUnfolderBase]: 2562/4519 cut-off events. [2025-02-06 04:41:41,563 INFO L125 PetriNetUnfolderBase]: For 37265/37411 co-relation queries the response was YES. [2025-02-06 04:41:41,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18042 conditions, 4519 events. 2562/4519 cut-off events. For 37265/37411 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 29393 event pairs, 916 based on Foata normal form. 23/4394 useless extension candidates. Maximal degree in co-relation 17992. Up to 3537 conditions per place. [2025-02-06 04:41:41,587 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 147 selfloop transitions, 36 changer transitions 4/193 dead transitions. [2025-02-06 04:41:41,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 193 transitions, 1897 flow [2025-02-06 04:41:41,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:41:41,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:41:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2025-02-06 04:41:41,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4194214876033058 [2025-02-06 04:41:41,588 INFO L175 Difference]: Start difference. First operand has 138 places, 140 transitions, 1223 flow. Second operand 11 states and 203 transitions. [2025-02-06 04:41:41,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 193 transitions, 1897 flow [2025-02-06 04:41:41,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 193 transitions, 1755 flow, removed 52 selfloop flow, removed 6 redundant places. [2025-02-06 04:41:41,628 INFO L231 Difference]: Finished difference. Result has 145 places, 146 transitions, 1250 flow [2025-02-06 04:41:41,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1250, PETRI_PLACES=145, PETRI_TRANSITIONS=146} [2025-02-06 04:41:41,629 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places. [2025-02-06 04:41:41,629 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 146 transitions, 1250 flow [2025-02-06 04:41:41,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:41,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:41,629 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] [2025-02-06 04:41:41,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 04:41:41,629 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:41,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:41,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1366834388, now seen corresponding path program 11 times [2025-02-06 04:41:41,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:41,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734028655] [2025-02-06 04:41:41,630 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:41:41,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:41,635 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:41,643 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:41:41,644 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:41:41,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:42,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-02-06 04:41:42,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:42,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734028655] [2025-02-06 04:41:42,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734028655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:42,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:42,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:42,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470508209] [2025-02-06 04:41:42,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:42,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:42,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:42,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:42,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:42,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:42,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 146 transitions, 1250 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:42,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:42,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:42,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:42,779 INFO L124 PetriNetUnfolderBase]: 2515/4467 cut-off events. [2025-02-06 04:41:42,779 INFO L125 PetriNetUnfolderBase]: For 36214/36296 co-relation queries the response was YES. [2025-02-06 04:41:42,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18007 conditions, 4467 events. 2515/4467 cut-off events. For 36214/36296 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 29565 event pairs, 846 based on Foata normal form. 29/4362 useless extension candidates. Maximal degree in co-relation 17953. Up to 3319 conditions per place. [2025-02-06 04:41:42,805 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 156 selfloop transitions, 42 changer transitions 3/208 dead transitions. [2025-02-06 04:41:42,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 208 transitions, 2100 flow [2025-02-06 04:41:42,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:41:42,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:41:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 223 transitions. [2025-02-06 04:41:42,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4607438016528926 [2025-02-06 04:41:42,807 INFO L175 Difference]: Start difference. First operand has 145 places, 146 transitions, 1250 flow. Second operand 11 states and 223 transitions. [2025-02-06 04:41:42,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 208 transitions, 2100 flow [2025-02-06 04:41:42,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 208 transitions, 1990 flow, removed 35 selfloop flow, removed 6 redundant places. [2025-02-06 04:41:42,907 INFO L231 Difference]: Finished difference. Result has 152 places, 153 transitions, 1415 flow [2025-02-06 04:41:42,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1415, PETRI_PLACES=152, PETRI_TRANSITIONS=153} [2025-02-06 04:41:42,907 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places. [2025-02-06 04:41:42,907 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 153 transitions, 1415 flow [2025-02-06 04:41:42,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:42,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:42,907 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] [2025-02-06 04:41:42,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 04:41:42,908 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:42,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:42,908 INFO L85 PathProgramCache]: Analyzing trace with hash 267937724, now seen corresponding path program 12 times [2025-02-06 04:41:42,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:42,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563793445] [2025-02-06 04:41:42,908 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:41:42,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:42,917 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:42,926 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:41:42,927 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:41:42,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:43,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:43,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563793445] [2025-02-06 04:41:43,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563793445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:43,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:43,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:43,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778544644] [2025-02-06 04:41:43,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:43,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:43,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:43,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:43,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:43,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:43,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 153 transitions, 1415 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:43,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:43,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:43,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:43,896 INFO L124 PetriNetUnfolderBase]: 2515/4471 cut-off events. [2025-02-06 04:41:43,896 INFO L125 PetriNetUnfolderBase]: For 42505/42571 co-relation queries the response was YES. [2025-02-06 04:41:43,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18639 conditions, 4471 events. 2515/4471 cut-off events. For 42505/42571 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 29523 event pairs, 878 based on Foata normal form. 19/4350 useless extension candidates. Maximal degree in co-relation 18581. Up to 3477 conditions per place. [2025-02-06 04:41:43,924 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 161 selfloop transitions, 37 changer transitions 4/209 dead transitions. [2025-02-06 04:41:43,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 209 transitions, 2146 flow [2025-02-06 04:41:43,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:41:43,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:41:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 219 transitions. [2025-02-06 04:41:43,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4524793388429752 [2025-02-06 04:41:43,926 INFO L175 Difference]: Start difference. First operand has 152 places, 153 transitions, 1415 flow. Second operand 11 states and 219 transitions. [2025-02-06 04:41:43,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 209 transitions, 2146 flow [2025-02-06 04:41:43,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 209 transitions, 1978 flow, removed 64 selfloop flow, removed 6 redundant places. [2025-02-06 04:41:43,982 INFO L231 Difference]: Finished difference. Result has 158 places, 157 transitions, 1374 flow [2025-02-06 04:41:43,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1374, PETRI_PLACES=158, PETRI_TRANSITIONS=157} [2025-02-06 04:41:43,983 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places. [2025-02-06 04:41:43,983 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 157 transitions, 1374 flow [2025-02-06 04:41:43,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:43,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:43,983 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] [2025-02-06 04:41:43,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 04:41:43,983 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:43,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2120648868, now seen corresponding path program 13 times [2025-02-06 04:41:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:43,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009459457] [2025-02-06 04:41:43,984 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:41:43,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:43,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 04:41:44,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:41:44,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:41:44,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:44,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:44,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009459457] [2025-02-06 04:41:44,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009459457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:44,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:44,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:44,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298311237] [2025-02-06 04:41:44,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:44,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:44,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:44,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:44,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:44,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:44,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 157 transitions, 1374 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:44,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:44,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:44,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:44,937 INFO L124 PetriNetUnfolderBase]: 2551/4531 cut-off events. [2025-02-06 04:41:44,937 INFO L125 PetriNetUnfolderBase]: For 37866/37954 co-relation queries the response was YES. [2025-02-06 04:41:44,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18286 conditions, 4531 events. 2551/4531 cut-off events. For 37866/37954 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 30121 event pairs, 944 based on Foata normal form. 35/4422 useless extension candidates. Maximal degree in co-relation 18225. Up to 3608 conditions per place. [2025-02-06 04:41:44,962 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 159 selfloop transitions, 37 changer transitions 3/206 dead transitions. [2025-02-06 04:41:44,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 206 transitions, 2038 flow [2025-02-06 04:41:44,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:41:44,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:41:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2025-02-06 04:41:44,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4380165289256198 [2025-02-06 04:41:44,963 INFO L175 Difference]: Start difference. First operand has 158 places, 157 transitions, 1374 flow. Second operand 11 states and 212 transitions. [2025-02-06 04:41:44,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 206 transitions, 2038 flow [2025-02-06 04:41:45,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 206 transitions, 1932 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-02-06 04:41:45,011 INFO L231 Difference]: Finished difference. Result has 162 places, 160 transitions, 1392 flow [2025-02-06 04:41:45,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1392, PETRI_PLACES=162, PETRI_TRANSITIONS=160} [2025-02-06 04:41:45,012 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places. [2025-02-06 04:41:45,012 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 160 transitions, 1392 flow [2025-02-06 04:41:45,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:45,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:45,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:41:45,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 04:41:45,012 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:45,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:45,013 INFO L85 PathProgramCache]: Analyzing trace with hash 974902228, now seen corresponding path program 14 times [2025-02-06 04:41:45,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:45,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46731824] [2025-02-06 04:41:45,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:41:45,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:45,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:45,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:41:45,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:41:45,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:45,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:45,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46731824] [2025-02-06 04:41:45,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46731824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:45,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:45,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:45,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243184802] [2025-02-06 04:41:45,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:45,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:45,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:45,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:45,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:45,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:45,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 160 transitions, 1392 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:45,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:45,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:45,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:45,898 INFO L124 PetriNetUnfolderBase]: 2551/4553 cut-off events. [2025-02-06 04:41:45,898 INFO L125 PetriNetUnfolderBase]: For 37783/37871 co-relation queries the response was YES. [2025-02-06 04:41:45,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18233 conditions, 4553 events. 2551/4553 cut-off events. For 37783/37871 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 30600 event pairs, 860 based on Foata normal form. 35/4444 useless extension candidates. Maximal degree in co-relation 18170. Up to 3542 conditions per place. [2025-02-06 04:41:45,921 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 162 selfloop transitions, 41 changer transitions 4/214 dead transitions. [2025-02-06 04:41:45,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 214 transitions, 2099 flow [2025-02-06 04:41:45,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:41:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:41:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 218 transitions. [2025-02-06 04:41:45,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45041322314049587 [2025-02-06 04:41:45,923 INFO L175 Difference]: Start difference. First operand has 162 places, 160 transitions, 1392 flow. Second operand 11 states and 218 transitions. [2025-02-06 04:41:45,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 214 transitions, 2099 flow [2025-02-06 04:41:45,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 214 transitions, 1995 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-02-06 04:41:45,986 INFO L231 Difference]: Finished difference. Result has 166 places, 164 transitions, 1436 flow [2025-02-06 04:41:45,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1436, PETRI_PLACES=166, PETRI_TRANSITIONS=164} [2025-02-06 04:41:45,986 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 123 predicate places. [2025-02-06 04:41:45,987 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 164 transitions, 1436 flow [2025-02-06 04:41:45,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:45,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:45,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:41:45,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 04:41:45,987 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:45,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:45,988 INFO L85 PathProgramCache]: Analyzing trace with hash -209219164, now seen corresponding path program 15 times [2025-02-06 04:41:45,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:45,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769224210] [2025-02-06 04:41:45,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:41:45,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:45,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:46,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:41:46,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:41:46,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:46,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:46,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769224210] [2025-02-06 04:41:46,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769224210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:46,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:46,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:46,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834694722] [2025-02-06 04:41:46,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:46,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:46,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:46,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:46,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:46,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:46,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 164 transitions, 1436 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:46,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:46,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:46,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:46,898 INFO L124 PetriNetUnfolderBase]: 2551/4542 cut-off events. [2025-02-06 04:41:46,898 INFO L125 PetriNetUnfolderBase]: For 38468/38556 co-relation queries the response was YES. [2025-02-06 04:41:46,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18324 conditions, 4542 events. 2551/4542 cut-off events. For 38468/38556 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 30235 event pairs, 951 based on Foata normal form. 27/4425 useless extension candidates. Maximal degree in co-relation 18259. Up to 3620 conditions per place. [2025-02-06 04:41:46,923 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 165 selfloop transitions, 35 changer transitions 3/210 dead transitions. [2025-02-06 04:41:46,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 210 transitions, 2080 flow [2025-02-06 04:41:46,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:41:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:41:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2025-02-06 04:41:46,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-02-06 04:41:46,924 INFO L175 Difference]: Start difference. First operand has 166 places, 164 transitions, 1436 flow. Second operand 11 states and 209 transitions. [2025-02-06 04:41:46,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 210 transitions, 2080 flow [2025-02-06 04:41:46,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 210 transitions, 1954 flow, removed 24 selfloop flow, removed 8 redundant places. [2025-02-06 04:41:46,974 INFO L231 Difference]: Finished difference. Result has 170 places, 166 transitions, 1404 flow [2025-02-06 04:41:46,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1404, PETRI_PLACES=170, PETRI_TRANSITIONS=166} [2025-02-06 04:41:46,975 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 127 predicate places. [2025-02-06 04:41:46,975 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 1404 flow [2025-02-06 04:41:46,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:46,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:46,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:41:46,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 04:41:46,975 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:46,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:46,976 INFO L85 PathProgramCache]: Analyzing trace with hash 997434142, now seen corresponding path program 16 times [2025-02-06 04:41:46,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:46,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108887972] [2025-02-06 04:41:46,976 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:41:46,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:46,983 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:46,992 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:41:46,992 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:41:46,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:47,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:47,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108887972] [2025-02-06 04:41:47,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108887972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:47,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:47,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642127521] [2025-02-06 04:41:47,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:47,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:47,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:47,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:47,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:47,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 04:41:47,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 1404 flow. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:47,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:47,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 04:41:47,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:48,042 INFO L124 PetriNetUnfolderBase]: 2990/5299 cut-off events. [2025-02-06 04:41:48,042 INFO L125 PetriNetUnfolderBase]: For 51320/51392 co-relation queries the response was YES. [2025-02-06 04:41:48,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21874 conditions, 5299 events. 2990/5299 cut-off events. For 51320/51392 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 36498 event pairs, 1028 based on Foata normal form. 15/5148 useless extension candidates. Maximal degree in co-relation 21807. Up to 3897 conditions per place. [2025-02-06 04:41:48,073 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 194 selfloop transitions, 44 changer transitions 3/247 dead transitions. [2025-02-06 04:41:48,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 247 transitions, 2515 flow [2025-02-06 04:41:48,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:41:48,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:41:48,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 237 transitions. [2025-02-06 04:41:48,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44886363636363635 [2025-02-06 04:41:48,074 INFO L175 Difference]: Start difference. First operand has 170 places, 166 transitions, 1404 flow. Second operand 12 states and 237 transitions. [2025-02-06 04:41:48,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 247 transitions, 2515 flow [2025-02-06 04:41:48,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 247 transitions, 2447 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-02-06 04:41:48,146 INFO L231 Difference]: Finished difference. Result has 177 places, 178 transitions, 1677 flow [2025-02-06 04:41:48,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1677, PETRI_PLACES=177, PETRI_TRANSITIONS=178} [2025-02-06 04:41:48,146 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places. [2025-02-06 04:41:48,147 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 178 transitions, 1677 flow [2025-02-06 04:41:48,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:48,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:48,147 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] [2025-02-06 04:41:48,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 04:41:48,147 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:48,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:48,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1452245744, now seen corresponding path program 17 times [2025-02-06 04:41:48,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:48,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425737419] [2025-02-06 04:41:48,148 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:41:48,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:48,154 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:48,161 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:41:48,161 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:41:48,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:48,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:48,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425737419] [2025-02-06 04:41:48,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425737419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:48,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:48,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:48,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336007907] [2025-02-06 04:41:48,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:48,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:48,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:48,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:48,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:48,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:48,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 178 transitions, 1677 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:48,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:48,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:48,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:49,248 INFO L124 PetriNetUnfolderBase]: 2991/5365 cut-off events. [2025-02-06 04:41:49,248 INFO L125 PetriNetUnfolderBase]: For 66247/66399 co-relation queries the response was YES. [2025-02-06 04:41:49,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23779 conditions, 5365 events. 2991/5365 cut-off events. For 66247/66399 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 37628 event pairs, 978 based on Foata normal form. 43/5250 useless extension candidates. Maximal degree in co-relation 23708. Up to 3842 conditions per place. [2025-02-06 04:41:49,288 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 190 selfloop transitions, 54 changer transitions 3/254 dead transitions. [2025-02-06 04:41:49,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 254 transitions, 2858 flow [2025-02-06 04:41:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:41:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:41:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 246 transitions. [2025-02-06 04:41:49,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2025-02-06 04:41:49,289 INFO L175 Difference]: Start difference. First operand has 177 places, 178 transitions, 1677 flow. Second operand 12 states and 246 transitions. [2025-02-06 04:41:49,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 254 transitions, 2858 flow [2025-02-06 04:41:49,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 254 transitions, 2630 flow, removed 97 selfloop flow, removed 5 redundant places. [2025-02-06 04:41:49,365 INFO L231 Difference]: Finished difference. Result has 187 places, 189 transitions, 1860 flow [2025-02-06 04:41:49,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1860, PETRI_PLACES=187, PETRI_TRANSITIONS=189} [2025-02-06 04:41:49,365 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 144 predicate places. [2025-02-06 04:41:49,365 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 189 transitions, 1860 flow [2025-02-06 04:41:49,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:49,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:49,366 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] [2025-02-06 04:41:49,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 04:41:49,366 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:49,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:49,366 INFO L85 PathProgramCache]: Analyzing trace with hash 522024634, now seen corresponding path program 18 times [2025-02-06 04:41:49,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:49,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562607586] [2025-02-06 04:41:49,366 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:41:49,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:49,374 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:49,381 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:41:49,381 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:41:49,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:49,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:49,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562607586] [2025-02-06 04:41:49,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562607586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:49,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:49,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:49,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261559368] [2025-02-06 04:41:49,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:49,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:49,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:49,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:49,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:49,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:49,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 189 transitions, 1860 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:49,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:49,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:49,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:50,433 INFO L124 PetriNetUnfolderBase]: 3087/5531 cut-off events. [2025-02-06 04:41:50,434 INFO L125 PetriNetUnfolderBase]: For 79078/79200 co-relation queries the response was YES. [2025-02-06 04:41:50,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25289 conditions, 5531 events. 3087/5531 cut-off events. For 79078/79200 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 39111 event pairs, 1076 based on Foata normal form. 19/5391 useless extension candidates. Maximal degree in co-relation 25213. Up to 4114 conditions per place. [2025-02-06 04:41:50,473 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 199 selfloop transitions, 49 changer transitions 3/258 dead transitions. [2025-02-06 04:41:50,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 258 transitions, 2928 flow [2025-02-06 04:41:50,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:41:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:41:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 243 transitions. [2025-02-06 04:41:50,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4602272727272727 [2025-02-06 04:41:50,475 INFO L175 Difference]: Start difference. First operand has 187 places, 189 transitions, 1860 flow. Second operand 12 states and 243 transitions. [2025-02-06 04:41:50,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 258 transitions, 2928 flow [2025-02-06 04:41:50,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 258 transitions, 2713 flow, removed 83 selfloop flow, removed 7 redundant places. [2025-02-06 04:41:50,594 INFO L231 Difference]: Finished difference. Result has 194 places, 195 transitions, 1913 flow [2025-02-06 04:41:50,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1913, PETRI_PLACES=194, PETRI_TRANSITIONS=195} [2025-02-06 04:41:50,595 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places. [2025-02-06 04:41:50,595 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 195 transitions, 1913 flow [2025-02-06 04:41:50,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:50,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:50,595 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] [2025-02-06 04:41:50,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 04:41:50,595 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:50,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:50,596 INFO L85 PathProgramCache]: Analyzing trace with hash 701106242, now seen corresponding path program 19 times [2025-02-06 04:41:50,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:50,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134674163] [2025-02-06 04:41:50,596 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:41:50,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:50,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 04:41:50,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:41:50,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:41:50,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:50,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:50,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134674163] [2025-02-06 04:41:50,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134674163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:50,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:50,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:50,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274352959] [2025-02-06 04:41:50,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:50,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:50,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:50,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:50,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:50,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:50,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 195 transitions, 1913 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:50,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:50,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:50,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:51,585 INFO L124 PetriNetUnfolderBase]: 3087/5549 cut-off events. [2025-02-06 04:41:51,585 INFO L125 PetriNetUnfolderBase]: For 77737/77825 co-relation queries the response was YES. [2025-02-06 04:41:51,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25113 conditions, 5549 events. 3087/5549 cut-off events. For 77737/77825 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 39405 event pairs, 1096 based on Foata normal form. 35/5423 useless extension candidates. Maximal degree in co-relation 25034. Up to 4191 conditions per place. [2025-02-06 04:41:51,621 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 196 selfloop transitions, 51 changer transitions 4/258 dead transitions. [2025-02-06 04:41:51,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 258 transitions, 2855 flow [2025-02-06 04:41:51,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:41:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:41:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 240 transitions. [2025-02-06 04:41:51,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-02-06 04:41:51,623 INFO L175 Difference]: Start difference. First operand has 194 places, 195 transitions, 1913 flow. Second operand 12 states and 240 transitions. [2025-02-06 04:41:51,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 258 transitions, 2855 flow [2025-02-06 04:41:51,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 258 transitions, 2698 flow, removed 53 selfloop flow, removed 8 redundant places. [2025-02-06 04:41:51,743 INFO L231 Difference]: Finished difference. Result has 199 places, 199 transitions, 1936 flow [2025-02-06 04:41:51,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1756, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1936, PETRI_PLACES=199, PETRI_TRANSITIONS=199} [2025-02-06 04:41:51,743 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 156 predicate places. [2025-02-06 04:41:51,743 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 199 transitions, 1936 flow [2025-02-06 04:41:51,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:51,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:51,744 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] [2025-02-06 04:41:51,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 04:41:51,744 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:51,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:51,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1095678498, now seen corresponding path program 20 times [2025-02-06 04:41:51,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:51,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149258761] [2025-02-06 04:41:51,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:41:51,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:51,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:51,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:41:51,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:41:51,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:52,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:52,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149258761] [2025-02-06 04:41:52,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149258761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:52,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:52,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:52,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944904681] [2025-02-06 04:41:52,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:52,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:52,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:52,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:52,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:52,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:52,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 199 transitions, 1936 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:52,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:52,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:52,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:52,966 INFO L124 PetriNetUnfolderBase]: 3293/5883 cut-off events. [2025-02-06 04:41:52,966 INFO L125 PetriNetUnfolderBase]: For 92445/92712 co-relation queries the response was YES. [2025-02-06 04:41:52,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27738 conditions, 5883 events. 3293/5883 cut-off events. For 92445/92712 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 42278 event pairs, 1321 based on Foata normal form. 41/5740 useless extension candidates. Maximal degree in co-relation 27657. Up to 4637 conditions per place. [2025-02-06 04:41:53,008 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 220 selfloop transitions, 37 changer transitions 3/267 dead transitions. [2025-02-06 04:41:53,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 267 transitions, 3165 flow [2025-02-06 04:41:53,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:41:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:41:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 228 transitions. [2025-02-06 04:41:53,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47107438016528924 [2025-02-06 04:41:53,009 INFO L175 Difference]: Start difference. First operand has 199 places, 199 transitions, 1936 flow. Second operand 11 states and 228 transitions. [2025-02-06 04:41:53,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 267 transitions, 3165 flow [2025-02-06 04:41:53,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 267 transitions, 3007 flow, removed 29 selfloop flow, removed 9 redundant places. [2025-02-06 04:41:53,123 INFO L231 Difference]: Finished difference. Result has 204 places, 209 transitions, 2143 flow [2025-02-06 04:41:53,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1788, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2143, PETRI_PLACES=204, PETRI_TRANSITIONS=209} [2025-02-06 04:41:53,123 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 161 predicate places. [2025-02-06 04:41:53,123 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 209 transitions, 2143 flow [2025-02-06 04:41:53,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:53,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:53,124 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] [2025-02-06 04:41:53,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 04:41:53,124 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:41:53,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:53,125 INFO L85 PathProgramCache]: Analyzing trace with hash 356783830, now seen corresponding path program 21 times [2025-02-06 04:41:53,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:53,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260236006] [2025-02-06 04:41:53,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:41:53,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:53,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:53,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:41:53,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:41:53,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:53,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:53,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:53,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260236006] [2025-02-06 04:41:53,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260236006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:53,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:53,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:53,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019806766] [2025-02-06 04:41:53,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:53,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:53,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:53,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:53,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:53,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:53,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 209 transitions, 2143 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:53,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:53,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:53,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:54,157 INFO L124 PetriNetUnfolderBase]: 3354/6005 cut-off events. [2025-02-06 04:41:54,158 INFO L125 PetriNetUnfolderBase]: For 109425/109820 co-relation queries the response was YES. [2025-02-06 04:41:54,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28643 conditions, 6005 events. 3354/6005 cut-off events. For 109425/109820 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 43197 event pairs, 1407 based on Foata normal form. 55/5870 useless extension candidates. Maximal degree in co-relation 28558. Up to 4876 conditions per place. [2025-02-06 04:41:54,200 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 214 selfloop transitions, 36 changer transitions 4/261 dead transitions. [2025-02-06 04:41:54,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 261 transitions, 3089 flow [2025-02-06 04:41:54,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:41:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:41:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2025-02-06 04:41:54,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44421487603305787 [2025-02-06 04:41:54,202 INFO L175 Difference]: Start difference. First operand has 204 places, 209 transitions, 2143 flow. Second operand 11 states and 215 transitions. [2025-02-06 04:41:54,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 261 transitions, 3089 flow [2025-02-06 04:41:54,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 261 transitions, 2849 flow, removed 103 selfloop flow, removed 5 redundant places. [2025-02-06 04:41:54,319 INFO L231 Difference]: Finished difference. Result has 212 places, 215 transitions, 2128 flow [2025-02-06 04:41:54,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2128, PETRI_PLACES=212, PETRI_TRANSITIONS=215} [2025-02-06 04:41:54,320 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 169 predicate places. [2025-02-06 04:41:54,320 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 215 transitions, 2128 flow [2025-02-06 04:41:54,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:54,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:54,320 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:41:54,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 04:41:54,321 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-02-06 04:41:54,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:54,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2100262588, now seen corresponding path program 22 times [2025-02-06 04:41:54,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:54,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089811094] [2025-02-06 04:41:54,321 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:41:54,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:54,326 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:54,334 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:41:54,334 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:41:54,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:54,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:54,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089811094] [2025-02-06 04:41:54,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089811094] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:54,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:54,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:54,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145468810] [2025-02-06 04:41:54,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:54,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:54,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:54,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:54,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:54,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 04:41:54,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 215 transitions, 2128 flow. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:54,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:54,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 04:41:54,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:55,589 INFO L124 PetriNetUnfolderBase]: 3709/6579 cut-off events. [2025-02-06 04:41:55,590 INFO L125 PetriNetUnfolderBase]: For 99959/100178 co-relation queries the response was YES. [2025-02-06 04:41:55,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30468 conditions, 6579 events. 3709/6579 cut-off events. For 99959/100178 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 47653 event pairs, 1512 based on Foata normal form. 61/6434 useless extension candidates. Maximal degree in co-relation 30379. Up to 5145 conditions per place. [2025-02-06 04:41:55,637 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 234 selfloop transitions, 44 changer transitions 3/287 dead transitions. [2025-02-06 04:41:55,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 287 transitions, 3382 flow [2025-02-06 04:41:55,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:41:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:41:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 226 transitions. [2025-02-06 04:41:55,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4669421487603306 [2025-02-06 04:41:55,638 INFO L175 Difference]: Start difference. First operand has 212 places, 215 transitions, 2128 flow. Second operand 11 states and 226 transitions. [2025-02-06 04:41:55,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 287 transitions, 3382 flow [2025-02-06 04:41:55,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 287 transitions, 3238 flow, removed 52 selfloop flow, removed 6 redundant places. [2025-02-06 04:41:55,794 INFO L231 Difference]: Finished difference. Result has 220 places, 224 transitions, 2376 flow [2025-02-06 04:41:55,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1984, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2376, PETRI_PLACES=220, PETRI_TRANSITIONS=224} [2025-02-06 04:41:55,795 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 177 predicate places. [2025-02-06 04:41:55,795 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 224 transitions, 2376 flow [2025-02-06 04:41:55,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:55,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:55,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, 1, 1] [2025-02-06 04:41:55,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 04:41:55,796 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-02-06 04:41:55,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash -19306930, now seen corresponding path program 23 times [2025-02-06 04:41:55,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:55,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383419785] [2025-02-06 04:41:55,796 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:41:55,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:55,801 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:55,807 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:41:55,807 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:41:55,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:56,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:56,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383419785] [2025-02-06 04:41:56,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383419785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:56,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:56,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:56,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358474025] [2025-02-06 04:41:56,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:56,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:56,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:56,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:56,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:56,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:56,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 224 transitions, 2376 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:56,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:56,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:56,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:56,989 INFO L124 PetriNetUnfolderBase]: 3624/6501 cut-off events. [2025-02-06 04:41:56,989 INFO L125 PetriNetUnfolderBase]: For 118672/118899 co-relation queries the response was YES. [2025-02-06 04:41:57,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31406 conditions, 6501 events. 3624/6501 cut-off events. For 118672/118899 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 47817 event pairs, 1521 based on Foata normal form. 51/6340 useless extension candidates. Maximal degree in co-relation 31312. Up to 5241 conditions per place. [2025-02-06 04:41:57,039 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 243 selfloop transitions, 35 changer transitions 3/288 dead transitions. [2025-02-06 04:41:57,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 288 transitions, 3650 flow [2025-02-06 04:41:57,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:41:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:41:57,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 225 transitions. [2025-02-06 04:41:57,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46487603305785125 [2025-02-06 04:41:57,040 INFO L175 Difference]: Start difference. First operand has 220 places, 224 transitions, 2376 flow. Second operand 11 states and 225 transitions. [2025-02-06 04:41:57,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 288 transitions, 3650 flow [2025-02-06 04:41:57,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 288 transitions, 3416 flow, removed 98 selfloop flow, removed 5 redundant places. [2025-02-06 04:41:57,251 INFO L231 Difference]: Finished difference. Result has 229 places, 231 transitions, 2474 flow [2025-02-06 04:41:57,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2148, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2474, PETRI_PLACES=229, PETRI_TRANSITIONS=231} [2025-02-06 04:41:57,252 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 186 predicate places. [2025-02-06 04:41:57,252 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 231 transitions, 2474 flow [2025-02-06 04:41:57,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:57,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:57,252 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] [2025-02-06 04:41:57,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 04:41:57,253 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-02-06 04:41:57,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:57,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1218258624, now seen corresponding path program 24 times [2025-02-06 04:41:57,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:57,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664629576] [2025-02-06 04:41:57,253 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:41:57,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:57,258 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:41:57,263 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:41:57,263 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:41:57,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:57,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:57,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664629576] [2025-02-06 04:41:57,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664629576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:57,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:57,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:57,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896246007] [2025-02-06 04:41:57,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:57,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:57,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:57,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:57,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:57,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:57,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 231 transitions, 2474 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:57,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:57,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:57,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:58,539 INFO L124 PetriNetUnfolderBase]: 3729/6708 cut-off events. [2025-02-06 04:41:58,540 INFO L125 PetriNetUnfolderBase]: For 135467/135702 co-relation queries the response was YES. [2025-02-06 04:41:58,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32503 conditions, 6708 events. 3729/6708 cut-off events. For 135467/135702 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 50138 event pairs, 1582 based on Foata normal form. 53/6541 useless extension candidates. Maximal degree in co-relation 32404. Up to 5419 conditions per place. [2025-02-06 04:41:58,594 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 249 selfloop transitions, 35 changer transitions 3/294 dead transitions. [2025-02-06 04:41:58,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 294 transitions, 3690 flow [2025-02-06 04:41:58,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:41:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:41:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 225 transitions. [2025-02-06 04:41:58,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46487603305785125 [2025-02-06 04:41:58,598 INFO L175 Difference]: Start difference. First operand has 229 places, 231 transitions, 2474 flow. Second operand 11 states and 225 transitions. [2025-02-06 04:41:58,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 294 transitions, 3690 flow [2025-02-06 04:41:58,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 294 transitions, 3468 flow, removed 94 selfloop flow, removed 5 redundant places. [2025-02-06 04:41:58,811 INFO L231 Difference]: Finished difference. Result has 237 places, 237 transitions, 2511 flow [2025-02-06 04:41:58,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2252, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2511, PETRI_PLACES=237, PETRI_TRANSITIONS=237} [2025-02-06 04:41:58,814 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 194 predicate places. [2025-02-06 04:41:58,814 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 237 transitions, 2511 flow [2025-02-06 04:41:58,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:58,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:58,815 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] [2025-02-06 04:41:58,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 04:41:58,818 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-02-06 04:41:58,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:58,819 INFO L85 PathProgramCache]: Analyzing trace with hash -172188206, now seen corresponding path program 25 times [2025-02-06 04:41:58,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:58,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607558138] [2025-02-06 04:41:58,819 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:41:58,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:58,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 04:41:58,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:41:58,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:41:58,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:59,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:59,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607558138] [2025-02-06 04:41:59,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607558138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:59,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:59,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:41:59,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239973168] [2025-02-06 04:41:59,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:59,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:41:59,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:59,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:41:59,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:41:59,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:41:59,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 237 transitions, 2511 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:59,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:59,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:41:59,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:59,983 INFO L124 PetriNetUnfolderBase]: 3729/6711 cut-off events. [2025-02-06 04:41:59,984 INFO L125 PetriNetUnfolderBase]: For 133997/134227 co-relation queries the response was YES. [2025-02-06 04:42:00,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32214 conditions, 6711 events. 3729/6711 cut-off events. For 133997/134227 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 49954 event pairs, 1626 based on Foata normal form. 59/6547 useless extension candidates. Maximal degree in co-relation 32111. Up to 5496 conditions per place. [2025-02-06 04:42:00,043 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 245 selfloop transitions, 34 changer transitions 3/289 dead transitions. [2025-02-06 04:42:00,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 289 transitions, 3534 flow [2025-02-06 04:42:00,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 216 transitions. [2025-02-06 04:42:00,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4462809917355372 [2025-02-06 04:42:00,044 INFO L175 Difference]: Start difference. First operand has 237 places, 237 transitions, 2511 flow. Second operand 11 states and 216 transitions. [2025-02-06 04:42:00,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 289 transitions, 3534 flow [2025-02-06 04:42:00,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 289 transitions, 3349 flow, removed 74 selfloop flow, removed 6 redundant places. [2025-02-06 04:42:00,263 INFO L231 Difference]: Finished difference. Result has 243 places, 240 transitions, 2459 flow [2025-02-06 04:42:00,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2326, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2459, PETRI_PLACES=243, PETRI_TRANSITIONS=240} [2025-02-06 04:42:00,264 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 200 predicate places. [2025-02-06 04:42:00,264 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 240 transitions, 2459 flow [2025-02-06 04:42:00,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:00,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:00,264 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] [2025-02-06 04:42:00,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 04:42:00,264 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-02-06 04:42:00,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:00,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1592759686, now seen corresponding path program 26 times [2025-02-06 04:42:00,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:00,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464325012] [2025-02-06 04:42:00,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:42:00,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:00,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:42:00,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:42:00,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:42:00,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:42:00,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:00,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464325012] [2025-02-06 04:42:00,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464325012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:00,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:00,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:42:00,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375547348] [2025-02-06 04:42:00,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:00,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:42:00,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:00,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:42:00,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:42:00,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:42:00,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 240 transitions, 2459 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:00,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:00,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:42:00,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:01,689 INFO L124 PetriNetUnfolderBase]: 3825/6903 cut-off events. [2025-02-06 04:42:01,689 INFO L125 PetriNetUnfolderBase]: For 139908/140121 co-relation queries the response was YES. [2025-02-06 04:42:01,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33313 conditions, 6903 events. 3825/6903 cut-off events. For 139908/140121 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 51951 event pairs, 1656 based on Foata normal form. 48/6726 useless extension candidates. Maximal degree in co-relation 33207. Up to 5579 conditions per place. [2025-02-06 04:42:01,746 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 256 selfloop transitions, 36 changer transitions 3/302 dead transitions. [2025-02-06 04:42:01,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 302 transitions, 3714 flow [2025-02-06 04:42:01,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 225 transitions. [2025-02-06 04:42:01,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46487603305785125 [2025-02-06 04:42:01,747 INFO L175 Difference]: Start difference. First operand has 243 places, 240 transitions, 2459 flow. Second operand 11 states and 225 transitions. [2025-02-06 04:42:01,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 302 transitions, 3714 flow [2025-02-06 04:42:01,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 302 transitions, 3586 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-02-06 04:42:01,994 INFO L231 Difference]: Finished difference. Result has 248 places, 246 transitions, 2606 flow [2025-02-06 04:42:01,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2331, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2606, PETRI_PLACES=248, PETRI_TRANSITIONS=246} [2025-02-06 04:42:01,995 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 205 predicate places. [2025-02-06 04:42:01,995 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 246 transitions, 2606 flow [2025-02-06 04:42:01,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:01,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:01,995 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] [2025-02-06 04:42:01,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 04:42:01,995 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-02-06 04:42:01,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:01,996 INFO L85 PathProgramCache]: Analyzing trace with hash -720598188, now seen corresponding path program 27 times [2025-02-06 04:42:01,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:01,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519738608] [2025-02-06 04:42:01,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:42:01,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:02,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:42:02,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:42:02,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:42:02,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:42:02,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:02,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519738608] [2025-02-06 04:42:02,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519738608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:02,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:02,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:42:02,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071001807] [2025-02-06 04:42:02,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:02,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:42:02,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:02,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:42:02,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:42:02,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:42:02,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 246 transitions, 2606 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:02,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:02,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:42:02,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:03,136 INFO L124 PetriNetUnfolderBase]: 3825/6899 cut-off events. [2025-02-06 04:42:03,136 INFO L125 PetriNetUnfolderBase]: For 149500/149713 co-relation queries the response was YES. [2025-02-06 04:42:03,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33691 conditions, 6899 events. 3825/6899 cut-off events. For 149500/149713 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 52109 event pairs, 1659 based on Foata normal form. 54/6721 useless extension candidates. Maximal degree in co-relation 33582. Up to 5617 conditions per place. [2025-02-06 04:42:03,184 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 254 selfloop transitions, 37 changer transitions 4/302 dead transitions. [2025-02-06 04:42:03,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 302 transitions, 3685 flow [2025-02-06 04:42:03,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2025-02-06 04:42:03,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45867768595041325 [2025-02-06 04:42:03,185 INFO L175 Difference]: Start difference. First operand has 248 places, 246 transitions, 2606 flow. Second operand 11 states and 222 transitions. [2025-02-06 04:42:03,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 302 transitions, 3685 flow [2025-02-06 04:42:03,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 302 transitions, 3485 flow, removed 81 selfloop flow, removed 6 redundant places. [2025-02-06 04:42:03,374 INFO L231 Difference]: Finished difference. Result has 254 places, 250 transitions, 2555 flow [2025-02-06 04:42:03,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2406, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2555, PETRI_PLACES=254, PETRI_TRANSITIONS=250} [2025-02-06 04:42:03,374 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 211 predicate places. [2025-02-06 04:42:03,374 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 250 transitions, 2555 flow [2025-02-06 04:42:03,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:03,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:03,374 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] [2025-02-06 04:42:03,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 04:42:03,374 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-02-06 04:42:03,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:03,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2136925580, now seen corresponding path program 28 times [2025-02-06 04:42:03,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:03,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146972653] [2025-02-06 04:42:03,375 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:42:03,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:03,379 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:42:03,385 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:42:03,385 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:42:03,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:42:03,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:03,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146972653] [2025-02-06 04:42:03,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146972653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:03,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:03,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:42:03,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15700955] [2025-02-06 04:42:03,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:03,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:42:03,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:03,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:42:03,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:42:03,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 04:42:03,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 250 transitions, 2555 flow. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:03,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:03,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 04:42:03,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:04,860 INFO L124 PetriNetUnfolderBase]: 4080/7322 cut-off events. [2025-02-06 04:42:04,860 INFO L125 PetriNetUnfolderBase]: For 149563/149800 co-relation queries the response was YES. [2025-02-06 04:42:04,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35000 conditions, 7322 events. 4080/7322 cut-off events. For 149563/149800 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 55192 event pairs, 1783 based on Foata normal form. 70/7146 useless extension candidates. Maximal degree in co-relation 34888. Up to 5852 conditions per place. [2025-02-06 04:42:04,918 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 262 selfloop transitions, 41 changer transitions 3/312 dead transitions. [2025-02-06 04:42:04,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 312 transitions, 3700 flow [2025-02-06 04:42:04,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2025-02-06 04:42:04,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-02-06 04:42:04,920 INFO L175 Difference]: Start difference. First operand has 254 places, 250 transitions, 2555 flow. Second operand 11 states and 220 transitions. [2025-02-06 04:42:04,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 312 transitions, 3700 flow [2025-02-06 04:42:05,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 312 transitions, 3566 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-02-06 04:42:05,176 INFO L231 Difference]: Finished difference. Result has 259 places, 255 transitions, 2630 flow [2025-02-06 04:42:05,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2421, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2630, PETRI_PLACES=259, PETRI_TRANSITIONS=255} [2025-02-06 04:42:05,177 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 216 predicate places. [2025-02-06 04:42:05,177 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 255 transitions, 2630 flow [2025-02-06 04:42:05,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:05,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:05,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:05,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 04:42:05,178 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-02-06 04:42:05,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:05,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1802772548, now seen corresponding path program 29 times [2025-02-06 04:42:05,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:05,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838119031] [2025-02-06 04:42:05,178 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:42:05,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:05,183 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:42:05,188 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:42:05,189 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:42:05,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:42:05,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:05,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838119031] [2025-02-06 04:42:05,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838119031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:05,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:05,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:42:05,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542453960] [2025-02-06 04:42:05,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:05,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:42:05,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:05,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:42:05,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:42:05,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:42:05,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 255 transitions, 2630 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:05,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:05,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:42:05,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:06,457 INFO L124 PetriNetUnfolderBase]: 3882/7030 cut-off events. [2025-02-06 04:42:06,458 INFO L125 PetriNetUnfolderBase]: For 141893/142130 co-relation queries the response was YES. [2025-02-06 04:42:06,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33567 conditions, 7030 events. 3882/7030 cut-off events. For 141893/142130 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 53465 event pairs, 1687 based on Foata normal form. 70/6870 useless extension candidates. Maximal degree in co-relation 33452. Up to 5716 conditions per place. [2025-02-06 04:42:06,508 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 257 selfloop transitions, 41 changer transitions 4/309 dead transitions. [2025-02-06 04:42:06,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 309 transitions, 3669 flow [2025-02-06 04:42:06,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:06,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:06,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 221 transitions. [2025-02-06 04:42:06,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45661157024793386 [2025-02-06 04:42:06,509 INFO L175 Difference]: Start difference. First operand has 259 places, 255 transitions, 2630 flow. Second operand 11 states and 221 transitions. [2025-02-06 04:42:06,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 309 transitions, 3669 flow [2025-02-06 04:42:06,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 309 transitions, 3544 flow, removed 27 selfloop flow, removed 7 redundant places. [2025-02-06 04:42:06,721 INFO L231 Difference]: Finished difference. Result has 264 places, 259 transitions, 2675 flow [2025-02-06 04:42:06,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2505, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2675, PETRI_PLACES=264, PETRI_TRANSITIONS=259} [2025-02-06 04:42:06,722 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 221 predicate places. [2025-02-06 04:42:06,722 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 259 transitions, 2675 flow [2025-02-06 04:42:06,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:06,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:06,722 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] [2025-02-06 04:42:06,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 04:42:06,723 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-02-06 04:42:06,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:06,723 INFO L85 PathProgramCache]: Analyzing trace with hash -113190392, now seen corresponding path program 30 times [2025-02-06 04:42:06,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:06,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782306483] [2025-02-06 04:42:06,723 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:42:06,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:06,727 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:42:06,732 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:42:06,732 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:42:06,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:06,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:42:06,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:06,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782306483] [2025-02-06 04:42:06,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782306483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:06,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:06,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:42:06,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172340012] [2025-02-06 04:42:06,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:06,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:42:06,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:06,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:42:06,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:42:07,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:42:07,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 259 transitions, 2675 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:07,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:07,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:42:07,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:08,009 INFO L124 PetriNetUnfolderBase]: 3882/7022 cut-off events. [2025-02-06 04:42:08,009 INFO L125 PetriNetUnfolderBase]: For 142416/142653 co-relation queries the response was YES. [2025-02-06 04:42:08,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33591 conditions, 7022 events. 3882/7022 cut-off events. For 142416/142653 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 53256 event pairs, 1734 based on Foata normal form. 62/6848 useless extension candidates. Maximal degree in co-relation 33474. Up to 5794 conditions per place. [2025-02-06 04:42:08,053 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 260 selfloop transitions, 35 changer transitions 3/305 dead transitions. [2025-02-06 04:42:08,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 305 transitions, 3631 flow [2025-02-06 04:42:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2025-02-06 04:42:08,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4380165289256198 [2025-02-06 04:42:08,054 INFO L175 Difference]: Start difference. First operand has 264 places, 259 transitions, 2675 flow. Second operand 11 states and 212 transitions. [2025-02-06 04:42:08,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 305 transitions, 3631 flow [2025-02-06 04:42:08,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 305 transitions, 3477 flow, removed 38 selfloop flow, removed 8 redundant places. [2025-02-06 04:42:08,268 INFO L231 Difference]: Finished difference. Result has 268 places, 261 transitions, 2617 flow [2025-02-06 04:42:08,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2521, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2617, PETRI_PLACES=268, PETRI_TRANSITIONS=261} [2025-02-06 04:42:08,269 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 225 predicate places. [2025-02-06 04:42:08,269 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 261 transitions, 2617 flow [2025-02-06 04:42:08,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:08,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:08,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:08,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 04:42:08,269 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-02-06 04:42:08,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:08,270 INFO L85 PathProgramCache]: Analyzing trace with hash -751113410, now seen corresponding path program 31 times [2025-02-06 04:42:08,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:08,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984564695] [2025-02-06 04:42:08,270 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:42:08,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:08,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 04:42:08,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:42:08,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:42:08,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:08,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-02-06 04:42:08,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:08,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984564695] [2025-02-06 04:42:08,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984564695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:08,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:08,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:42:08,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101560745] [2025-02-06 04:42:08,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:08,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:42:08,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:08,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:42:08,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:42:08,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:42:08,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 261 transitions, 2617 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:08,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:08,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:42:08,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:09,626 INFO L124 PetriNetUnfolderBase]: 4013/7261 cut-off events. [2025-02-06 04:42:09,626 INFO L125 PetriNetUnfolderBase]: For 156308/156573 co-relation queries the response was YES. [2025-02-06 04:42:09,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35293 conditions, 7261 events. 4013/7261 cut-off events. For 156308/156573 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 55450 event pairs, 1778 based on Foata normal form. 54/7074 useless extension candidates. Maximal degree in co-relation 35174. Up to 5907 conditions per place. [2025-02-06 04:42:09,674 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 276 selfloop transitions, 35 changer transitions 3/321 dead transitions. [2025-02-06 04:42:09,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 321 transitions, 4102 flow [2025-02-06 04:42:09,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2025-02-06 04:42:09,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45867768595041325 [2025-02-06 04:42:09,679 INFO L175 Difference]: Start difference. First operand has 268 places, 261 transitions, 2617 flow. Second operand 11 states and 222 transitions. [2025-02-06 04:42:09,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 321 transitions, 4102 flow [2025-02-06 04:42:09,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 321 transitions, 4036 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 04:42:09,937 INFO L231 Difference]: Finished difference. Result has 274 places, 270 transitions, 3038 flow [2025-02-06 04:42:09,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2551, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3038, PETRI_PLACES=274, PETRI_TRANSITIONS=270} [2025-02-06 04:42:09,938 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 231 predicate places. [2025-02-06 04:42:09,938 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 270 transitions, 3038 flow [2025-02-06 04:42:09,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:09,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:09,939 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] [2025-02-06 04:42:09,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 04:42:09,939 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-02-06 04:42:09,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:09,939 INFO L85 PathProgramCache]: Analyzing trace with hash 392824282, now seen corresponding path program 32 times [2025-02-06 04:42:09,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:09,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906777132] [2025-02-06 04:42:09,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:42:09,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:09,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:42:09,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:42:09,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:42:09,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:10,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:42:10,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:10,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906777132] [2025-02-06 04:42:10,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906777132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:10,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:10,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:42:10,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005052549] [2025-02-06 04:42:10,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:10,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:42:10,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:10,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:42:10,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:42:10,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:42:10,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 270 transitions, 3038 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:10,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:10,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:42:10,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:11,367 INFO L124 PetriNetUnfolderBase]: 4175/7544 cut-off events. [2025-02-06 04:42:11,367 INFO L125 PetriNetUnfolderBase]: For 213624/214065 co-relation queries the response was YES. [2025-02-06 04:42:11,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39177 conditions, 7544 events. 4175/7544 cut-off events. For 213624/214065 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 58039 event pairs, 1819 based on Foata normal form. 54/7346 useless extension candidates. Maximal degree in co-relation 39054. Up to 6093 conditions per place. [2025-02-06 04:42:11,605 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 288 selfloop transitions, 36 changer transitions 3/334 dead transitions. [2025-02-06 04:42:11,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 334 transitions, 4555 flow [2025-02-06 04:42:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 227 transitions. [2025-02-06 04:42:11,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4690082644628099 [2025-02-06 04:42:11,607 INFO L175 Difference]: Start difference. First operand has 274 places, 270 transitions, 3038 flow. Second operand 11 states and 227 transitions. [2025-02-06 04:42:11,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 334 transitions, 4555 flow [2025-02-06 04:42:11,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 334 transitions, 4213 flow, removed 155 selfloop flow, removed 5 redundant places. [2025-02-06 04:42:11,946 INFO L231 Difference]: Finished difference. Result has 283 places, 279 transitions, 3145 flow [2025-02-06 04:42:11,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2696, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3145, PETRI_PLACES=283, PETRI_TRANSITIONS=279} [2025-02-06 04:42:11,947 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 240 predicate places. [2025-02-06 04:42:11,947 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 279 transitions, 3145 flow [2025-02-06 04:42:11,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:11,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:11,947 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] [2025-02-06 04:42:11,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 04:42:11,948 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-02-06 04:42:11,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1726530692, now seen corresponding path program 33 times [2025-02-06 04:42:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:11,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814834281] [2025-02-06 04:42:11,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:42:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:11,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:42:11,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:42:11,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:42:11,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:12,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:42:12,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:12,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814834281] [2025-02-06 04:42:12,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814834281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:12,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:12,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:42:12,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721702042] [2025-02-06 04:42:12,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:12,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:42:12,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:12,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:42:12,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:42:12,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:42:12,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 279 transitions, 3145 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:12,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:12,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:42:12,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:13,731 INFO L124 PetriNetUnfolderBase]: 4236/7654 cut-off events. [2025-02-06 04:42:13,732 INFO L125 PetriNetUnfolderBase]: For 224392/224879 co-relation queries the response was YES. [2025-02-06 04:42:13,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39510 conditions, 7654 events. 4236/7654 cut-off events. For 224392/224879 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 59167 event pairs, 1909 based on Foata normal form. 68/7466 useless extension candidates. Maximal degree in co-relation 39382. Up to 6332 conditions per place. [2025-02-06 04:42:13,818 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 282 selfloop transitions, 35 changer transitions 4/328 dead transitions. [2025-02-06 04:42:13,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 328 transitions, 4279 flow [2025-02-06 04:42:13,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 214 transitions. [2025-02-06 04:42:13,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44214876033057854 [2025-02-06 04:42:13,823 INFO L175 Difference]: Start difference. First operand has 283 places, 279 transitions, 3145 flow. Second operand 11 states and 214 transitions. [2025-02-06 04:42:13,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 328 transitions, 4279 flow [2025-02-06 04:42:14,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 328 transitions, 3973 flow, removed 137 selfloop flow, removed 5 redundant places. [2025-02-06 04:42:14,196 INFO L231 Difference]: Finished difference. Result has 291 places, 285 transitions, 3098 flow [2025-02-06 04:42:14,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2839, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3098, PETRI_PLACES=291, PETRI_TRANSITIONS=285} [2025-02-06 04:42:14,197 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 248 predicate places. [2025-02-06 04:42:14,197 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 285 transitions, 3098 flow [2025-02-06 04:42:14,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:14,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:14,197 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] [2025-02-06 04:42:14,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-06 04:42:14,198 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-02-06 04:42:14,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:14,198 INFO L85 PathProgramCache]: Analyzing trace with hash 129334322, now seen corresponding path program 34 times [2025-02-06 04:42:14,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:14,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467536916] [2025-02-06 04:42:14,198 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:42:14,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:14,203 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:42:14,213 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:42:14,213 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:42:14,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:42:14,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:14,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467536916] [2025-02-06 04:42:14,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467536916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:14,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:14,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:42:14,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865126426] [2025-02-06 04:42:14,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:14,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:42:14,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:14,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:42:14,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:42:14,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 04:42:14,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 285 transitions, 3098 flow. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:14,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:14,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 04:42:14,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:15,825 INFO L124 PetriNetUnfolderBase]: 4606/8236 cut-off events. [2025-02-06 04:42:15,826 INFO L125 PetriNetUnfolderBase]: For 236538/236828 co-relation queries the response was YES. [2025-02-06 04:42:15,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42220 conditions, 8236 events. 4606/8236 cut-off events. For 236538/236828 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 63575 event pairs, 2041 based on Foata normal form. 74/8045 useless extension candidates. Maximal degree in co-relation 42088. Up to 6601 conditions per place. [2025-02-06 04:42:15,917 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 303 selfloop transitions, 43 changer transitions 3/355 dead transitions. [2025-02-06 04:42:15,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 355 transitions, 4686 flow [2025-02-06 04:42:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:15,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 226 transitions. [2025-02-06 04:42:15,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4669421487603306 [2025-02-06 04:42:15,919 INFO L175 Difference]: Start difference. First operand has 291 places, 285 transitions, 3098 flow. Second operand 11 states and 226 transitions. [2025-02-06 04:42:15,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 355 transitions, 4686 flow [2025-02-06 04:42:16,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 355 transitions, 4466 flow, removed 91 selfloop flow, removed 6 redundant places. [2025-02-06 04:42:16,474 INFO L231 Difference]: Finished difference. Result has 299 places, 294 transitions, 3400 flow [2025-02-06 04:42:16,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2878, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3400, PETRI_PLACES=299, PETRI_TRANSITIONS=294} [2025-02-06 04:42:16,475 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 256 predicate places. [2025-02-06 04:42:16,475 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 294 transitions, 3400 flow [2025-02-06 04:42:16,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:16,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:16,476 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] [2025-02-06 04:42:16,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-06 04:42:16,476 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-02-06 04:42:16,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash -2004196706, now seen corresponding path program 35 times [2025-02-06 04:42:16,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:16,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669353597] [2025-02-06 04:42:16,477 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:42:16,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:16,483 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:42:16,489 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:42:16,489 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:42:16,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:42:16,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:16,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669353597] [2025-02-06 04:42:16,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669353597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:16,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:16,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:42:16,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026396534] [2025-02-06 04:42:16,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:16,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:42:16,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:16,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:42:16,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:42:16,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:42:16,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 294 transitions, 3400 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:16,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:16,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:42:16,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:18,084 INFO L124 PetriNetUnfolderBase]: 4471/8059 cut-off events. [2025-02-06 04:42:18,085 INFO L125 PetriNetUnfolderBase]: For 261017/261310 co-relation queries the response was YES. [2025-02-06 04:42:18,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42559 conditions, 8059 events. 4471/8059 cut-off events. For 261017/261310 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 62862 event pairs, 2037 based on Foata normal form. 63/7861 useless extension candidates. Maximal degree in co-relation 42422. Up to 6623 conditions per place. [2025-02-06 04:42:18,159 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 309 selfloop transitions, 34 changer transitions 3/353 dead transitions. [2025-02-06 04:42:18,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 353 transitions, 4829 flow [2025-02-06 04:42:18,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions. [2025-02-06 04:42:18,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4628099173553719 [2025-02-06 04:42:18,160 INFO L175 Difference]: Start difference. First operand has 299 places, 294 transitions, 3400 flow. Second operand 11 states and 224 transitions. [2025-02-06 04:42:18,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 353 transitions, 4829 flow [2025-02-06 04:42:18,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 353 transitions, 4497 flow, removed 148 selfloop flow, removed 5 redundant places. [2025-02-06 04:42:18,773 INFO L231 Difference]: Finished difference. Result has 307 places, 299 transitions, 3384 flow [2025-02-06 04:42:18,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3072, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3384, PETRI_PLACES=307, PETRI_TRANSITIONS=299} [2025-02-06 04:42:18,774 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 264 predicate places. [2025-02-06 04:42:18,774 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 299 transitions, 3384 flow [2025-02-06 04:42:18,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:18,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:18,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:18,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-06 04:42:18,774 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-02-06 04:42:18,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:18,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1604209698, now seen corresponding path program 36 times [2025-02-06 04:42:18,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:18,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470197448] [2025-02-06 04:42:18,775 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:42:18,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:18,780 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:42:18,786 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:42:18,786 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:42:18,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:42:19,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:19,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470197448] [2025-02-06 04:42:19,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470197448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:19,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:19,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:42:19,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400048921] [2025-02-06 04:42:19,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:19,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:42:19,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:19,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:42:19,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:42:19,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:42:19,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 299 transitions, 3384 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:19,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:19,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:42:19,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:20,331 INFO L124 PetriNetUnfolderBase]: 4471/8048 cut-off events. [2025-02-06 04:42:20,331 INFO L125 PetriNetUnfolderBase]: For 249760/250049 co-relation queries the response was YES. [2025-02-06 04:42:20,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41394 conditions, 8048 events. 4471/8048 cut-off events. For 249760/250049 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 62774 event pairs, 2061 based on Foata normal form. 69/7852 useless extension candidates. Maximal degree in co-relation 41253. Up to 6700 conditions per place. [2025-02-06 04:42:20,418 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 305 selfloop transitions, 33 changer transitions 3/348 dead transitions. [2025-02-06 04:42:20,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 348 transitions, 4559 flow [2025-02-06 04:42:20,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2025-02-06 04:42:20,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44421487603305787 [2025-02-06 04:42:20,419 INFO L175 Difference]: Start difference. First operand has 307 places, 299 transitions, 3384 flow. Second operand 11 states and 215 transitions. [2025-02-06 04:42:20,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 348 transitions, 4559 flow [2025-02-06 04:42:21,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 348 transitions, 4310 flow, removed 107 selfloop flow, removed 6 redundant places. [2025-02-06 04:42:21,069 INFO L231 Difference]: Finished difference. Result has 313 places, 302 transitions, 3286 flow [2025-02-06 04:42:21,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3135, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3286, PETRI_PLACES=313, PETRI_TRANSITIONS=302} [2025-02-06 04:42:21,070 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 270 predicate places. [2025-02-06 04:42:21,070 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 302 transitions, 3286 flow [2025-02-06 04:42:21,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:21,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:21,070 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] [2025-02-06 04:42:21,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-06 04:42:21,070 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-02-06 04:42:21,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:21,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1369339994, now seen corresponding path program 37 times [2025-02-06 04:42:21,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:21,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959437854] [2025-02-06 04:42:21,071 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:42:21,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:21,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 04:42:21,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:42:21,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:42:21,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:42:21,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:21,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959437854] [2025-02-06 04:42:21,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959437854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:21,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:21,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:42:21,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836045725] [2025-02-06 04:42:21,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:21,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:42:21,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:21,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:42:21,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:42:21,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:42:21,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 302 transitions, 3286 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:21,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:21,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:42:21,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:22,641 INFO L124 PetriNetUnfolderBase]: 4534/8174 cut-off events. [2025-02-06 04:42:22,642 INFO L125 PetriNetUnfolderBase]: For 251442/251711 co-relation queries the response was YES. [2025-02-06 04:42:22,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41897 conditions, 8174 events. 4534/8174 cut-off events. For 251442/251711 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 64020 event pairs, 2107 based on Foata normal form. 58/7971 useless extension candidates. Maximal degree in co-relation 41753. Up to 6715 conditions per place. [2025-02-06 04:42:22,743 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 315 selfloop transitions, 35 changer transitions 3/360 dead transitions. [2025-02-06 04:42:22,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 360 transitions, 4744 flow [2025-02-06 04:42:22,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions. [2025-02-06 04:42:22,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4628099173553719 [2025-02-06 04:42:22,744 INFO L175 Difference]: Start difference. First operand has 313 places, 302 transitions, 3286 flow. Second operand 11 states and 224 transitions. [2025-02-06 04:42:22,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 360 transitions, 4744 flow [2025-02-06 04:42:23,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 360 transitions, 4620 flow, removed 31 selfloop flow, removed 8 redundant places. [2025-02-06 04:42:23,288 INFO L231 Difference]: Finished difference. Result has 318 places, 307 transitions, 3488 flow [2025-02-06 04:42:23,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3162, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3488, PETRI_PLACES=318, PETRI_TRANSITIONS=307} [2025-02-06 04:42:23,289 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 275 predicate places. [2025-02-06 04:42:23,289 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 307 transitions, 3488 flow [2025-02-06 04:42:23,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:23,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:23,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:23,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-06 04:42:23,289 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-02-06 04:42:23,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:23,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1508998722, now seen corresponding path program 38 times [2025-02-06 04:42:23,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:23,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586977440] [2025-02-06 04:42:23,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:42:23,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:23,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:42:23,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:42:23,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:42:23,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:42:23,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:23,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586977440] [2025-02-06 04:42:23,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586977440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:23,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:23,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:42:23,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408895620] [2025-02-06 04:42:23,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:23,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:42:23,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:23,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:42:23,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:42:23,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:42:23,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 307 transitions, 3488 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:23,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:23,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:42:23,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:25,128 INFO L124 PetriNetUnfolderBase]: 4534/8182 cut-off events. [2025-02-06 04:42:25,128 INFO L125 PetriNetUnfolderBase]: For 264614/264883 co-relation queries the response was YES. [2025-02-06 04:42:25,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42256 conditions, 8182 events. 4534/8182 cut-off events. For 264614/264883 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 64065 event pairs, 2106 based on Foata normal form. 64/7984 useless extension candidates. Maximal degree in co-relation 42109. Up to 6753 conditions per place. [2025-02-06 04:42:25,224 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 313 selfloop transitions, 36 changer transitions 4/360 dead transitions. [2025-02-06 04:42:25,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 360 transitions, 4715 flow [2025-02-06 04:42:25,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 221 transitions. [2025-02-06 04:42:25,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45661157024793386 [2025-02-06 04:42:25,226 INFO L175 Difference]: Start difference. First operand has 318 places, 307 transitions, 3488 flow. Second operand 11 states and 221 transitions. [2025-02-06 04:42:25,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 360 transitions, 4715 flow [2025-02-06 04:42:25,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 360 transitions, 4451 flow, removed 114 selfloop flow, removed 6 redundant places. [2025-02-06 04:42:25,846 INFO L231 Difference]: Finished difference. Result has 324 places, 311 transitions, 3391 flow [2025-02-06 04:42:25,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3224, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3391, PETRI_PLACES=324, PETRI_TRANSITIONS=311} [2025-02-06 04:42:25,847 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 281 predicate places. [2025-02-06 04:42:25,847 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 311 transitions, 3391 flow [2025-02-06 04:42:25,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:25,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:25,847 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] [2025-02-06 04:42:25,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-06 04:42:25,848 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-02-06 04:42:25,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:25,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1846942496, now seen corresponding path program 39 times [2025-02-06 04:42:25,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:25,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731564653] [2025-02-06 04:42:25,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:42:25,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:25,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:42:25,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-06 04:42:25,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:42:25,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:42:26,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:26,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731564653] [2025-02-06 04:42:26,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731564653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:26,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:26,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:42:26,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753256335] [2025-02-06 04:42:26,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:26,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:42:26,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:26,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:42:26,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:42:26,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:42:26,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 311 transitions, 3391 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:26,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:26,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:42:26,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:27,350 INFO L124 PetriNetUnfolderBase]: 4534/8180 cut-off events. [2025-02-06 04:42:27,350 INFO L125 PetriNetUnfolderBase]: For 249143/249436 co-relation queries the response was YES. [2025-02-06 04:42:27,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41410 conditions, 8180 events. 4534/8180 cut-off events. For 249143/249436 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 64083 event pairs, 2106 based on Foata normal form. 80/8000 useless extension candidates. Maximal degree in co-relation 41260. Up to 6749 conditions per place. [2025-02-06 04:42:27,446 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 311 selfloop transitions, 40 changer transitions 4/362 dead transitions. [2025-02-06 04:42:27,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 362 transitions, 4548 flow [2025-02-06 04:42:27,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2025-02-06 04:42:27,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-02-06 04:42:27,447 INFO L175 Difference]: Start difference. First operand has 324 places, 311 transitions, 3391 flow. Second operand 11 states and 220 transitions. [2025-02-06 04:42:27,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 362 transitions, 4548 flow [2025-02-06 04:42:28,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 362 transitions, 4384 flow, removed 48 selfloop flow, removed 8 redundant places. [2025-02-06 04:42:28,027 INFO L231 Difference]: Finished difference. Result has 328 places, 315 transitions, 3413 flow [2025-02-06 04:42:28,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3227, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3413, PETRI_PLACES=328, PETRI_TRANSITIONS=315} [2025-02-06 04:42:28,028 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 285 predicate places. [2025-02-06 04:42:28,028 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 315 transitions, 3413 flow [2025-02-06 04:42:28,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:28,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:28,028 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] [2025-02-06 04:42:28,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-06 04:42:28,028 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-02-06 04:42:28,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:28,029 INFO L85 PathProgramCache]: Analyzing trace with hash -675132824, now seen corresponding path program 40 times [2025-02-06 04:42:28,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:28,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266248462] [2025-02-06 04:42:28,029 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:42:28,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:28,034 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:42:28,039 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:42:28,039 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:42:28,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:42:28,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:28,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266248462] [2025-02-06 04:42:28,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266248462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:28,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:28,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:42:28,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407051225] [2025-02-06 04:42:28,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:28,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:42:28,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:28,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:42:28,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:42:28,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 04:42:28,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 315 transitions, 3413 flow. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:28,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:28,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 04:42:28,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:29,500 INFO L124 PetriNetUnfolderBase]: 4768/8550 cut-off events. [2025-02-06 04:42:29,500 INFO L125 PetriNetUnfolderBase]: For 259774/260070 co-relation queries the response was YES. [2025-02-06 04:42:29,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43009 conditions, 8550 events. 4768/8550 cut-off events. For 259774/260070 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 66727 event pairs, 2264 based on Foata normal form. 80/8350 useless extension candidates. Maximal degree in co-relation 42857. Up to 7125 conditions per place. [2025-02-06 04:42:29,588 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 319 selfloop transitions, 36 changer transitions 3/364 dead transitions. [2025-02-06 04:42:29,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 364 transitions, 4559 flow [2025-02-06 04:42:29,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2025-02-06 04:42:29,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42768595041322316 [2025-02-06 04:42:29,589 INFO L175 Difference]: Start difference. First operand has 328 places, 315 transitions, 3413 flow. Second operand 11 states and 207 transitions. [2025-02-06 04:42:29,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 364 transitions, 4559 flow [2025-02-06 04:42:30,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 364 transitions, 4377 flow, removed 53 selfloop flow, removed 8 redundant places. [2025-02-06 04:42:30,039 INFO L231 Difference]: Finished difference. Result has 332 places, 318 transitions, 3397 flow [2025-02-06 04:42:30,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3231, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3397, PETRI_PLACES=332, PETRI_TRANSITIONS=318} [2025-02-06 04:42:30,039 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 289 predicate places. [2025-02-06 04:42:30,039 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 318 transitions, 3397 flow [2025-02-06 04:42:30,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:30,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:30,040 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] [2025-02-06 04:42:30,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-06 04:42:30,040 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-02-06 04:42:30,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:30,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1716690244, now seen corresponding path program 41 times [2025-02-06 04:42:30,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:30,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269764176] [2025-02-06 04:42:30,040 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:42:30,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:30,045 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 04:42:30,049 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:42:30,050 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:42:30,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:30,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:42:30,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:30,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269764176] [2025-02-06 04:42:30,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269764176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:30,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:30,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:42:30,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106225706] [2025-02-06 04:42:30,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:30,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:42:30,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:30,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:42:30,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:42:30,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 04:42:30,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 318 transitions, 3397 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:30,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:30,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 04:42:30,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:31,633 INFO L124 PetriNetUnfolderBase]: 4570/8259 cut-off events. [2025-02-06 04:42:31,633 INFO L125 PetriNetUnfolderBase]: For 240418/240711 co-relation queries the response was YES. [2025-02-06 04:42:31,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40940 conditions, 8259 events. 4570/8259 cut-off events. For 240418/240711 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 65106 event pairs, 2171 based on Foata normal form. 72/8059 useless extension candidates. Maximal degree in co-relation 40786. Up to 6896 conditions per place. [2025-02-06 04:42:31,716 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 317 selfloop transitions, 34 changer transitions 3/361 dead transitions. [2025-02-06 04:42:31,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 361 transitions, 4459 flow [2025-02-06 04:42:31,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:42:31,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:42:31,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2025-02-06 04:42:31,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4359504132231405 [2025-02-06 04:42:31,717 INFO L175 Difference]: Start difference. First operand has 332 places, 318 transitions, 3397 flow. Second operand 11 states and 211 transitions. [2025-02-06 04:42:31,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 361 transitions, 4459 flow [2025-02-06 04:42:32,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 361 transitions, 4291 flow, removed 49 selfloop flow, removed 8 redundant places. [2025-02-06 04:42:32,241 INFO L231 Difference]: Finished difference. Result has 336 places, 320 transitions, 3323 flow [2025-02-06 04:42:32,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3231, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3323, PETRI_PLACES=336, PETRI_TRANSITIONS=320} [2025-02-06 04:42:32,242 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 293 predicate places. [2025-02-06 04:42:32,242 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 320 transitions, 3323 flow [2025-02-06 04:42:32,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:32,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:32,243 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, 1, 1] [2025-02-06 04:42:32,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-06 04:42:32,243 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-02-06 04:42:32,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:32,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1240382500, now seen corresponding path program 1 times [2025-02-06 04:42:32,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:32,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617444012] [2025-02-06 04:42:32,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:42:32,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:32,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 04:42:32,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 04:42:32,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:42:32,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:42:32,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:32,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617444012] [2025-02-06 04:42:32,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617444012] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:42:32,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513123450] [2025-02-06 04:42:32,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:42:32,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:42:32,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:42:32,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:42:32,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:42:32,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 04:42:32,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 04:42:32,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:42:32,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:32,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:42:32,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:42:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:42:32,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:42:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:42:32,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513123450] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:42:32,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:42:32,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 04:42:32,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897322935] [2025-02-06 04:42:32,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:42:32,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:42:32,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:32,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:42:32,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:42:32,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-02-06 04:42:32,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 320 transitions, 3323 flow. Second operand has 12 states, 12 states have (on average 15.833333333333334) internal successors, (190), 12 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:32,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:32,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-02-06 04:42:32,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:34,827 INFO L124 PetriNetUnfolderBase]: 7711/14651 cut-off events. [2025-02-06 04:42:34,828 INFO L125 PetriNetUnfolderBase]: For 552409/553288 co-relation queries the response was YES. [2025-02-06 04:42:34,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74610 conditions, 14651 events. 7711/14651 cut-off events. For 552409/553288 co-relation queries the response was YES. Maximal size of possible extension queue 1270. Compared 133356 event pairs, 4634 based on Foata normal form. 400/14474 useless extension candidates. Maximal degree in co-relation 74454. Up to 6255 conditions per place. [2025-02-06 04:42:34,968 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 535 selfloop transitions, 5 changer transitions 12/598 dead transitions. [2025-02-06 04:42:34,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 598 transitions, 7420 flow [2025-02-06 04:42:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:42:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:42:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-02-06 04:42:34,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-02-06 04:42:34,969 INFO L175 Difference]: Start difference. First operand has 336 places, 320 transitions, 3323 flow. Second operand 6 states and 136 transitions. [2025-02-06 04:42:34,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 598 transitions, 7420 flow [2025-02-06 04:42:35,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 598 transitions, 7288 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-02-06 04:42:35,803 INFO L231 Difference]: Finished difference. Result has 336 places, 323 transitions, 3299 flow [2025-02-06 04:42:35,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3257, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3299, PETRI_PLACES=336, PETRI_TRANSITIONS=323} [2025-02-06 04:42:35,804 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 293 predicate places. [2025-02-06 04:42:35,804 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 323 transitions, 3299 flow [2025-02-06 04:42:35,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.833333333333334) internal successors, (190), 12 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:35,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:35,804 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, 1, 1] [2025-02-06 04:42:35,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:42:36,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-02-06 04:42:36,009 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-02-06 04:42:36,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:36,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1678103319, now seen corresponding path program 2 times [2025-02-06 04:42:36,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:36,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950362596] [2025-02-06 04:42:36,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:42:36,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:36,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 04:42:36,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 37 statements. [2025-02-06 04:42:36,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:42:36,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:36,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:42:36,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:36,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950362596] [2025-02-06 04:42:36,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950362596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:36,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:36,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:42:36,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707805267] [2025-02-06 04:42:36,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:36,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:42:36,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:36,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:42:36,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:42:36,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 04:42:36,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 323 transitions, 3299 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:36,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:36,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 04:42:36,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:39,194 INFO L124 PetriNetUnfolderBase]: 10503/19087 cut-off events. [2025-02-06 04:42:39,194 INFO L125 PetriNetUnfolderBase]: For 719819/720701 co-relation queries the response was YES. [2025-02-06 04:42:39,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94441 conditions, 19087 events. 10503/19087 cut-off events. For 719819/720701 co-relation queries the response was YES. Maximal size of possible extension queue 1517. Compared 170828 event pairs, 4196 based on Foata normal form. 346/18386 useless extension candidates. Maximal degree in co-relation 94282. Up to 13192 conditions per place. [2025-02-06 04:42:39,406 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 384 selfloop transitions, 8 changer transitions 0/436 dead transitions. [2025-02-06 04:42:39,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 436 transitions, 5198 flow [2025-02-06 04:42:39,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:42:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:42:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2025-02-06 04:42:39,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-02-06 04:42:39,408 INFO L175 Difference]: Start difference. First operand has 336 places, 323 transitions, 3299 flow. Second operand 6 states and 128 transitions. [2025-02-06 04:42:39,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 436 transitions, 5198 flow [2025-02-06 04:42:40,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 436 transitions, 5175 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-02-06 04:42:40,385 INFO L231 Difference]: Finished difference. Result has 340 places, 326 transitions, 3324 flow [2025-02-06 04:42:40,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3284, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3324, PETRI_PLACES=340, PETRI_TRANSITIONS=326} [2025-02-06 04:42:40,386 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 297 predicate places. [2025-02-06 04:42:40,386 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 326 transitions, 3324 flow [2025-02-06 04:42:40,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:40,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:40,386 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, 1, 1] [2025-02-06 04:42:40,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-06 04:42:40,387 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-02-06 04:42:40,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash 578483954, now seen corresponding path program 1 times [2025-02-06 04:42:40,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:40,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557841308] [2025-02-06 04:42:40,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:42:40,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:40,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 04:42:40,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:42:40,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:42:40,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:42:40,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:40,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557841308] [2025-02-06 04:42:40,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557841308] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:42:40,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192230267] [2025-02-06 04:42:40,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:42:40,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:42:40,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:42:40,486 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:42:40,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:42:40,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 04:42:40,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:42:40,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:42:40,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:40,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:42:40,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:42:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:42:40,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:42:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:42:40,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192230267] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:42:40,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:42:40,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-02-06 04:42:40,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562754908] [2025-02-06 04:42:40,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:42:40,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:42:40,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:40,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:42:40,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:42:40,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-02-06 04:42:40,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 326 transitions, 3324 flow. Second operand has 13 states, 13 states have (on average 14.692307692307692) internal successors, (191), 13 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:40,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:40,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-02-06 04:42:40,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:45,680 INFO L124 PetriNetUnfolderBase]: 12988/26170 cut-off events. [2025-02-06 04:42:45,681 INFO L125 PetriNetUnfolderBase]: For 1145858/1148245 co-relation queries the response was YES. [2025-02-06 04:42:45,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140374 conditions, 26170 events. 12988/26170 cut-off events. For 1145858/1148245 co-relation queries the response was YES. Maximal size of possible extension queue 2451. Compared 276131 event pairs, 4914 based on Foata normal form. 2807/28603 useless extension candidates. Maximal degree in co-relation 140215. Up to 11010 conditions per place. [2025-02-06 04:42:45,965 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 479 selfloop transitions, 9 changer transitions 58/593 dead transitions. [2025-02-06 04:42:45,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 593 transitions, 7854 flow [2025-02-06 04:42:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:42:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:42:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-02-06 04:42:45,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5198863636363636 [2025-02-06 04:42:45,966 INFO L175 Difference]: Start difference. First operand has 340 places, 326 transitions, 3324 flow. Second operand 8 states and 183 transitions. [2025-02-06 04:42:45,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 593 transitions, 7854 flow [2025-02-06 04:42:47,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 593 transitions, 7844 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:42:47,729 INFO L231 Difference]: Finished difference. Result has 348 places, 330 transitions, 3526 flow [2025-02-06 04:42:47,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3318, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3526, PETRI_PLACES=348, PETRI_TRANSITIONS=330} [2025-02-06 04:42:47,729 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 305 predicate places. [2025-02-06 04:42:47,730 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 330 transitions, 3526 flow [2025-02-06 04:42:47,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.692307692307692) internal successors, (191), 13 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:47,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:47,730 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] [2025-02-06 04:42:47,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:42:47,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-02-06 04:42:47,931 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-02-06 04:42:47,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:47,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1186692001, now seen corresponding path program 2 times [2025-02-06 04:42:47,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:47,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919260375] [2025-02-06 04:42:47,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:42:47,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:47,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-06 04:42:47,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 04:42:47,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:42:47,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:42:47,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:47,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919260375] [2025-02-06 04:42:47,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919260375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:47,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:47,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:42:47,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964459131] [2025-02-06 04:42:47,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:47,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:42:47,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:47,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:42:47,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:42:47,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-02-06 04:42:47,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 330 transitions, 3526 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:47,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:47,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-02-06 04:42:47,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:52,981 INFO L124 PetriNetUnfolderBase]: 14096/28549 cut-off events. [2025-02-06 04:42:52,981 INFO L125 PetriNetUnfolderBase]: For 1330266/1333954 co-relation queries the response was YES. [2025-02-06 04:42:53,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160964 conditions, 28549 events. 14096/28549 cut-off events. For 1330266/1333954 co-relation queries the response was YES. Maximal size of possible extension queue 2405. Compared 300459 event pairs, 5704 based on Foata normal form. 2018/30273 useless extension candidates. Maximal degree in co-relation 160801. Up to 13296 conditions per place. [2025-02-06 04:42:53,614 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 427 selfloop transitions, 35 changer transitions 1/510 dead transitions. [2025-02-06 04:42:53,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 510 transitions, 6650 flow [2025-02-06 04:42:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:42:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:42:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-02-06 04:42:53,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6477272727272727 [2025-02-06 04:42:53,615 INFO L175 Difference]: Start difference. First operand has 348 places, 330 transitions, 3526 flow. Second operand 4 states and 114 transitions. [2025-02-06 04:42:53,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 510 transitions, 6650 flow