./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 551b0097 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-?-551b009-m [2025-01-09 16:46:19,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:46:19,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:46:20,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:46:20,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:46:20,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:46:20,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:46:20,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:46:20,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:46:20,027 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:46:20,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:46:20,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:46:20,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:46:20,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:46:20,028 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:46:20,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:46:20,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:46:20,028 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:46:20,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:46:20,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:46:20,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:46:20,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:46:20,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:46:20,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:46:20,029 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:46:20,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:46:20,030 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:46:20,030 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:46:20,030 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:46:20,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:46:20,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:46:20,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:46:20,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:46:20,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:46:20,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:46:20,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:46:20,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:46:20,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:46:20,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:46:20,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:46:20,032 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:46:20,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:46:20,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:46:20,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:46:20,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:46:20,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:46:20,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:46:20,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:46:20,033 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-01-09 16:46:20,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:46:20,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:46:20,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:46:20,298 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:46:20,298 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:46:20,300 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-01-09 16:46:21,552 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf0cdfb4e/ed547d9b567f4fc78ac1a63753f9bdd0/FLAG7353a1177 [2025-01-09 16:46:21,794 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:46:21,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-01-09 16:46:21,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf0cdfb4e/ed547d9b567f4fc78ac1a63753f9bdd0/FLAG7353a1177 [2025-01-09 16:46:21,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf0cdfb4e/ed547d9b567f4fc78ac1a63753f9bdd0 [2025-01-09 16:46:21,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:46:21,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:46:21,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:46:21,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:46:21,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:46:21,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:46:21" (1/1) ... [2025-01-09 16:46:21,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@225ed90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:21, skipping insertion in model container [2025-01-09 16:46:21,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:46:21" (1/1) ... [2025-01-09 16:46:21,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:46:22,005 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-01-09 16:46:22,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:46:22,029 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:46:22,057 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-01-09 16:46:22,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:46:22,080 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:46:22,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:22 WrapperNode [2025-01-09 16:46:22,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:46:22,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:46:22,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:46:22,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:46:22,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:22" (1/1) ... [2025-01-09 16:46:22,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:22" (1/1) ... [2025-01-09 16:46:22,125 INFO L138 Inliner]: procedures = 25, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 237 [2025-01-09 16:46:22,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:46:22,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:46:22,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:46:22,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:46:22,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:22" (1/1) ... [2025-01-09 16:46:22,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:22" (1/1) ... [2025-01-09 16:46:22,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:22" (1/1) ... [2025-01-09 16:46:22,157 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-01-09 16:46:22,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:22" (1/1) ... [2025-01-09 16:46:22,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:22" (1/1) ... [2025-01-09 16:46:22,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:22" (1/1) ... [2025-01-09 16:46:22,168 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:22" (1/1) ... [2025-01-09 16:46:22,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:22" (1/1) ... [2025-01-09 16:46:22,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:22" (1/1) ... [2025-01-09 16:46:22,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:22" (1/1) ... [2025-01-09 16:46:22,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:46:22,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:46:22,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:46:22,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:46:22,176 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:22" (1/1) ... [2025-01-09 16:46:22,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:46:22,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:22,199 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-01-09 16:46:22,202 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-01-09 16:46:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:46:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:46:22,219 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:46:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:46:22,219 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:46:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:46:22,219 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:46:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:46:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:46:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:46:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:46:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:46:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:46:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:46:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:46:22,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:46:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:46:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:46:22,221 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:46:22,314 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:46:22,315 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:46:22,645 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:46:22,645 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:46:22,954 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:46:22,955 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 16:46:22,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:46:22 BoogieIcfgContainer [2025-01-09 16:46:22,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:46:22,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:46:22,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:46:22,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:46:22,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:46:21" (1/3) ... [2025-01-09 16:46:22,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7d6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:46:22, skipping insertion in model container [2025-01-09 16:46:22,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:22" (2/3) ... [2025-01-09 16:46:22,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7d6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:46:22, skipping insertion in model container [2025-01-09 16:46:22,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:46:22" (3/3) ... [2025-01-09 16:46:22,965 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2025-01-09 16:46:22,979 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:46:22,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-3-nl.wvr.c that has 4 procedures, 36 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-01-09 16:46:22,981 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:46:23,041 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:46:23,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 42 transitions, 105 flow [2025-01-09 16:46:23,110 INFO L124 PetriNetUnfolderBase]: 7/39 cut-off events. [2025-01-09 16:46:23,116 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:46:23,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 7/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-01-09 16:46:23,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 42 transitions, 105 flow [2025-01-09 16:46:23,123 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 38 transitions, 94 flow [2025-01-09 16:46:23,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:46:23,144 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;@3aa65206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:46:23,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:46:23,161 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:46:23,163 INFO L124 PetriNetUnfolderBase]: 7/37 cut-off events. [2025-01-09 16:46:23,163 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:46:23,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:23,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:23,164 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-01-09 16:46:23,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:23,169 INFO L85 PathProgramCache]: Analyzing trace with hash 877125290, now seen corresponding path program 1 times [2025-01-09 16:46:23,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:23,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700896922] [2025-01-09 16:46:23,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:23,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:23,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:46:23,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:46:23,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:23,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:23,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:23,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:23,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700896922] [2025-01-09 16:46:23,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700896922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:23,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:23,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:46:23,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846218639] [2025-01-09 16:46:23,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:23,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:46:23,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:23,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:46:23,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:46:23,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-01-09 16:46:23,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:23,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:23,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-01-09 16:46:23,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:23,682 INFO L124 PetriNetUnfolderBase]: 1088/1694 cut-off events. [2025-01-09 16:46:23,683 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-01-09 16:46:23,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3273 conditions, 1694 events. 1088/1694 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7408 event pairs, 892 based on Foata normal form. 0/1559 useless extension candidates. Maximal degree in co-relation 3037. Up to 1453 conditions per place. [2025-01-09 16:46:23,705 INFO L140 encePairwiseOnDemand]: 40/42 looper letters, 30 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2025-01-09 16:46:23,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 150 flow [2025-01-09 16:46:23,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:46:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 16:46:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2025-01-09 16:46:23,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-01-09 16:46:23,721 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 94 flow. Second operand 2 states and 50 transitions. [2025-01-09 16:46:23,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 150 flow [2025-01-09 16:46:23,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 138 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:46:23,731 INFO L231 Difference]: Finished difference. Result has 36 places, 36 transitions, 78 flow [2025-01-09 16:46:23,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=36, PETRI_TRANSITIONS=36} [2025-01-09 16:46:23,736 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2025-01-09 16:46:23,737 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 78 flow [2025-01-09 16:46:23,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:23,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:23,739 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:23,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:46:23,739 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-01-09 16:46:23,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:23,741 INFO L85 PathProgramCache]: Analyzing trace with hash 928623823, now seen corresponding path program 1 times [2025-01-09 16:46:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:23,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157623737] [2025-01-09 16:46:23,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:23,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:23,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:46:23,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:23,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:23,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:24,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:24,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157623737] [2025-01-09 16:46:24,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157623737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:24,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:24,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:46:24,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597739824] [2025-01-09 16:46:24,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:24,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:46:24,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:24,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:46:24,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:46:24,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-01-09 16:46:24,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:24,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:24,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-01-09 16:46:24,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:24,416 INFO L124 PetriNetUnfolderBase]: 1209/1910 cut-off events. [2025-01-09 16:46:24,416 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 16:46:24,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3609 conditions, 1910 events. 1209/1910 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8603 event pairs, 999 based on Foata normal form. 87/1847 useless extension candidates. Maximal degree in co-relation 3606. Up to 1453 conditions per place. [2025-01-09 16:46:24,431 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 29 selfloop transitions, 2 changer transitions 18/55 dead transitions. [2025-01-09 16:46:24,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 217 flow [2025-01-09 16:46:24,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:46:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:46:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-01-09 16:46:24,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2025-01-09 16:46:24,433 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 78 flow. Second operand 5 states and 97 transitions. [2025-01-09 16:46:24,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 217 flow [2025-01-09 16:46:24,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 217 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:46:24,437 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 100 flow [2025-01-09 16:46:24,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2025-01-09 16:46:24,438 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2025-01-09 16:46:24,438 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 100 flow [2025-01-09 16:46:24,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:24,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:24,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:24,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:46:24,439 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-01-09 16:46:24,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1058328501, now seen corresponding path program 1 times [2025-01-09 16:46:24,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:24,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746245714] [2025-01-09 16:46:24,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:24,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:24,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:46:24,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:46:24,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:24,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:24,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:24,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746245714] [2025-01-09 16:46:24,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746245714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:24,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:24,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:46:24,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770944915] [2025-01-09 16:46:24,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:24,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:46:24,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:24,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:46:24,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:46:24,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-01-09 16:46:24,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:24,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:24,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-01-09 16:46:24,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:24,910 INFO L124 PetriNetUnfolderBase]: 1288/2024 cut-off events. [2025-01-09 16:46:24,911 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2025-01-09 16:46:24,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4192 conditions, 2024 events. 1288/2024 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9211 event pairs, 1072 based on Foata normal form. 77/1964 useless extension candidates. Maximal degree in co-relation 4185. Up to 1454 conditions per place. [2025-01-09 16:46:24,925 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 30 selfloop transitions, 2 changer transitions 17/55 dead transitions. [2025-01-09 16:46:24,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 248 flow [2025-01-09 16:46:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:46:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:46:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-01-09 16:46:24,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2025-01-09 16:46:24,928 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 100 flow. Second operand 4 states and 86 transitions. [2025-01-09 16:46:24,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 248 flow [2025-01-09 16:46:24,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 236 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-09 16:46:24,931 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 108 flow [2025-01-09 16:46:24,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2025-01-09 16:46:24,933 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2025-01-09 16:46:24,933 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 108 flow [2025-01-09 16:46:24,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:24,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:24,933 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-01-09 16:46:24,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:46:24,934 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-01-09 16:46:24,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:24,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1444814412, now seen corresponding path program 1 times [2025-01-09 16:46:24,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:24,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626039694] [2025-01-09 16:46:24,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:24,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:24,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:46:25,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:46:25,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:25,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:26,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:26,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626039694] [2025-01-09 16:46:26,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626039694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:26,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:26,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:26,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661176078] [2025-01-09 16:46:26,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:26,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:26,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:26,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:26,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:26,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:26,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 108 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:26,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:26,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:26,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:26,941 INFO L124 PetriNetUnfolderBase]: 1957/3008 cut-off events. [2025-01-09 16:46:26,941 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2025-01-09 16:46:26,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6593 conditions, 3008 events. 1957/3008 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14647 event pairs, 73 based on Foata normal form. 1/2942 useless extension candidates. Maximal degree in co-relation 6585. Up to 1861 conditions per place. [2025-01-09 16:46:26,960 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 102 selfloop transitions, 27 changer transitions 3/137 dead transitions. [2025-01-09 16:46:26,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 137 transitions, 645 flow [2025-01-09 16:46:26,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:46:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:46:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 227 transitions. [2025-01-09 16:46:26,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4503968253968254 [2025-01-09 16:46:26,966 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 108 flow. Second operand 12 states and 227 transitions. [2025-01-09 16:46:26,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 137 transitions, 645 flow [2025-01-09 16:46:26,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 137 transitions, 641 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:46:26,970 INFO L231 Difference]: Finished difference. Result has 59 places, 63 transitions, 256 flow [2025-01-09 16:46:26,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=256, PETRI_PLACES=59, PETRI_TRANSITIONS=63} [2025-01-09 16:46:26,972 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2025-01-09 16:46:26,972 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 256 flow [2025-01-09 16:46:26,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:26,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:26,973 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-01-09 16:46:26,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:46:26,973 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-01-09 16:46:26,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:26,974 INFO L85 PathProgramCache]: Analyzing trace with hash 944375756, now seen corresponding path program 2 times [2025-01-09 16:46:26,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:26,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338162074] [2025-01-09 16:46:26,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:26,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:26,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:26,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:46:26,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:46:26,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:27,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:27,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338162074] [2025-01-09 16:46:27,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338162074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:27,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:27,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:46:27,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114185108] [2025-01-09 16:46:27,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:27,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:46:27,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:27,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:46:27,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:46:27,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-01-09 16:46:27,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:27,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:27,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-01-09 16:46:27,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:27,337 INFO L124 PetriNetUnfolderBase]: 1549/2450 cut-off events. [2025-01-09 16:46:27,337 INFO L125 PetriNetUnfolderBase]: For 1588/1609 co-relation queries the response was YES. [2025-01-09 16:46:27,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6658 conditions, 2450 events. 1549/2450 cut-off events. For 1588/1609 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11681 event pairs, 395 based on Foata normal form. 47/2430 useless extension candidates. Maximal degree in co-relation 6644. Up to 1926 conditions per place. [2025-01-09 16:46:27,356 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 69 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2025-01-09 16:46:27,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 458 flow [2025-01-09 16:46:27,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:46:27,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:46:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-01-09 16:46:27,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2025-01-09 16:46:27,360 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 256 flow. Second operand 3 states and 71 transitions. [2025-01-09 16:46:27,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 458 flow [2025-01-09 16:46:27,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 79 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:46:27,367 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 272 flow [2025-01-09 16:46:27,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2025-01-09 16:46:27,368 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2025-01-09 16:46:27,370 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 272 flow [2025-01-09 16:46:27,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:27,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:27,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:27,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:46:27,371 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-01-09 16:46:27,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:27,373 INFO L85 PathProgramCache]: Analyzing trace with hash -786021930, now seen corresponding path program 3 times [2025-01-09 16:46:27,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:27,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076930452] [2025-01-09 16:46:27,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:27,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:27,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:27,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:46:27,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:46:27,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:27,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-01-09 16:46:27,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:27,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076930452] [2025-01-09 16:46:27,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076930452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:27,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:27,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:46:27,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006098254] [2025-01-09 16:46:27,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:27,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:46:27,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:27,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:46:27,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:46:27,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-01-09 16:46:27,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:27,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:27,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-01-09 16:46:27,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:27,670 INFO L124 PetriNetUnfolderBase]: 1191/1960 cut-off events. [2025-01-09 16:46:27,670 INFO L125 PetriNetUnfolderBase]: For 1895/1896 co-relation queries the response was YES. [2025-01-09 16:46:27,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5676 conditions, 1960 events. 1191/1960 cut-off events. For 1895/1896 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9319 event pairs, 430 based on Foata normal form. 86/1995 useless extension candidates. Maximal degree in co-relation 5660. Up to 1183 conditions per place. [2025-01-09 16:46:27,700 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 70 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2025-01-09 16:46:27,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 482 flow [2025-01-09 16:46:27,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:46:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:46:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-01-09 16:46:27,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-01-09 16:46:27,703 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 272 flow. Second operand 3 states and 70 transitions. [2025-01-09 16:46:27,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 482 flow [2025-01-09 16:46:27,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 459 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-01-09 16:46:27,711 INFO L231 Difference]: Finished difference. Result has 60 places, 63 transitions, 260 flow [2025-01-09 16:46:27,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=60, PETRI_TRANSITIONS=63} [2025-01-09 16:46:27,712 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2025-01-09 16:46:27,713 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 63 transitions, 260 flow [2025-01-09 16:46:27,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:27,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:27,713 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-01-09 16:46:27,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:46:27,714 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-01-09 16:46:27,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:27,714 INFO L85 PathProgramCache]: Analyzing trace with hash 66321450, now seen corresponding path program 4 times [2025-01-09 16:46:27,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:27,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826247784] [2025-01-09 16:46:27,715 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:46:27,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:27,724 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:27,752 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:46:27,753 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:46:27,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:28,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:28,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826247784] [2025-01-09 16:46:28,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826247784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:28,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:28,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:28,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267027725] [2025-01-09 16:46:28,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:28,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:28,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:28,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:28,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:28,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-01-09 16:46:28,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 63 transitions, 260 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:28,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:28,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-01-09 16:46:28,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:29,060 INFO L124 PetriNetUnfolderBase]: 1610/2584 cut-off events. [2025-01-09 16:46:29,060 INFO L125 PetriNetUnfolderBase]: For 1955/1955 co-relation queries the response was YES. [2025-01-09 16:46:29,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7299 conditions, 2584 events. 1610/2584 cut-off events. For 1955/1955 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12975 event pairs, 350 based on Foata normal form. 1/2518 useless extension candidates. Maximal degree in co-relation 7284. Up to 1964 conditions per place. [2025-01-09 16:46:29,077 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 95 selfloop transitions, 28 changer transitions 3/130 dead transitions. [2025-01-09 16:46:29,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 130 transitions, 782 flow [2025-01-09 16:46:29,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions. [2025-01-09 16:46:29,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4025974025974026 [2025-01-09 16:46:29,079 INFO L175 Difference]: Start difference. First operand has 60 places, 63 transitions, 260 flow. Second operand 11 states and 186 transitions. [2025-01-09 16:46:29,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 130 transitions, 782 flow [2025-01-09 16:46:29,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 130 transitions, 763 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 16:46:29,084 INFO L231 Difference]: Finished difference. Result has 73 places, 78 transitions, 418 flow [2025-01-09 16:46:29,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=418, PETRI_PLACES=73, PETRI_TRANSITIONS=78} [2025-01-09 16:46:29,085 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2025-01-09 16:46:29,085 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 78 transitions, 418 flow [2025-01-09 16:46:29,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:29,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:29,085 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-01-09 16:46:29,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:46:29,086 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-01-09 16:46:29,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1935732930, now seen corresponding path program 5 times [2025-01-09 16:46:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980371176] [2025-01-09 16:46:29,086 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:46:29,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:29,096 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:29,124 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:46:29,124 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:29,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:29,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:29,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980371176] [2025-01-09 16:46:29,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980371176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:29,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:29,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:29,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641165288] [2025-01-09 16:46:29,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:29,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:29,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:29,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:29,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:29,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:29,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 78 transitions, 418 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:29,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:29,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:29,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:30,452 INFO L124 PetriNetUnfolderBase]: 1516/2485 cut-off events. [2025-01-09 16:46:30,452 INFO L125 PetriNetUnfolderBase]: For 3117/3117 co-relation queries the response was YES. [2025-01-09 16:46:30,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7583 conditions, 2485 events. 1516/2485 cut-off events. For 3117/3117 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 12534 event pairs, 391 based on Foata normal form. 1/2421 useless extension candidates. Maximal degree in co-relation 7564. Up to 1821 conditions per place. [2025-01-09 16:46:30,475 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 104 selfloop transitions, 34 changer transitions 3/146 dead transitions. [2025-01-09 16:46:30,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 146 transitions, 1004 flow [2025-01-09 16:46:30,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-01-09 16:46:30,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2025-01-09 16:46:30,478 INFO L175 Difference]: Start difference. First operand has 73 places, 78 transitions, 418 flow. Second operand 11 states and 202 transitions. [2025-01-09 16:46:30,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 146 transitions, 1004 flow [2025-01-09 16:46:30,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 146 transitions, 971 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-01-09 16:46:30,490 INFO L231 Difference]: Finished difference. Result has 88 places, 92 transitions, 615 flow [2025-01-09 16:46:30,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=615, PETRI_PLACES=88, PETRI_TRANSITIONS=92} [2025-01-09 16:46:30,492 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2025-01-09 16:46:30,492 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 92 transitions, 615 flow [2025-01-09 16:46:30,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:30,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:30,493 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-01-09 16:46:30,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:46:30,494 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-01-09 16:46:30,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:30,496 INFO L85 PathProgramCache]: Analyzing trace with hash -542391498, now seen corresponding path program 6 times [2025-01-09 16:46:30,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:30,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244593974] [2025-01-09 16:46:30,496 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:46:30,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:30,513 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:30,537 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:46:30,540 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:46:30,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:31,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:31,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244593974] [2025-01-09 16:46:31,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244593974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:31,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:31,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:31,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181809349] [2025-01-09 16:46:31,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:31,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:31,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:31,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:31,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:31,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:31,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 92 transitions, 615 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:31,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:31,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:31,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:31,952 INFO L124 PetriNetUnfolderBase]: 1683/2795 cut-off events. [2025-01-09 16:46:31,953 INFO L125 PetriNetUnfolderBase]: For 6151/6151 co-relation queries the response was YES. [2025-01-09 16:46:31,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9448 conditions, 2795 events. 1683/2795 cut-off events. For 6151/6151 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14903 event pairs, 305 based on Foata normal form. 1/2713 useless extension candidates. Maximal degree in co-relation 9421. Up to 1830 conditions per place. [2025-01-09 16:46:31,974 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 118 selfloop transitions, 45 changer transitions 3/171 dead transitions. [2025-01-09 16:46:31,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 171 transitions, 1292 flow [2025-01-09 16:46:31,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:46:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:46:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions. [2025-01-09 16:46:31,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2025-01-09 16:46:31,978 INFO L175 Difference]: Start difference. First operand has 88 places, 92 transitions, 615 flow. Second operand 12 states and 225 transitions. [2025-01-09 16:46:31,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 171 transitions, 1292 flow [2025-01-09 16:46:31,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 171 transitions, 1260 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-01-09 16:46:31,997 INFO L231 Difference]: Finished difference. Result has 101 places, 101 transitions, 772 flow [2025-01-09 16:46:31,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=772, PETRI_PLACES=101, PETRI_TRANSITIONS=101} [2025-01-09 16:46:32,000 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2025-01-09 16:46:32,000 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 101 transitions, 772 flow [2025-01-09 16:46:32,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:32,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:32,001 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-01-09 16:46:32,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:46:32,001 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-01-09 16:46:32,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:32,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1451070638, now seen corresponding path program 7 times [2025-01-09 16:46:32,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:32,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097977786] [2025-01-09 16:46:32,003 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:46:32,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:32,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:46:32,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:46:32,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:32,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:32,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:32,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097977786] [2025-01-09 16:46:32,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097977786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:32,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:32,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:32,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18270254] [2025-01-09 16:46:32,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:32,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:32,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:32,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:32,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:32,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:32,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 101 transitions, 772 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:32,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:32,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:32,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:33,329 INFO L124 PetriNetUnfolderBase]: 1787/2998 cut-off events. [2025-01-09 16:46:33,329 INFO L125 PetriNetUnfolderBase]: For 9036/9036 co-relation queries the response was YES. [2025-01-09 16:46:33,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10795 conditions, 2998 events. 1787/2998 cut-off events. For 9036/9036 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 16531 event pairs, 403 based on Foata normal form. 1/2911 useless extension candidates. Maximal degree in co-relation 10764. Up to 2167 conditions per place. [2025-01-09 16:46:33,353 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 125 selfloop transitions, 41 changer transitions 3/174 dead transitions. [2025-01-09 16:46:33,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 174 transitions, 1453 flow [2025-01-09 16:46:33,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:46:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:46:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 221 transitions. [2025-01-09 16:46:33,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4384920634920635 [2025-01-09 16:46:33,355 INFO L175 Difference]: Start difference. First operand has 101 places, 101 transitions, 772 flow. Second operand 12 states and 221 transitions. [2025-01-09 16:46:33,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 174 transitions, 1453 flow [2025-01-09 16:46:33,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 174 transitions, 1362 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-01-09 16:46:33,405 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 854 flow [2025-01-09 16:46:33,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=854, PETRI_PLACES=109, PETRI_TRANSITIONS=107} [2025-01-09 16:46:33,405 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2025-01-09 16:46:33,405 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 854 flow [2025-01-09 16:46:33,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:33,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:33,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:33,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:46:33,406 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-01-09 16:46:33,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:33,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1763147920, now seen corresponding path program 8 times [2025-01-09 16:46:33,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:33,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067948893] [2025-01-09 16:46:33,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:33,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:33,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:33,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:46:33,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:46:33,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:33,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:33,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067948893] [2025-01-09 16:46:33,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067948893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:33,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:33,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:33,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586322055] [2025-01-09 16:46:33,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:33,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:33,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:33,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:33,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:33,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:33,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 854 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:33,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:33,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:33,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:34,671 INFO L124 PetriNetUnfolderBase]: 1787/2996 cut-off events. [2025-01-09 16:46:34,672 INFO L125 PetriNetUnfolderBase]: For 10890/10890 co-relation queries the response was YES. [2025-01-09 16:46:34,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11130 conditions, 2996 events. 1787/2996 cut-off events. For 10890/10890 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 16495 event pairs, 423 based on Foata normal form. 1/2909 useless extension candidates. Maximal degree in co-relation 11095. Up to 2251 conditions per place. [2025-01-09 16:46:34,694 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 121 selfloop transitions, 40 changer transitions 3/169 dead transitions. [2025-01-09 16:46:34,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 169 transitions, 1472 flow [2025-01-09 16:46:34,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:46:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:46:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 212 transitions. [2025-01-09 16:46:34,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2025-01-09 16:46:34,697 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 854 flow. Second operand 12 states and 212 transitions. [2025-01-09 16:46:34,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 169 transitions, 1472 flow [2025-01-09 16:46:34,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 169 transitions, 1361 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-01-09 16:46:34,719 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 874 flow [2025-01-09 16:46:34,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=874, PETRI_PLACES=115, PETRI_TRANSITIONS=110} [2025-01-09 16:46:34,720 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2025-01-09 16:46:34,720 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 874 flow [2025-01-09 16:46:34,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:34,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:34,720 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-01-09 16:46:34,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:46:34,721 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-01-09 16:46:34,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:34,722 INFO L85 PathProgramCache]: Analyzing trace with hash 856755046, now seen corresponding path program 9 times [2025-01-09 16:46:34,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:34,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036482069] [2025-01-09 16:46:34,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:34,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:34,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:34,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:46:34,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:46:34,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:35,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:35,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036482069] [2025-01-09 16:46:35,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036482069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:35,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:35,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:35,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287770239] [2025-01-09 16:46:35,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:35,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:35,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:35,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:35,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:35,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:35,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 874 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:35,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:35,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:35,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:36,075 INFO L124 PetriNetUnfolderBase]: 1924/3235 cut-off events. [2025-01-09 16:46:36,076 INFO L125 PetriNetUnfolderBase]: For 11848/11848 co-relation queries the response was YES. [2025-01-09 16:46:36,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12029 conditions, 3235 events. 1924/3235 cut-off events. For 11848/11848 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 18317 event pairs, 554 based on Foata normal form. 1/3140 useless extension candidates. Maximal degree in co-relation 11991. Up to 2518 conditions per place. [2025-01-09 16:46:36,099 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 129 selfloop transitions, 36 changer transitions 3/173 dead transitions. [2025-01-09 16:46:36,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 173 transitions, 1573 flow [2025-01-09 16:46:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2025-01-09 16:46:36,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-01-09 16:46:36,102 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 874 flow. Second operand 11 states and 198 transitions. [2025-01-09 16:46:36,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 173 transitions, 1573 flow [2025-01-09 16:46:36,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 173 transitions, 1479 flow, removed 9 selfloop flow, removed 9 redundant places. [2025-01-09 16:46:36,126 INFO L231 Difference]: Finished difference. Result has 120 places, 119 transitions, 1005 flow [2025-01-09 16:46:36,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1005, PETRI_PLACES=120, PETRI_TRANSITIONS=119} [2025-01-09 16:46:36,126 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 79 predicate places. [2025-01-09 16:46:36,127 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 119 transitions, 1005 flow [2025-01-09 16:46:36,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:36,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:36,127 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-01-09 16:46:36,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:46:36,127 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-01-09 16:46:36,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:36,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1967026124, now seen corresponding path program 10 times [2025-01-09 16:46:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:36,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489859501] [2025-01-09 16:46:36,128 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:46:36,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:36,141 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:36,159 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:46:36,159 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:46:36,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:36,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:36,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489859501] [2025-01-09 16:46:36,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489859501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:36,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:36,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:36,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298628169] [2025-01-09 16:46:36,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:36,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:36,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:36,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:36,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:36,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-01-09 16:46:36,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 1005 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:36,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:36,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-01-09 16:46:36,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:37,431 INFO L124 PetriNetUnfolderBase]: 2254/3734 cut-off events. [2025-01-09 16:46:37,431 INFO L125 PetriNetUnfolderBase]: For 20809/20809 co-relation queries the response was YES. [2025-01-09 16:46:37,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14758 conditions, 3734 events. 2254/3734 cut-off events. For 20809/20809 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 21448 event pairs, 719 based on Foata normal form. 1/3637 useless extension candidates. Maximal degree in co-relation 14716. Up to 2964 conditions per place. [2025-01-09 16:46:37,457 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 142 selfloop transitions, 36 changer transitions 3/185 dead transitions. [2025-01-09 16:46:37,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 185 transitions, 1768 flow [2025-01-09 16:46:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2025-01-09 16:46:37,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4134199134199134 [2025-01-09 16:46:37,459 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 1005 flow. Second operand 11 states and 191 transitions. [2025-01-09 16:46:37,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 185 transitions, 1768 flow [2025-01-09 16:46:37,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 185 transitions, 1650 flow, removed 42 selfloop flow, removed 5 redundant places. [2025-01-09 16:46:37,504 INFO L231 Difference]: Finished difference. Result has 128 places, 128 transitions, 1097 flow [2025-01-09 16:46:37,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1097, PETRI_PLACES=128, PETRI_TRANSITIONS=128} [2025-01-09 16:46:37,505 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 87 predicate places. [2025-01-09 16:46:37,505 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 128 transitions, 1097 flow [2025-01-09 16:46:37,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:37,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:37,506 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-01-09 16:46:37,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:46:37,506 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-01-09 16:46:37,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:37,506 INFO L85 PathProgramCache]: Analyzing trace with hash 149028558, now seen corresponding path program 11 times [2025-01-09 16:46:37,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:37,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549836140] [2025-01-09 16:46:37,507 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:46:37,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:37,514 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:37,529 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:46:37,530 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:37,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:38,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:38,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549836140] [2025-01-09 16:46:38,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549836140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:38,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:38,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:38,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211835575] [2025-01-09 16:46:38,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:38,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:38,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:38,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:38,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:38,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:38,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 128 transitions, 1097 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:38,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:38,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:38,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:38,789 INFO L124 PetriNetUnfolderBase]: 2222/3730 cut-off events. [2025-01-09 16:46:38,789 INFO L125 PetriNetUnfolderBase]: For 25566/25566 co-relation queries the response was YES. [2025-01-09 16:46:38,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15571 conditions, 3730 events. 2222/3730 cut-off events. For 25566/25566 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 22099 event pairs, 675 based on Foata normal form. 1/3630 useless extension candidates. Maximal degree in co-relation 15525. Up to 2931 conditions per place. [2025-01-09 16:46:38,806 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 148 selfloop transitions, 37 changer transitions 3/193 dead transitions. [2025-01-09 16:46:38,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 193 transitions, 1905 flow [2025-01-09 16:46:38,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2025-01-09 16:46:38,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-01-09 16:46:38,808 INFO L175 Difference]: Start difference. First operand has 128 places, 128 transitions, 1097 flow. Second operand 11 states and 203 transitions. [2025-01-09 16:46:38,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 193 transitions, 1905 flow [2025-01-09 16:46:38,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 193 transitions, 1779 flow, removed 46 selfloop flow, removed 5 redundant places. [2025-01-09 16:46:38,847 INFO L231 Difference]: Finished difference. Result has 136 places, 135 transitions, 1197 flow [2025-01-09 16:46:38,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1197, PETRI_PLACES=136, PETRI_TRANSITIONS=135} [2025-01-09 16:46:38,848 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 95 predicate places. [2025-01-09 16:46:38,848 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 135 transitions, 1197 flow [2025-01-09 16:46:38,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:38,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:38,849 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-01-09 16:46:38,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:46:38,849 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-01-09 16:46:38,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:38,850 INFO L85 PathProgramCache]: Analyzing trace with hash -646938794, now seen corresponding path program 12 times [2025-01-09 16:46:38,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:38,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489460570] [2025-01-09 16:46:38,850 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:46:38,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:38,858 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:38,873 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:46:38,873 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:46:38,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:39,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:39,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489460570] [2025-01-09 16:46:39,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489460570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:39,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:39,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:39,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91426706] [2025-01-09 16:46:39,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:39,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:39,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:39,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:39,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:39,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:39,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 135 transitions, 1197 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:39,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:39,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:39,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:39,933 INFO L124 PetriNetUnfolderBase]: 2283/3844 cut-off events. [2025-01-09 16:46:39,934 INFO L125 PetriNetUnfolderBase]: For 29917/29917 co-relation queries the response was YES. [2025-01-09 16:46:39,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16381 conditions, 3844 events. 2283/3844 cut-off events. For 29917/29917 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 22862 event pairs, 769 based on Foata normal form. 1/3743 useless extension candidates. Maximal degree in co-relation 16331. Up to 3170 conditions per place. [2025-01-09 16:46:39,961 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 142 selfloop transitions, 36 changer transitions 4/187 dead transitions. [2025-01-09 16:46:39,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 187 transitions, 1855 flow [2025-01-09 16:46:39,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2025-01-09 16:46:39,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2025-01-09 16:46:39,963 INFO L175 Difference]: Start difference. First operand has 136 places, 135 transitions, 1197 flow. Second operand 11 states and 190 transitions. [2025-01-09 16:46:39,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 187 transitions, 1855 flow [2025-01-09 16:46:40,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 187 transitions, 1723 flow, removed 47 selfloop flow, removed 6 redundant places. [2025-01-09 16:46:40,005 INFO L231 Difference]: Finished difference. Result has 143 places, 141 transitions, 1232 flow [2025-01-09 16:46:40,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1232, PETRI_PLACES=143, PETRI_TRANSITIONS=141} [2025-01-09 16:46:40,005 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 102 predicate places. [2025-01-09 16:46:40,005 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 141 transitions, 1232 flow [2025-01-09 16:46:40,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:40,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:40,006 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-01-09 16:46:40,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:46:40,006 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-01-09 16:46:40,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:40,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1214557324, now seen corresponding path program 13 times [2025-01-09 16:46:40,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:40,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120526982] [2025-01-09 16:46:40,007 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:46:40,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:40,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:46:40,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:46:40,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:40,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:40,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:40,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120526982] [2025-01-09 16:46:40,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120526982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:40,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:40,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:40,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888435098] [2025-01-09 16:46:40,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:40,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:40,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:40,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:40,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:40,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:40,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 141 transitions, 1232 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:40,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:40,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:40,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:41,173 INFO L124 PetriNetUnfolderBase]: 2434/4088 cut-off events. [2025-01-09 16:46:41,173 INFO L125 PetriNetUnfolderBase]: For 31477/31477 co-relation queries the response was YES. [2025-01-09 16:46:41,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17437 conditions, 4088 events. 2434/4088 cut-off events. For 31477/31477 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 24700 event pairs, 795 based on Foata normal form. 1/3991 useless extension candidates. Maximal degree in co-relation 17383. Up to 3194 conditions per place. [2025-01-09 16:46:41,195 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 153 selfloop transitions, 42 changer transitions 3/203 dead transitions. [2025-01-09 16:46:41,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 203 transitions, 2070 flow [2025-01-09 16:46:41,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:41,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2025-01-09 16:46:41,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43506493506493504 [2025-01-09 16:46:41,197 INFO L175 Difference]: Start difference. First operand has 143 places, 141 transitions, 1232 flow. Second operand 11 states and 201 transitions. [2025-01-09 16:46:41,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 203 transitions, 2070 flow [2025-01-09 16:46:41,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 203 transitions, 1962 flow, removed 34 selfloop flow, removed 6 redundant places. [2025-01-09 16:46:41,258 INFO L231 Difference]: Finished difference. Result has 150 places, 148 transitions, 1393 flow [2025-01-09 16:46:41,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1393, PETRI_PLACES=150, PETRI_TRANSITIONS=148} [2025-01-09 16:46:41,258 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 109 predicate places. [2025-01-09 16:46:41,259 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 148 transitions, 1393 flow [2025-01-09 16:46:41,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:41,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:41,259 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-01-09 16:46:41,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:46:41,259 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-01-09 16:46:41,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:41,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2030787744, now seen corresponding path program 14 times [2025-01-09 16:46:41,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:41,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712745641] [2025-01-09 16:46:41,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:41,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:41,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:41,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:46:41,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:46:41,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:41,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:41,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712745641] [2025-01-09 16:46:41,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712745641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:41,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:41,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:41,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546631865] [2025-01-09 16:46:41,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:41,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:41,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:41,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:41,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:41,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:41,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 148 transitions, 1393 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:41,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:41,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:41,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:42,352 INFO L124 PetriNetUnfolderBase]: 2434/4080 cut-off events. [2025-01-09 16:46:42,352 INFO L125 PetriNetUnfolderBase]: For 37241/37241 co-relation queries the response was YES. [2025-01-09 16:46:42,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18067 conditions, 4080 events. 2434/4080 cut-off events. For 37241/37241 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 24733 event pairs, 832 based on Foata normal form. 1/3986 useless extension candidates. Maximal degree in co-relation 18009. Up to 3352 conditions per place. [2025-01-09 16:46:42,380 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 158 selfloop transitions, 37 changer transitions 4/204 dead transitions. [2025-01-09 16:46:42,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 204 transitions, 2118 flow [2025-01-09 16:46:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2025-01-09 16:46:42,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4264069264069264 [2025-01-09 16:46:42,381 INFO L175 Difference]: Start difference. First operand has 150 places, 148 transitions, 1393 flow. Second operand 11 states and 197 transitions. [2025-01-09 16:46:42,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 204 transitions, 2118 flow [2025-01-09 16:46:42,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 204 transitions, 1960 flow, removed 59 selfloop flow, removed 6 redundant places. [2025-01-09 16:46:42,443 INFO L231 Difference]: Finished difference. Result has 156 places, 152 transitions, 1362 flow [2025-01-09 16:46:42,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1362, PETRI_PLACES=156, PETRI_TRANSITIONS=152} [2025-01-09 16:46:42,443 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 115 predicate places. [2025-01-09 16:46:42,443 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 152 transitions, 1362 flow [2025-01-09 16:46:42,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:42,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:42,444 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-01-09 16:46:42,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:46:42,444 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-01-09 16:46:42,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:42,444 INFO L85 PathProgramCache]: Analyzing trace with hash -159696156, now seen corresponding path program 15 times [2025-01-09 16:46:42,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:42,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353915802] [2025-01-09 16:46:42,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:42,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:42,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:42,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:46:42,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:46:42,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:42,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:42,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353915802] [2025-01-09 16:46:42,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353915802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:42,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:42,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:42,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035674475] [2025-01-09 16:46:42,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:42,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:42,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:42,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:42,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:42,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:42,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 152 transitions, 1362 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:42,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:42,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:42,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:43,553 INFO L124 PetriNetUnfolderBase]: 2470/4155 cut-off events. [2025-01-09 16:46:43,553 INFO L125 PetriNetUnfolderBase]: For 32992/32992 co-relation queries the response was YES. [2025-01-09 16:46:43,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17795 conditions, 4155 events. 2470/4155 cut-off events. For 32992/32992 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 25432 event pairs, 877 based on Foata normal form. 1/4058 useless extension candidates. Maximal degree in co-relation 17734. Up to 3497 conditions per place. [2025-01-09 16:46:43,574 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 155 selfloop transitions, 35 changer transitions 3/198 dead transitions. [2025-01-09 16:46:43,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 198 transitions, 1979 flow [2025-01-09 16:46:43,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2025-01-09 16:46:43,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-01-09 16:46:43,575 INFO L175 Difference]: Start difference. First operand has 156 places, 152 transitions, 1362 flow. Second operand 11 states and 187 transitions. [2025-01-09 16:46:43,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 198 transitions, 1979 flow [2025-01-09 16:46:43,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 198 transitions, 1873 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-01-09 16:46:43,610 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 1347 flow [2025-01-09 16:46:43,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1347, PETRI_PLACES=160, PETRI_TRANSITIONS=154} [2025-01-09 16:46:43,611 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 119 predicate places. [2025-01-09 16:46:43,611 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 1347 flow [2025-01-09 16:46:43,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:43,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:43,611 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-01-09 16:46:43,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 16:46:43,611 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-01-09 16:46:43,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:43,612 INFO L85 PathProgramCache]: Analyzing trace with hash 716935446, now seen corresponding path program 16 times [2025-01-09 16:46:43,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:43,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614231707] [2025-01-09 16:46:43,612 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:46:43,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:43,619 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:43,637 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:46:43,638 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:46:43,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:44,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:44,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614231707] [2025-01-09 16:46:44,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614231707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:44,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:44,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:44,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386690871] [2025-01-09 16:46:44,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:44,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:44,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:44,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:44,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:44,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-01-09 16:46:44,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 154 transitions, 1347 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:44,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:44,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-01-09 16:46:44,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:44,664 INFO L124 PetriNetUnfolderBase]: 2668/4423 cut-off events. [2025-01-09 16:46:44,664 INFO L125 PetriNetUnfolderBase]: For 34730/34730 co-relation queries the response was YES. [2025-01-09 16:46:44,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18730 conditions, 4423 events. 2668/4423 cut-off events. For 34730/34730 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 26651 event pairs, 985 based on Foata normal form. 1/4321 useless extension candidates. Maximal degree in co-relation 18667. Up to 3724 conditions per place. [2025-01-09 16:46:44,693 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 159 selfloop transitions, 38 changer transitions 3/204 dead transitions. [2025-01-09 16:46:44,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 204 transitions, 2015 flow [2025-01-09 16:46:44,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:44,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2025-01-09 16:46:44,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3917748917748918 [2025-01-09 16:46:44,694 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 1347 flow. Second operand 11 states and 181 transitions. [2025-01-09 16:46:44,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 204 transitions, 2015 flow [2025-01-09 16:46:44,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 204 transitions, 1949 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 16:46:44,751 INFO L231 Difference]: Finished difference. Result has 164 places, 157 transitions, 1412 flow [2025-01-09 16:46:44,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1281, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1412, PETRI_PLACES=164, PETRI_TRANSITIONS=157} [2025-01-09 16:46:44,752 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 123 predicate places. [2025-01-09 16:46:44,752 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 157 transitions, 1412 flow [2025-01-09 16:46:44,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:44,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:44,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:44,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 16:46:44,752 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-01-09 16:46:44,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:44,753 INFO L85 PathProgramCache]: Analyzing trace with hash -832576884, now seen corresponding path program 17 times [2025-01-09 16:46:44,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:44,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093475503] [2025-01-09 16:46:44,753 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:46:44,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:44,760 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:44,773 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:46:44,773 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:44,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:45,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:45,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:45,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093475503] [2025-01-09 16:46:45,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093475503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:45,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:45,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:45,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970484955] [2025-01-09 16:46:45,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:45,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:45,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:45,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:45,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:45,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:45,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 157 transitions, 1412 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:45,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:45,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:45,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:45,750 INFO L124 PetriNetUnfolderBase]: 2470/4163 cut-off events. [2025-01-09 16:46:45,750 INFO L125 PetriNetUnfolderBase]: For 32928/32928 co-relation queries the response was YES. [2025-01-09 16:46:45,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17746 conditions, 4163 events. 2470/4163 cut-off events. For 32928/32928 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 25390 event pairs, 853 based on Foata normal form. 1/4060 useless extension candidates. Maximal degree in co-relation 17681. Up to 3416 conditions per place. [2025-01-09 16:46:45,782 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 161 selfloop transitions, 41 changer transitions 4/211 dead transitions. [2025-01-09 16:46:45,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 211 transitions, 2117 flow [2025-01-09 16:46:45,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2025-01-09 16:46:45,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-01-09 16:46:45,783 INFO L175 Difference]: Start difference. First operand has 164 places, 157 transitions, 1412 flow. Second operand 11 states and 196 transitions. [2025-01-09 16:46:45,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 211 transitions, 2117 flow [2025-01-09 16:46:45,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 211 transitions, 2007 flow, removed 19 selfloop flow, removed 8 redundant places. [2025-01-09 16:46:45,818 INFO L231 Difference]: Finished difference. Result has 168 places, 161 transitions, 1450 flow [2025-01-09 16:46:45,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1450, PETRI_PLACES=168, PETRI_TRANSITIONS=161} [2025-01-09 16:46:45,818 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 127 predicate places. [2025-01-09 16:46:45,819 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 161 transitions, 1450 flow [2025-01-09 16:46:45,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:45,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:45,819 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-01-09 16:46:45,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 16:46:45,819 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-01-09 16:46:45,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:45,819 INFO L85 PathProgramCache]: Analyzing trace with hash 370916714, now seen corresponding path program 18 times [2025-01-09 16:46:45,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:45,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115010976] [2025-01-09 16:46:45,819 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:46:45,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:45,824 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:45,835 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:46:45,835 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:46:45,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:46,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:46,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115010976] [2025-01-09 16:46:46,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115010976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:46,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:46,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:46,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712469922] [2025-01-09 16:46:46,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:46,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:46,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:46,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:46,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:46,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:46,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 161 transitions, 1450 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:46,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:46,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:46,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:47,192 INFO L124 PetriNetUnfolderBase]: 2709/4568 cut-off events. [2025-01-09 16:46:47,192 INFO L125 PetriNetUnfolderBase]: For 43855/43855 co-relation queries the response was YES. [2025-01-09 16:46:47,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20410 conditions, 4568 events. 2709/4568 cut-off events. For 43855/43855 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 28607 event pairs, 928 based on Foata normal form. 1/4464 useless extension candidates. Maximal degree in co-relation 20343. Up to 3530 conditions per place. [2025-01-09 16:46:47,225 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 189 selfloop transitions, 44 changer transitions 3/241 dead transitions. [2025-01-09 16:46:47,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 241 transitions, 2547 flow [2025-01-09 16:46:47,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:46:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:46:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 223 transitions. [2025-01-09 16:46:47,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44246031746031744 [2025-01-09 16:46:47,227 INFO L175 Difference]: Start difference. First operand has 168 places, 161 transitions, 1450 flow. Second operand 12 states and 223 transitions. [2025-01-09 16:46:47,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 241 transitions, 2547 flow [2025-01-09 16:46:47,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 241 transitions, 2421 flow, removed 24 selfloop flow, removed 8 redundant places. [2025-01-09 16:46:47,310 INFO L231 Difference]: Finished difference. Result has 175 places, 173 transitions, 1663 flow [2025-01-09 16:46:47,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1663, PETRI_PLACES=175, PETRI_TRANSITIONS=173} [2025-01-09 16:46:47,311 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 134 predicate places. [2025-01-09 16:46:47,311 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 173 transitions, 1663 flow [2025-01-09 16:46:47,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:47,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:47,311 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-01-09 16:46:47,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 16:46:47,311 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-01-09 16:46:47,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1397043254, now seen corresponding path program 19 times [2025-01-09 16:46:47,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:47,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331966619] [2025-01-09 16:46:47,312 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:46:47,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:47,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:46:47,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:46:47,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:47,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:47,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:47,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331966619] [2025-01-09 16:46:47,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331966619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:47,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:47,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:47,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962546019] [2025-01-09 16:46:47,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:47,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:47,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:47,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:47,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:47,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:47,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 173 transitions, 1663 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:47,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:47,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:47,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:48,488 INFO L124 PetriNetUnfolderBase]: 2908/4911 cut-off events. [2025-01-09 16:46:48,489 INFO L125 PetriNetUnfolderBase]: For 58161/58161 co-relation queries the response was YES. [2025-01-09 16:46:48,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23123 conditions, 4911 events. 2908/4911 cut-off events. For 58161/58161 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 31404 event pairs, 939 based on Foata normal form. 1/4802 useless extension candidates. Maximal degree in co-relation 23052. Up to 3717 conditions per place. [2025-01-09 16:46:48,522 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 187 selfloop transitions, 54 changer transitions 3/249 dead transitions. [2025-01-09 16:46:48,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 249 transitions, 2832 flow [2025-01-09 16:46:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:46:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:46:48,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 222 transitions. [2025-01-09 16:46:48,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2025-01-09 16:46:48,524 INFO L175 Difference]: Start difference. First operand has 175 places, 173 transitions, 1663 flow. Second operand 12 states and 222 transitions. [2025-01-09 16:46:48,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 249 transitions, 2832 flow [2025-01-09 16:46:48,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 249 transitions, 2606 flow, removed 96 selfloop flow, removed 5 redundant places. [2025-01-09 16:46:48,593 INFO L231 Difference]: Finished difference. Result has 185 places, 184 transitions, 1842 flow [2025-01-09 16:46:48,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1842, PETRI_PLACES=185, PETRI_TRANSITIONS=184} [2025-01-09 16:46:48,594 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places. [2025-01-09 16:46:48,594 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 184 transitions, 1842 flow [2025-01-09 16:46:48,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:48,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:48,594 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-01-09 16:46:48,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 16:46:48,594 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-01-09 16:46:48,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:48,595 INFO L85 PathProgramCache]: Analyzing trace with hash 931064006, now seen corresponding path program 20 times [2025-01-09 16:46:48,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:48,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903746320] [2025-01-09 16:46:48,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:48,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:48,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:48,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:46:48,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:46:48,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:49,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:49,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903746320] [2025-01-09 16:46:49,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903746320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:49,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:49,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:49,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497998181] [2025-01-09 16:46:49,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:49,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:49,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:49,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:49,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:49,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:49,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 184 transitions, 1842 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:49,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:49,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:49,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:49,795 INFO L124 PetriNetUnfolderBase]: 3004/5091 cut-off events. [2025-01-09 16:46:49,795 INFO L125 PetriNetUnfolderBase]: For 69507/69507 co-relation queries the response was YES. [2025-01-09 16:46:49,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24643 conditions, 5091 events. 3004/5091 cut-off events. For 69507/69507 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 33327 event pairs, 988 based on Foata normal form. 1/4975 useless extension candidates. Maximal degree in co-relation 24567. Up to 3989 conditions per place. [2025-01-09 16:46:49,831 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 196 selfloop transitions, 49 changer transitions 3/253 dead transitions. [2025-01-09 16:46:49,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 253 transitions, 2900 flow [2025-01-09 16:46:49,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:46:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:46:49,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 219 transitions. [2025-01-09 16:46:49,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2025-01-09 16:46:49,832 INFO L175 Difference]: Start difference. First operand has 185 places, 184 transitions, 1842 flow. Second operand 12 states and 219 transitions. [2025-01-09 16:46:49,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 253 transitions, 2900 flow [2025-01-09 16:46:49,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 253 transitions, 2693 flow, removed 79 selfloop flow, removed 7 redundant places. [2025-01-09 16:46:49,942 INFO L231 Difference]: Finished difference. Result has 192 places, 190 transitions, 1901 flow [2025-01-09 16:46:49,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1901, PETRI_PLACES=192, PETRI_TRANSITIONS=190} [2025-01-09 16:46:49,943 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 151 predicate places. [2025-01-09 16:46:49,943 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 190 transitions, 1901 flow [2025-01-09 16:46:49,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:49,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:49,943 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-01-09 16:46:49,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 16:46:49,943 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-01-09 16:46:49,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:49,944 INFO L85 PathProgramCache]: Analyzing trace with hash -273195236, now seen corresponding path program 21 times [2025-01-09 16:46:49,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:49,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253801816] [2025-01-09 16:46:49,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:49,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:49,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:49,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:46:49,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:46:49,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:50,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:50,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253801816] [2025-01-09 16:46:50,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253801816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:50,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:50,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:50,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145989330] [2025-01-09 16:46:50,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:50,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:50,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:50,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:50,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:50,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:50,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 190 transitions, 1901 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:50,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:50,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:50,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:51,134 INFO L124 PetriNetUnfolderBase]: 3004/5087 cut-off events. [2025-01-09 16:46:51,134 INFO L125 PetriNetUnfolderBase]: For 68879/68879 co-relation queries the response was YES. [2025-01-09 16:46:51,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24498 conditions, 5087 events. 3004/5087 cut-off events. For 68879/68879 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 32937 event pairs, 1066 based on Foata normal form. 1/4976 useless extension candidates. Maximal degree in co-relation 24419. Up to 4066 conditions per place. [2025-01-09 16:46:51,175 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 193 selfloop transitions, 51 changer transitions 4/253 dead transitions. [2025-01-09 16:46:51,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 253 transitions, 2837 flow [2025-01-09 16:46:51,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:46:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:46:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 216 transitions. [2025-01-09 16:46:51,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-01-09 16:46:51,176 INFO L175 Difference]: Start difference. First operand has 192 places, 190 transitions, 1901 flow. Second operand 12 states and 216 transitions. [2025-01-09 16:46:51,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 253 transitions, 2837 flow [2025-01-09 16:46:51,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 253 transitions, 2684 flow, removed 51 selfloop flow, removed 8 redundant places. [2025-01-09 16:46:51,293 INFO L231 Difference]: Finished difference. Result has 197 places, 194 transitions, 1928 flow [2025-01-09 16:46:51,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1748, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1928, PETRI_PLACES=197, PETRI_TRANSITIONS=194} [2025-01-09 16:46:51,293 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 156 predicate places. [2025-01-09 16:46:51,293 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 194 transitions, 1928 flow [2025-01-09 16:46:51,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:51,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:51,294 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-01-09 16:46:51,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 16:46:51,294 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-01-09 16:46:51,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:51,294 INFO L85 PathProgramCache]: Analyzing trace with hash -367101282, now seen corresponding path program 22 times [2025-01-09 16:46:51,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:51,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443044832] [2025-01-09 16:46:51,294 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:46:51,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:51,300 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:51,311 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:46:51,311 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:46:51,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:51,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:51,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:51,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443044832] [2025-01-09 16:46:51,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443044832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:51,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:51,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:51,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676670617] [2025-01-09 16:46:51,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:51,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:51,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:51,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:51,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:51,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-01-09 16:46:51,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 194 transitions, 1928 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:51,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:51,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-01-09 16:46:51,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:52,611 INFO L124 PetriNetUnfolderBase]: 3330/5583 cut-off events. [2025-01-09 16:46:52,611 INFO L125 PetriNetUnfolderBase]: For 77676/77676 co-relation queries the response was YES. [2025-01-09 16:46:52,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27220 conditions, 5583 events. 3330/5583 cut-off events. For 77676/77676 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 36355 event pairs, 1385 based on Foata normal form. 1/5461 useless extension candidates. Maximal degree in co-relation 27139. Up to 4717 conditions per place. [2025-01-09 16:46:52,645 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 216 selfloop transitions, 36 changer transitions 3/259 dead transitions. [2025-01-09 16:46:52,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 259 transitions, 3147 flow [2025-01-09 16:46:52,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-01-09 16:46:52,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2025-01-09 16:46:52,646 INFO L175 Difference]: Start difference. First operand has 197 places, 194 transitions, 1928 flow. Second operand 11 states and 193 transitions. [2025-01-09 16:46:52,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 259 transitions, 3147 flow [2025-01-09 16:46:52,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 259 transitions, 2993 flow, removed 30 selfloop flow, removed 9 redundant places. [2025-01-09 16:46:52,760 INFO L231 Difference]: Finished difference. Result has 202 places, 203 transitions, 2157 flow [2025-01-09 16:46:52,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1780, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2157, PETRI_PLACES=202, PETRI_TRANSITIONS=203} [2025-01-09 16:46:52,760 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 161 predicate places. [2025-01-09 16:46:52,760 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 203 transitions, 2157 flow [2025-01-09 16:46:52,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:52,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:52,761 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-01-09 16:46:52,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 16:46:52,761 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-01-09 16:46:52,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:52,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1207509864, now seen corresponding path program 23 times [2025-01-09 16:46:52,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:52,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222822610] [2025-01-09 16:46:52,761 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:46:52,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:52,768 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:52,777 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:46:52,777 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:52,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:53,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:53,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222822610] [2025-01-09 16:46:53,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222822610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:53,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:53,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:53,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283490782] [2025-01-09 16:46:53,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:53,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:53,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:53,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:53,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:53,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:53,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 203 transitions, 2157 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:53,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:53,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:53,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:54,060 INFO L124 PetriNetUnfolderBase]: 3334/5646 cut-off events. [2025-01-09 16:46:54,060 INFO L125 PetriNetUnfolderBase]: For 103176/103176 co-relation queries the response was YES. [2025-01-09 16:46:54,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29238 conditions, 5646 events. 3334/5646 cut-off events. For 103176/103176 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 37525 event pairs, 1344 based on Foata normal form. 1/5514 useless extension candidates. Maximal degree in co-relation 29153. Up to 4717 conditions per place. [2025-01-09 16:46:54,108 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 226 selfloop transitions, 37 changer transitions 3/271 dead transitions. [2025-01-09 16:46:54,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 271 transitions, 3434 flow [2025-01-09 16:46:54,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions. [2025-01-09 16:46:54,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4458874458874459 [2025-01-09 16:46:54,110 INFO L175 Difference]: Start difference. First operand has 202 places, 203 transitions, 2157 flow. Second operand 11 states and 206 transitions. [2025-01-09 16:46:54,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 271 transitions, 3434 flow [2025-01-09 16:46:54,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 271 transitions, 3140 flow, removed 130 selfloop flow, removed 5 redundant places. [2025-01-09 16:46:54,244 INFO L231 Difference]: Finished difference. Result has 211 places, 213 transitions, 2256 flow [2025-01-09 16:46:54,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2256, PETRI_PLACES=211, PETRI_TRANSITIONS=213} [2025-01-09 16:46:54,245 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 170 predicate places. [2025-01-09 16:46:54,245 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 213 transitions, 2256 flow [2025-01-09 16:46:54,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:54,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:54,245 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-01-09 16:46:54,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 16:46:54,245 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-01-09 16:46:54,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:54,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1870795122, now seen corresponding path program 24 times [2025-01-09 16:46:54,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:54,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621344622] [2025-01-09 16:46:54,246 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:46:54,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:54,252 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:54,262 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:46:54,263 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:46:54,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:54,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:54,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621344622] [2025-01-09 16:46:54,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621344622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:54,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:54,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:54,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004310972] [2025-01-09 16:46:54,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:54,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:54,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:54,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:54,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:54,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:54,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 213 transitions, 2256 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:54,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:54,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:54,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:55,567 INFO L124 PetriNetUnfolderBase]: 3395/5762 cut-off events. [2025-01-09 16:46:55,568 INFO L125 PetriNetUnfolderBase]: For 96279/96279 co-relation queries the response was YES. [2025-01-09 16:46:55,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29275 conditions, 5762 events. 3395/5762 cut-off events. For 96279/96279 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 38869 event pairs, 1402 based on Foata normal form. 1/5628 useless extension candidates. Maximal degree in co-relation 29185. Up to 4956 conditions per place. [2025-01-09 16:46:55,626 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 220 selfloop transitions, 36 changer transitions 4/265 dead transitions. [2025-01-09 16:46:55,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 265 transitions, 3220 flow [2025-01-09 16:46:55,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-01-09 16:46:55,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2025-01-09 16:46:55,628 INFO L175 Difference]: Start difference. First operand has 211 places, 213 transitions, 2256 flow. Second operand 11 states and 193 transitions. [2025-01-09 16:46:55,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 265 transitions, 3220 flow [2025-01-09 16:46:55,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 265 transitions, 3010 flow, removed 88 selfloop flow, removed 5 redundant places. [2025-01-09 16:46:55,761 INFO L231 Difference]: Finished difference. Result has 219 places, 219 transitions, 2257 flow [2025-01-09 16:46:55,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2046, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2257, PETRI_PLACES=219, PETRI_TRANSITIONS=219} [2025-01-09 16:46:55,761 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 178 predicate places. [2025-01-09 16:46:55,761 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 219 transitions, 2257 flow [2025-01-09 16:46:55,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:55,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:55,761 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-01-09 16:46:55,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 16:46:55,762 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-01-09 16:46:55,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash -9299004, now seen corresponding path program 25 times [2025-01-09 16:46:55,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:55,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140028438] [2025-01-09 16:46:55,762 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:46:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:55,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:46:55,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:46:55,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:55,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:56,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:56,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140028438] [2025-01-09 16:46:56,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140028438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:56,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:56,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:56,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992489570] [2025-01-09 16:46:56,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:56,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:56,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:56,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:56,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:56,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:56,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 219 transitions, 2257 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:56,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:56,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:56,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:57,055 INFO L124 PetriNetUnfolderBase]: 3540/5996 cut-off events. [2025-01-09 16:46:57,055 INFO L125 PetriNetUnfolderBase]: For 98717/98717 co-relation queries the response was YES. [2025-01-09 16:46:57,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30287 conditions, 5996 events. 3540/5996 cut-off events. For 98717/98717 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 40522 event pairs, 1442 based on Foata normal form. 1/5868 useless extension candidates. Maximal degree in co-relation 30193. Up to 4980 conditions per place. [2025-01-09 16:46:57,109 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 231 selfloop transitions, 42 changer transitions 3/281 dead transitions. [2025-01-09 16:46:57,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 281 transitions, 3483 flow [2025-01-09 16:46:57,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:57,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2025-01-09 16:46:57,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2025-01-09 16:46:57,110 INFO L175 Difference]: Start difference. First operand has 219 places, 219 transitions, 2257 flow. Second operand 11 states and 204 transitions. [2025-01-09 16:46:57,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 281 transitions, 3483 flow [2025-01-09 16:46:57,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 281 transitions, 3321 flow, removed 61 selfloop flow, removed 6 redundant places. [2025-01-09 16:46:57,246 INFO L231 Difference]: Finished difference. Result has 226 places, 226 transitions, 2454 flow [2025-01-09 16:46:57,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2095, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2454, PETRI_PLACES=226, PETRI_TRANSITIONS=226} [2025-01-09 16:46:57,246 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 185 predicate places. [2025-01-09 16:46:57,246 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 226 transitions, 2454 flow [2025-01-09 16:46:57,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:57,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:57,247 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-01-09 16:46:57,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 16:46:57,247 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-01-09 16:46:57,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:57,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1354296048, now seen corresponding path program 26 times [2025-01-09 16:46:57,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:57,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410248670] [2025-01-09 16:46:57,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:57,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:57,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:57,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:46:57,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:46:57,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:57,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:57,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410248670] [2025-01-09 16:46:57,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410248670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:57,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:57,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:57,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502923803] [2025-01-09 16:46:57,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:57,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:57,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:57,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:57,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:57,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:57,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 226 transitions, 2454 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:57,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:57,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:57,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:58,550 INFO L124 PetriNetUnfolderBase]: 3646/6198 cut-off events. [2025-01-09 16:46:58,551 INFO L125 PetriNetUnfolderBase]: For 126150/126150 co-relation queries the response was YES. [2025-01-09 16:46:58,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32726 conditions, 6198 events. 3646/6198 cut-off events. For 126150/126150 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 42377 event pairs, 1525 based on Foata normal form. 1/6060 useless extension candidates. Maximal degree in co-relation 32628. Up to 5291 conditions per place. [2025-01-09 16:46:58,606 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 246 selfloop transitions, 35 changer transitions 3/289 dead transitions. [2025-01-09 16:46:58,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 289 transitions, 3674 flow [2025-01-09 16:46:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:58,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2025-01-09 16:46:58,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-01-09 16:46:58,607 INFO L175 Difference]: Start difference. First operand has 226 places, 226 transitions, 2454 flow. Second operand 11 states and 203 transitions. [2025-01-09 16:46:58,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 289 transitions, 3674 flow [2025-01-09 16:46:58,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 289 transitions, 3430 flow, removed 102 selfloop flow, removed 6 redundant places. [2025-01-09 16:46:58,860 INFO L231 Difference]: Finished difference. Result has 233 places, 232 transitions, 2473 flow [2025-01-09 16:46:58,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2214, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2473, PETRI_PLACES=233, PETRI_TRANSITIONS=232} [2025-01-09 16:46:58,861 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 192 predicate places. [2025-01-09 16:46:58,861 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 232 transitions, 2473 flow [2025-01-09 16:46:58,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:58,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:58,861 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-01-09 16:46:58,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 16:46:58,862 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-01-09 16:46:58,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:58,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1165764498, now seen corresponding path program 27 times [2025-01-09 16:46:58,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:58,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104609565] [2025-01-09 16:46:58,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:58,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:58,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:46:58,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:46:58,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:46:58,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:46:59,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:59,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104609565] [2025-01-09 16:46:59,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104609565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:59,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:59,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:46:59,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876920739] [2025-01-09 16:46:59,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:59,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:46:59,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:59,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:46:59,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:46:59,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:46:59,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 232 transitions, 2473 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:59,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:59,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:46:59,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:00,182 INFO L124 PetriNetUnfolderBase]: 3708/6296 cut-off events. [2025-01-09 16:47:00,183 INFO L125 PetriNetUnfolderBase]: For 127151/127151 co-relation queries the response was YES. [2025-01-09 16:47:00,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32813 conditions, 6296 events. 3708/6296 cut-off events. For 127151/127151 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 43132 event pairs, 1557 based on Foata normal form. 1/6161 useless extension candidates. Maximal degree in co-relation 32711. Up to 5378 conditions per place. [2025-01-09 16:47:00,240 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 245 selfloop transitions, 37 changer transitions 4/291 dead transitions. [2025-01-09 16:47:00,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 291 transitions, 3635 flow [2025-01-09 16:47:00,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-01-09 16:47:00,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2025-01-09 16:47:00,241 INFO L175 Difference]: Start difference. First operand has 233 places, 232 transitions, 2473 flow. Second operand 11 states and 202 transitions. [2025-01-09 16:47:00,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 291 transitions, 3635 flow [2025-01-09 16:47:00,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 291 transitions, 3452 flow, removed 73 selfloop flow, removed 6 redundant places. [2025-01-09 16:47:00,478 INFO L231 Difference]: Finished difference. Result has 239 places, 236 transitions, 2542 flow [2025-01-09 16:47:00,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2290, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2542, PETRI_PLACES=239, PETRI_TRANSITIONS=236} [2025-01-09 16:47:00,479 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 198 predicate places. [2025-01-09 16:47:00,479 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 236 transitions, 2542 flow [2025-01-09 16:47:00,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:00,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:00,479 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-01-09 16:47:00,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 16:47:00,480 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-01-09 16:47:00,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:00,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1104084844, now seen corresponding path program 28 times [2025-01-09 16:47:00,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:00,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753215035] [2025-01-09 16:47:00,481 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:47:00,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:00,487 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:47:00,497 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:47:00,497 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:47:00,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:00,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:00,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753215035] [2025-01-09 16:47:00,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753215035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:00,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:00,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:47:00,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412750378] [2025-01-09 16:47:00,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:00,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:47:00,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:00,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:47:00,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:47:00,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-01-09 16:47:00,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 236 transitions, 2542 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:00,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:00,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-01-09 16:47:00,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:01,983 INFO L124 PetriNetUnfolderBase]: 4002/6745 cut-off events. [2025-01-09 16:47:01,983 INFO L125 PetriNetUnfolderBase]: For 149088/149088 co-relation queries the response was YES. [2025-01-09 16:47:02,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35678 conditions, 6745 events. 4002/6745 cut-off events. For 149088/149088 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 46271 event pairs, 1730 based on Foata normal form. 1/6600 useless extension candidates. Maximal degree in co-relation 35573. Up to 5787 conditions per place. [2025-01-09 16:47:02,051 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 257 selfloop transitions, 36 changer transitions 3/300 dead transitions. [2025-01-09 16:47:02,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 300 transitions, 3829 flow [2025-01-09 16:47:02,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2025-01-09 16:47:02,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42207792207792205 [2025-01-09 16:47:02,053 INFO L175 Difference]: Start difference. First operand has 239 places, 236 transitions, 2542 flow. Second operand 11 states and 195 transitions. [2025-01-09 16:47:02,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 300 transitions, 3829 flow [2025-01-09 16:47:02,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 300 transitions, 3634 flow, removed 77 selfloop flow, removed 7 redundant places. [2025-01-09 16:47:02,290 INFO L231 Difference]: Finished difference. Result has 245 places, 242 transitions, 2628 flow [2025-01-09 16:47:02,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2351, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2628, PETRI_PLACES=245, PETRI_TRANSITIONS=242} [2025-01-09 16:47:02,291 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 204 predicate places. [2025-01-09 16:47:02,291 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 242 transitions, 2628 flow [2025-01-09 16:47:02,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:02,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:02,291 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-01-09 16:47:02,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 16:47:02,291 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-01-09 16:47:02,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:02,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1641077338, now seen corresponding path program 29 times [2025-01-09 16:47:02,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:02,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067537793] [2025-01-09 16:47:02,292 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:47:02,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:02,299 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:47:02,308 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:47:02,308 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:47:02,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:02,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:02,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:02,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067537793] [2025-01-09 16:47:02,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067537793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:02,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:02,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:47:02,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314338333] [2025-01-09 16:47:02,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:02,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:47:02,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:02,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:47:02,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:47:02,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:47:02,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 242 transitions, 2628 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:02,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:02,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:47:02,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:03,616 INFO L124 PetriNetUnfolderBase]: 3804/6476 cut-off events. [2025-01-09 16:47:03,617 INFO L125 PetriNetUnfolderBase]: For 141353/141353 co-relation queries the response was YES. [2025-01-09 16:47:03,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34103 conditions, 6476 events. 3804/6476 cut-off events. For 141353/141353 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 44794 event pairs, 1641 based on Foata normal form. 1/6337 useless extension candidates. Maximal degree in co-relation 33994. Up to 5583 conditions per place. [2025-01-09 16:47:03,669 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 252 selfloop transitions, 37 changer transitions 4/298 dead transitions. [2025-01-09 16:47:03,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 298 transitions, 3721 flow [2025-01-09 16:47:03,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2025-01-09 16:47:03,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4329004329004329 [2025-01-09 16:47:03,670 INFO L175 Difference]: Start difference. First operand has 245 places, 242 transitions, 2628 flow. Second operand 11 states and 200 transitions. [2025-01-09 16:47:03,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 298 transitions, 3721 flow [2025-01-09 16:47:03,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 298 transitions, 3521 flow, removed 81 selfloop flow, removed 6 redundant places. [2025-01-09 16:47:03,856 INFO L231 Difference]: Finished difference. Result has 251 places, 246 transitions, 2577 flow [2025-01-09 16:47:03,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2428, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2577, PETRI_PLACES=251, PETRI_TRANSITIONS=246} [2025-01-09 16:47:03,856 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 210 predicate places. [2025-01-09 16:47:03,856 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 246 transitions, 2577 flow [2025-01-09 16:47:03,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:03,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:03,857 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-01-09 16:47:03,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 16:47:03,857 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-01-09 16:47:03,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2056433212, now seen corresponding path program 30 times [2025-01-09 16:47:03,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:03,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152431142] [2025-01-09 16:47:03,857 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:47:03,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:03,862 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:47:03,866 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:47:03,866 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:47:03,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:04,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:04,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152431142] [2025-01-09 16:47:04,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152431142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:04,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:04,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:47:04,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902762240] [2025-01-09 16:47:04,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:04,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:47:04,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:04,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:47:04,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:47:04,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:47:04,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 246 transitions, 2577 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:04,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:04,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:47:04,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:05,016 INFO L124 PetriNetUnfolderBase]: 3804/6474 cut-off events. [2025-01-09 16:47:05,017 INFO L125 PetriNetUnfolderBase]: For 132590/132590 co-relation queries the response was YES. [2025-01-09 16:47:05,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33592 conditions, 6474 events. 3804/6474 cut-off events. For 132590/132590 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 44779 event pairs, 1637 based on Foata normal form. 1/6335 useless extension candidates. Maximal degree in co-relation 33480. Up to 5579 conditions per place. [2025-01-09 16:47:05,087 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 250 selfloop transitions, 41 changer transitions 4/300 dead transitions. [2025-01-09 16:47:05,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 300 transitions, 3614 flow [2025-01-09 16:47:05,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2025-01-09 16:47:05,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43073593073593075 [2025-01-09 16:47:05,088 INFO L175 Difference]: Start difference. First operand has 251 places, 246 transitions, 2577 flow. Second operand 11 states and 199 transitions. [2025-01-09 16:47:05,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 300 transitions, 3614 flow [2025-01-09 16:47:05,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 300 transitions, 3478 flow, removed 33 selfloop flow, removed 8 redundant places. [2025-01-09 16:47:05,315 INFO L231 Difference]: Finished difference. Result has 255 places, 250 transitions, 2609 flow [2025-01-09 16:47:05,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2441, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2609, PETRI_PLACES=255, PETRI_TRANSITIONS=250} [2025-01-09 16:47:05,315 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 214 predicate places. [2025-01-09 16:47:05,315 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 250 transitions, 2609 flow [2025-01-09 16:47:05,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:05,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:05,315 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-01-09 16:47:05,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 16:47:05,316 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-01-09 16:47:05,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:05,316 INFO L85 PathProgramCache]: Analyzing trace with hash 551002140, now seen corresponding path program 31 times [2025-01-09 16:47:05,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:05,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937286764] [2025-01-09 16:47:05,316 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:47:05,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:05,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:47:05,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:47:05,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:05,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:05,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:05,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:05,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937286764] [2025-01-09 16:47:05,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937286764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:05,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:05,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:47:05,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510365834] [2025-01-09 16:47:05,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:05,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:47:05,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:05,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:47:05,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:47:05,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:47:05,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 250 transitions, 2609 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:05,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:05,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:47:05,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:06,561 INFO L124 PetriNetUnfolderBase]: 3840/6541 cut-off events. [2025-01-09 16:47:06,561 INFO L125 PetriNetUnfolderBase]: For 131515/131515 co-relation queries the response was YES. [2025-01-09 16:47:06,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33647 conditions, 6541 events. 3840/6541 cut-off events. For 131515/131515 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 45417 event pairs, 1699 based on Foata normal form. 1/6403 useless extension candidates. Maximal degree in co-relation 33533. Up to 5713 conditions per place. [2025-01-09 16:47:06,632 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 254 selfloop transitions, 37 changer transitions 3/299 dead transitions. [2025-01-09 16:47:06,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 299 transitions, 3617 flow [2025-01-09 16:47:06,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-01-09 16:47:06,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2025-01-09 16:47:06,633 INFO L175 Difference]: Start difference. First operand has 255 places, 250 transitions, 2609 flow. Second operand 11 states and 193 transitions. [2025-01-09 16:47:06,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 299 transitions, 3617 flow [2025-01-09 16:47:06,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 299 transitions, 3463 flow, removed 38 selfloop flow, removed 8 redundant places. [2025-01-09 16:47:06,864 INFO L231 Difference]: Finished difference. Result has 259 places, 253 transitions, 2603 flow [2025-01-09 16:47:06,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2455, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2603, PETRI_PLACES=259, PETRI_TRANSITIONS=253} [2025-01-09 16:47:06,865 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 218 predicate places. [2025-01-09 16:47:06,865 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 253 transitions, 2603 flow [2025-01-09 16:47:06,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:06,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:06,865 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-01-09 16:47:06,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 16:47:06,866 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-01-09 16:47:06,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:06,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1304251508, now seen corresponding path program 32 times [2025-01-09 16:47:06,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:06,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499318699] [2025-01-09 16:47:06,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:47:06,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:06,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:47:06,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:47:06,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:47:06,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:07,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:07,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499318699] [2025-01-09 16:47:07,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499318699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:07,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:07,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:47:07,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795985225] [2025-01-09 16:47:07,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:07,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:47:07,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:07,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:47:07,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:47:07,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:47:07,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 253 transitions, 2603 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:07,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:07,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:47:07,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:08,118 INFO L124 PetriNetUnfolderBase]: 3840/6559 cut-off events. [2025-01-09 16:47:08,118 INFO L125 PetriNetUnfolderBase]: For 129185/129185 co-relation queries the response was YES. [2025-01-09 16:47:08,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33393 conditions, 6559 events. 3840/6559 cut-off events. For 129185/129185 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 45892 event pairs, 1674 based on Foata normal form. 1/6411 useless extension candidates. Maximal degree in co-relation 33277. Up to 5726 conditions per place. [2025-01-09 16:47:08,189 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 256 selfloop transitions, 35 changer transitions 3/299 dead transitions. [2025-01-09 16:47:08,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 299 transitions, 3561 flow [2025-01-09 16:47:08,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2025-01-09 16:47:08,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2025-01-09 16:47:08,190 INFO L175 Difference]: Start difference. First operand has 259 places, 253 transitions, 2603 flow. Second operand 11 states and 190 transitions. [2025-01-09 16:47:08,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 299 transitions, 3561 flow [2025-01-09 16:47:08,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 299 transitions, 3421 flow, removed 34 selfloop flow, removed 8 redundant places. [2025-01-09 16:47:08,398 INFO L231 Difference]: Finished difference. Result has 263 places, 255 transitions, 2559 flow [2025-01-09 16:47:08,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2465, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2559, PETRI_PLACES=263, PETRI_TRANSITIONS=255} [2025-01-09 16:47:08,398 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 222 predicate places. [2025-01-09 16:47:08,398 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 255 transitions, 2559 flow [2025-01-09 16:47:08,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:08,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:08,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:08,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 16:47:08,399 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-01-09 16:47:08,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2135305802, now seen corresponding path program 33 times [2025-01-09 16:47:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:08,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261281924] [2025-01-09 16:47:08,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:47:08,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:08,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:47:08,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:47:08,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:47:08,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:08,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:08,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261281924] [2025-01-09 16:47:08,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261281924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:08,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:08,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:47:08,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908531138] [2025-01-09 16:47:08,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:08,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:47:08,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:08,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:47:08,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:47:08,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:47:08,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 255 transitions, 2559 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:08,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:08,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:47:08,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:09,742 INFO L124 PetriNetUnfolderBase]: 3971/6772 cut-off events. [2025-01-09 16:47:09,742 INFO L125 PetriNetUnfolderBase]: For 145221/145221 co-relation queries the response was YES. [2025-01-09 16:47:09,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35306 conditions, 6772 events. 3971/6772 cut-off events. For 145221/145221 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 47576 event pairs, 1744 based on Foata normal form. 1/6621 useless extension candidates. Maximal degree in co-relation 35188. Up to 5839 conditions per place. [2025-01-09 16:47:09,812 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 272 selfloop transitions, 35 changer transitions 3/315 dead transitions. [2025-01-09 16:47:09,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 315 transitions, 4044 flow [2025-01-09 16:47:09,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2025-01-09 16:47:09,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4329004329004329 [2025-01-09 16:47:09,814 INFO L175 Difference]: Start difference. First operand has 263 places, 255 transitions, 2559 flow. Second operand 11 states and 200 transitions. [2025-01-09 16:47:09,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 315 transitions, 4044 flow [2025-01-09 16:47:10,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 315 transitions, 3976 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-01-09 16:47:10,069 INFO L231 Difference]: Finished difference. Result has 269 places, 264 transitions, 2976 flow [2025-01-09 16:47:10,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2491, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2976, PETRI_PLACES=269, PETRI_TRANSITIONS=264} [2025-01-09 16:47:10,070 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 228 predicate places. [2025-01-09 16:47:10,071 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 264 transitions, 2976 flow [2025-01-09 16:47:10,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:10,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:10,071 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-01-09 16:47:10,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 16:47:10,071 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-01-09 16:47:10,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:10,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1081497366, now seen corresponding path program 34 times [2025-01-09 16:47:10,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:10,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970509086] [2025-01-09 16:47:10,073 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:47:10,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:10,081 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:47:10,089 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:47:10,089 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:47:10,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:10,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:10,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970509086] [2025-01-09 16:47:10,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970509086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:10,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:10,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:47:10,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898475220] [2025-01-09 16:47:10,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:10,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:47:10,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:10,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:47:10,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:47:10,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-01-09 16:47:10,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 264 transitions, 2976 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:10,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:10,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-01-09 16:47:10,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:11,649 INFO L124 PetriNetUnfolderBase]: 4381/7427 cut-off events. [2025-01-09 16:47:11,650 INFO L125 PetriNetUnfolderBase]: For 209074/209074 co-relation queries the response was YES. [2025-01-09 16:47:11,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41146 conditions, 7427 events. 4381/7427 cut-off events. For 209074/209074 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 52165 event pairs, 1891 based on Foata normal form. 1/7253 useless extension candidates. Maximal degree in co-relation 41024. Up to 6270 conditions per place. [2025-01-09 16:47:11,742 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 299 selfloop transitions, 39 changer transitions 3/345 dead transitions. [2025-01-09 16:47:11,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 345 transitions, 4712 flow [2025-01-09 16:47:11,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2025-01-09 16:47:11,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45670995670995673 [2025-01-09 16:47:11,743 INFO L175 Difference]: Start difference. First operand has 269 places, 264 transitions, 2976 flow. Second operand 11 states and 211 transitions. [2025-01-09 16:47:11,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 345 transitions, 4712 flow [2025-01-09 16:47:12,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 345 transitions, 4378 flow, removed 151 selfloop flow, removed 5 redundant places. [2025-01-09 16:47:12,180 INFO L231 Difference]: Finished difference. Result has 279 places, 276 transitions, 3184 flow [2025-01-09 16:47:12,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2642, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3184, PETRI_PLACES=279, PETRI_TRANSITIONS=276} [2025-01-09 16:47:12,181 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 238 predicate places. [2025-01-09 16:47:12,181 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 276 transitions, 3184 flow [2025-01-09 16:47:12,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:12,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:12,181 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-01-09 16:47:12,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 16:47:12,181 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-01-09 16:47:12,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:12,182 INFO L85 PathProgramCache]: Analyzing trace with hash 418212108, now seen corresponding path program 35 times [2025-01-09 16:47:12,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:12,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210603624] [2025-01-09 16:47:12,183 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:47:12,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:12,189 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:47:12,196 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:47:12,196 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:47:12,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:12,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:12,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210603624] [2025-01-09 16:47:12,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210603624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:12,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:12,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:47:12,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845927347] [2025-01-09 16:47:12,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:12,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:47:12,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:12,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:47:12,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:47:12,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:47:12,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 276 transitions, 3184 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:12,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:12,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:47:12,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:13,853 INFO L124 PetriNetUnfolderBase]: 4244/7255 cut-off events. [2025-01-09 16:47:13,853 INFO L125 PetriNetUnfolderBase]: For 206970/206970 co-relation queries the response was YES. [2025-01-09 16:47:13,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40118 conditions, 7255 events. 4244/7255 cut-off events. For 206970/206970 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 51596 event pairs, 1916 based on Foata normal form. 1/7088 useless extension candidates. Maximal degree in co-relation 39990. Up to 6355 conditions per place. [2025-01-09 16:47:13,939 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 281 selfloop transitions, 35 changer transitions 4/325 dead transitions. [2025-01-09 16:47:13,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 325 transitions, 4322 flow [2025-01-09 16:47:13,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2025-01-09 16:47:13,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4155844155844156 [2025-01-09 16:47:13,940 INFO L175 Difference]: Start difference. First operand has 279 places, 276 transitions, 3184 flow. Second operand 11 states and 192 transitions. [2025-01-09 16:47:13,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 325 transitions, 4322 flow [2025-01-09 16:47:14,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 325 transitions, 3998 flow, removed 147 selfloop flow, removed 4 redundant places. [2025-01-09 16:47:14,416 INFO L231 Difference]: Finished difference. Result has 288 places, 282 transitions, 3115 flow [2025-01-09 16:47:14,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2860, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3115, PETRI_PLACES=288, PETRI_TRANSITIONS=282} [2025-01-09 16:47:14,417 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 247 predicate places. [2025-01-09 16:47:14,417 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 282 transitions, 3115 flow [2025-01-09 16:47:14,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:14,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:14,417 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-01-09 16:47:14,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 16:47:14,417 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-01-09 16:47:14,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2015259070, now seen corresponding path program 36 times [2025-01-09 16:47:14,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:14,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507299867] [2025-01-09 16:47:14,418 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:47:14,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:14,424 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:47:14,433 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:47:14,433 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:47:14,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:14,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:14,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507299867] [2025-01-09 16:47:14,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507299867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:14,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:14,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:47:14,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180805373] [2025-01-09 16:47:14,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:14,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:47:14,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:14,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:47:14,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:47:14,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:47:14,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 282 transitions, 3115 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:14,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:14,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:47:14,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:16,102 INFO L124 PetriNetUnfolderBase]: 4395/7499 cut-off events. [2025-01-09 16:47:16,103 INFO L125 PetriNetUnfolderBase]: For 208634/208634 co-relation queries the response was YES. [2025-01-09 16:47:16,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41009 conditions, 7499 events. 4395/7499 cut-off events. For 208634/208634 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 53644 event pairs, 1948 based on Foata normal form. 1/7336 useless extension candidates. Maximal degree in co-relation 40877. Up to 6379 conditions per place. [2025-01-09 16:47:16,165 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 292 selfloop transitions, 41 changer transitions 3/341 dead transitions. [2025-01-09 16:47:16,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 341 transitions, 4607 flow [2025-01-09 16:47:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2025-01-09 16:47:16,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-01-09 16:47:16,166 INFO L175 Difference]: Start difference. First operand has 288 places, 282 transitions, 3115 flow. Second operand 11 states and 203 transitions. [2025-01-09 16:47:16,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 341 transitions, 4607 flow [2025-01-09 16:47:16,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 341 transitions, 4389 flow, removed 90 selfloop flow, removed 6 redundant places. [2025-01-09 16:47:16,596 INFO L231 Difference]: Finished difference. Result has 295 places, 289 transitions, 3350 flow [2025-01-09 16:47:16,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2897, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3350, PETRI_PLACES=295, PETRI_TRANSITIONS=289} [2025-01-09 16:47:16,597 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 254 predicate places. [2025-01-09 16:47:16,597 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 289 transitions, 3350 flow [2025-01-09 16:47:16,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:16,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:16,597 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-01-09 16:47:16,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 16:47:16,597 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-01-09 16:47:16,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:16,598 INFO L85 PathProgramCache]: Analyzing trace with hash -651664018, now seen corresponding path program 37 times [2025-01-09 16:47:16,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:16,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286129820] [2025-01-09 16:47:16,598 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:47:16,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:16,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:47:16,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:47:16,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:16,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:16,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:16,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286129820] [2025-01-09 16:47:16,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286129820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:16,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:16,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:47:16,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682133882] [2025-01-09 16:47:16,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:16,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:47:16,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:16,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:47:16,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:47:16,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:47:16,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 289 transitions, 3350 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:16,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:16,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:47:16,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:18,150 INFO L124 PetriNetUnfolderBase]: 4458/7614 cut-off events. [2025-01-09 16:47:18,150 INFO L125 PetriNetUnfolderBase]: For 241409/241409 co-relation queries the response was YES. [2025-01-09 16:47:18,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42838 conditions, 7614 events. 4458/7614 cut-off events. For 241409/241409 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 54745 event pairs, 2030 based on Foata normal form. 1/7450 useless extension candidates. Maximal degree in co-relation 42702. Up to 6612 conditions per place. [2025-01-09 16:47:18,245 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 306 selfloop transitions, 34 changer transitions 3/348 dead transitions. [2025-01-09 16:47:18,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 348 transitions, 4787 flow [2025-01-09 16:47:18,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:18,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-01-09 16:47:18,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2025-01-09 16:47:18,246 INFO L175 Difference]: Start difference. First operand has 295 places, 289 transitions, 3350 flow. Second operand 11 states and 202 transitions. [2025-01-09 16:47:18,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 348 transitions, 4787 flow [2025-01-09 16:47:18,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 348 transitions, 4461 flow, removed 144 selfloop flow, removed 6 redundant places. [2025-01-09 16:47:18,745 INFO L231 Difference]: Finished difference. Result has 302 places, 294 transitions, 3338 flow [2025-01-09 16:47:18,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3028, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3338, PETRI_PLACES=302, PETRI_TRANSITIONS=294} [2025-01-09 16:47:18,745 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 261 predicate places. [2025-01-09 16:47:18,745 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 294 transitions, 3338 flow [2025-01-09 16:47:18,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:18,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:18,746 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-01-09 16:47:18,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 16:47:18,746 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-01-09 16:47:18,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:18,746 INFO L85 PathProgramCache]: Analyzing trace with hash -723597164, now seen corresponding path program 38 times [2025-01-09 16:47:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:18,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655425538] [2025-01-09 16:47:18,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:47:18,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:18,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:47:18,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:47:18,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:47:18,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:19,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:19,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:19,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655425538] [2025-01-09 16:47:19,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655425538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:19,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:19,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:47:19,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120944280] [2025-01-09 16:47:19,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:19,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:47:19,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:19,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:47:19,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:47:19,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:47:19,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 294 transitions, 3338 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:19,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:19,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:47:19,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:20,535 INFO L124 PetriNetUnfolderBase]: 4458/7606 cut-off events. [2025-01-09 16:47:20,535 INFO L125 PetriNetUnfolderBase]: For 230027/230027 co-relation queries the response was YES. [2025-01-09 16:47:20,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41705 conditions, 7606 events. 4458/7606 cut-off events. For 230027/230027 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 54533 event pairs, 2054 based on Foata normal form. 1/7446 useless extension candidates. Maximal degree in co-relation 41565. Up to 6689 conditions per place. [2025-01-09 16:47:20,652 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 302 selfloop transitions, 33 changer transitions 3/343 dead transitions. [2025-01-09 16:47:20,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 343 transitions, 4517 flow [2025-01-09 16:47:20,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-01-09 16:47:20,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2025-01-09 16:47:20,653 INFO L175 Difference]: Start difference. First operand has 302 places, 294 transitions, 3338 flow. Second operand 11 states and 193 transitions. [2025-01-09 16:47:20,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 343 transitions, 4517 flow [2025-01-09 16:47:21,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 343 transitions, 4272 flow, removed 105 selfloop flow, removed 6 redundant places. [2025-01-09 16:47:21,257 INFO L231 Difference]: Finished difference. Result has 308 places, 297 transitions, 3244 flow [2025-01-09 16:47:21,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3093, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3244, PETRI_PLACES=308, PETRI_TRANSITIONS=297} [2025-01-09 16:47:21,258 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 267 predicate places. [2025-01-09 16:47:21,258 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 297 transitions, 3244 flow [2025-01-09 16:47:21,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:21,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:21,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:21,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 16:47:21,258 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-01-09 16:47:21,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:21,259 INFO L85 PathProgramCache]: Analyzing trace with hash -901875222, now seen corresponding path program 39 times [2025-01-09 16:47:21,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:21,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155699025] [2025-01-09 16:47:21,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:47:21,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:21,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:47:21,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:47:21,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:47:21,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:21,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:21,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155699025] [2025-01-09 16:47:21,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155699025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:21,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:21,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:47:21,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911753305] [2025-01-09 16:47:21,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:21,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:47:21,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:21,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:47:21,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:47:21,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:47:21,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 297 transitions, 3244 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:21,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:21,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:47:21,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:22,847 INFO L124 PetriNetUnfolderBase]: 4521/7722 cut-off events. [2025-01-09 16:47:22,847 INFO L125 PetriNetUnfolderBase]: For 232723/232723 co-relation queries the response was YES. [2025-01-09 16:47:22,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42221 conditions, 7722 events. 4521/7722 cut-off events. For 232723/232723 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 55584 event pairs, 2100 based on Foata normal form. 1/7559 useless extension candidates. Maximal degree in co-relation 42078. Up to 6704 conditions per place. [2025-01-09 16:47:22,959 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 312 selfloop transitions, 35 changer transitions 3/355 dead transitions. [2025-01-09 16:47:22,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 355 transitions, 4712 flow [2025-01-09 16:47:22,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-01-09 16:47:22,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2025-01-09 16:47:22,960 INFO L175 Difference]: Start difference. First operand has 308 places, 297 transitions, 3244 flow. Second operand 11 states and 202 transitions. [2025-01-09 16:47:22,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 355 transitions, 4712 flow [2025-01-09 16:47:23,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 355 transitions, 4586 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-01-09 16:47:23,482 INFO L231 Difference]: Finished difference. Result has 313 places, 302 transitions, 3442 flow [2025-01-09 16:47:23,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3118, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3442, PETRI_PLACES=313, PETRI_TRANSITIONS=302} [2025-01-09 16:47:23,483 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 272 predicate places. [2025-01-09 16:47:23,483 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 302 transitions, 3442 flow [2025-01-09 16:47:23,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:23,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:23,483 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-01-09 16:47:23,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 16:47:23,484 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-01-09 16:47:23,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash -364762640, now seen corresponding path program 40 times [2025-01-09 16:47:23,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:23,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683139299] [2025-01-09 16:47:23,484 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:47:23,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:23,490 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:47:23,499 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:47:23,499 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:47:23,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:23,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:23,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683139299] [2025-01-09 16:47:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683139299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:23,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:23,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:47:23,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879030668] [2025-01-09 16:47:23,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:23,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:47:23,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:23,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:47:23,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:47:23,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-01-09 16:47:23,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 302 transitions, 3442 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:23,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:23,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-01-09 16:47:23,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:25,300 INFO L124 PetriNetUnfolderBase]: 4748/8067 cut-off events. [2025-01-09 16:47:25,300 INFO L125 PetriNetUnfolderBase]: For 259442/259442 co-relation queries the response was YES. [2025-01-09 16:47:25,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44512 conditions, 8067 events. 4748/8067 cut-off events. For 259442/259442 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 57694 event pairs, 2165 based on Foata normal form. 1/7897 useless extension candidates. Maximal degree in co-relation 44366. Up to 6864 conditions per place. [2025-01-09 16:47:25,394 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 322 selfloop transitions, 41 changer transitions 5/372 dead transitions. [2025-01-09 16:47:25,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 372 transitions, 4873 flow [2025-01-09 16:47:25,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2025-01-09 16:47:25,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-01-09 16:47:25,395 INFO L175 Difference]: Start difference. First operand has 313 places, 302 transitions, 3442 flow. Second operand 11 states and 209 transitions. [2025-01-09 16:47:25,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 372 transitions, 4873 flow [2025-01-09 16:47:25,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 372 transitions, 4617 flow, removed 112 selfloop flow, removed 5 redundant places. [2025-01-09 16:47:25,894 INFO L231 Difference]: Finished difference. Result has 321 places, 307 transitions, 3413 flow [2025-01-09 16:47:25,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3186, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3413, PETRI_PLACES=321, PETRI_TRANSITIONS=307} [2025-01-09 16:47:25,895 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 280 predicate places. [2025-01-09 16:47:25,895 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 307 transitions, 3413 flow [2025-01-09 16:47:25,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:25,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:25,896 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-01-09 16:47:25,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 16:47:25,896 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-01-09 16:47:25,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:25,897 INFO L85 PathProgramCache]: Analyzing trace with hash 232574018, now seen corresponding path program 41 times [2025-01-09 16:47:25,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:25,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459120679] [2025-01-09 16:47:25,897 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:47:25,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:25,904 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:47:25,913 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:47:25,913 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:47:25,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:26,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:26,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459120679] [2025-01-09 16:47:26,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459120679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:26,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:26,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:47:26,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038130002] [2025-01-09 16:47:26,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:26,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:47:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:26,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:47:26,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:47:26,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:47:26,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 307 transitions, 3413 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:26,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:26,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:47:26,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:27,613 INFO L124 PetriNetUnfolderBase]: 4550/7793 cut-off events. [2025-01-09 16:47:27,613 INFO L125 PetriNetUnfolderBase]: For 230988/230988 co-relation queries the response was YES. [2025-01-09 16:47:27,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42187 conditions, 7793 events. 4550/7793 cut-off events. For 230988/230988 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 56159 event pairs, 2116 based on Foata normal form. 1/7624 useless extension candidates. Maximal degree in co-relation 42037. Up to 6795 conditions per place. [2025-01-09 16:47:27,711 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 309 selfloop transitions, 40 changer transitions 4/358 dead transitions. [2025-01-09 16:47:27,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 358 transitions, 4578 flow [2025-01-09 16:47:27,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2025-01-09 16:47:27,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-01-09 16:47:27,712 INFO L175 Difference]: Start difference. First operand has 321 places, 307 transitions, 3413 flow. Second operand 11 states and 198 transitions. [2025-01-09 16:47:27,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 358 transitions, 4578 flow [2025-01-09 16:47:28,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 358 transitions, 4383 flow, removed 65 selfloop flow, removed 6 redundant places. [2025-01-09 16:47:28,224 INFO L231 Difference]: Finished difference. Result has 327 places, 311 transitions, 3404 flow [2025-01-09 16:47:28,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3218, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3404, PETRI_PLACES=327, PETRI_TRANSITIONS=311} [2025-01-09 16:47:28,224 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 286 predicate places. [2025-01-09 16:47:28,224 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 311 transitions, 3404 flow [2025-01-09 16:47:28,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:28,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:28,225 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-01-09 16:47:28,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 16:47:28,225 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-01-09 16:47:28,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1454957926, now seen corresponding path program 42 times [2025-01-09 16:47:28,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:28,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874920236] [2025-01-09 16:47:28,226 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:47:28,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:28,233 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:47:28,239 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-01-09 16:47:28,239 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:47:28,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:28,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:28,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874920236] [2025-01-09 16:47:28,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874920236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:28,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:28,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:47:28,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664453628] [2025-01-09 16:47:28,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:28,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:47:28,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:28,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:47:28,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:47:28,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:47:28,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 311 transitions, 3404 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:28,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:28,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:47:28,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:30,025 INFO L124 PetriNetUnfolderBase]: 4586/7860 cut-off events. [2025-01-09 16:47:30,025 INFO L125 PetriNetUnfolderBase]: For 226316/226316 co-relation queries the response was YES. [2025-01-09 16:47:30,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42004 conditions, 7860 events. 4586/7860 cut-off events. For 226316/226316 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 56901 event pairs, 2178 based on Foata normal form. 1/7692 useless extension candidates. Maximal degree in co-relation 41852. Up to 6929 conditions per place. [2025-01-09 16:47:30,145 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 313 selfloop transitions, 36 changer transitions 3/357 dead transitions. [2025-01-09 16:47:30,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 357 transitions, 4540 flow [2025-01-09 16:47:30,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:30,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:30,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2025-01-09 16:47:30,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4155844155844156 [2025-01-09 16:47:30,147 INFO L175 Difference]: Start difference. First operand has 327 places, 311 transitions, 3404 flow. Second operand 11 states and 192 transitions. [2025-01-09 16:47:30,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 357 transitions, 4540 flow [2025-01-09 16:47:30,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 357 transitions, 4356 flow, removed 54 selfloop flow, removed 8 redundant places. [2025-01-09 16:47:30,609 INFO L231 Difference]: Finished difference. Result has 331 places, 314 transitions, 3386 flow [2025-01-09 16:47:30,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3220, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3386, PETRI_PLACES=331, PETRI_TRANSITIONS=314} [2025-01-09 16:47:30,610 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 290 predicate places. [2025-01-09 16:47:30,610 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 314 transitions, 3386 flow [2025-01-09 16:47:30,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:30,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:30,610 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-01-09 16:47:30,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 16:47:30,610 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-01-09 16:47:30,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:30,611 INFO L85 PathProgramCache]: Analyzing trace with hash -701708558, now seen corresponding path program 43 times [2025-01-09 16:47:30,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:30,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763252256] [2025-01-09 16:47:30,611 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:47:30,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:30,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:47:30,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:47:30,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:30,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:30,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:30,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:30,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763252256] [2025-01-09 16:47:30,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763252256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:30,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:30,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:47:30,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656284805] [2025-01-09 16:47:30,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:30,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:47:30,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:30,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:47:30,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:47:30,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-01-09 16:47:30,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 314 transitions, 3386 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:30,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:30,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-01-09 16:47:30,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:32,284 INFO L124 PetriNetUnfolderBase]: 4586/7868 cut-off events. [2025-01-09 16:47:32,284 INFO L125 PetriNetUnfolderBase]: For 220768/220768 co-relation queries the response was YES. [2025-01-09 16:47:32,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41599 conditions, 7868 events. 4586/7868 cut-off events. For 220768/220768 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 57022 event pairs, 2185 based on Foata normal form. 1/7695 useless extension candidates. Maximal degree in co-relation 41445. Up to 6942 conditions per place. [2025-01-09 16:47:32,395 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 315 selfloop transitions, 34 changer transitions 3/357 dead transitions. [2025-01-09 16:47:32,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 357 transitions, 4452 flow [2025-01-09 16:47:32,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:47:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:47:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2025-01-09 16:47:32,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-01-09 16:47:32,396 INFO L175 Difference]: Start difference. First operand has 331 places, 314 transitions, 3386 flow. Second operand 11 states and 189 transitions. [2025-01-09 16:47:32,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 357 transitions, 4452 flow [2025-01-09 16:47:32,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 357 transitions, 4282 flow, removed 50 selfloop flow, removed 8 redundant places. [2025-01-09 16:47:32,876 INFO L231 Difference]: Finished difference. Result has 335 places, 316 transitions, 3310 flow [2025-01-09 16:47:32,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3218, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3310, PETRI_PLACES=335, PETRI_TRANSITIONS=316} [2025-01-09 16:47:32,877 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 294 predicate places. [2025-01-09 16:47:32,877 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 316 transitions, 3310 flow [2025-01-09 16:47:32,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:32,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:32,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:32,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 16:47:32,878 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-01-09 16:47:32,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:32,878 INFO L85 PathProgramCache]: Analyzing trace with hash 657767715, now seen corresponding path program 1 times [2025-01-09 16:47:32,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:32,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740894713] [2025-01-09 16:47:32,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:32,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:32,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 16:47:32,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 16:47:32,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:32,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:32,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:32,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740894713] [2025-01-09 16:47:32,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740894713] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:32,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660190199] [2025-01-09 16:47:32,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:32,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:32,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:32,955 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-01-09 16:47:32,956 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-01-09 16:47:33,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 16:47:33,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 16:47:33,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:33,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:33,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:47:33,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:33,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:33,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660190199] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:47:33,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:47:33,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-09 16:47:33,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16892530] [2025-01-09 16:47:33,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:47:33,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:47:33,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:33,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:47:33,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:47:33,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-01-09 16:47:33,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 316 transitions, 3310 flow. Second operand has 12 states, 12 states have (on average 13.833333333333334) internal successors, (166), 12 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:33,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:33,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-01-09 16:47:33,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:35,691 INFO L124 PetriNetUnfolderBase]: 7743/13964 cut-off events. [2025-01-09 16:47:35,692 INFO L125 PetriNetUnfolderBase]: For 454347/454599 co-relation queries the response was YES. [2025-01-09 16:47:35,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75825 conditions, 13964 events. 7743/13964 cut-off events. For 454347/454599 co-relation queries the response was YES. Maximal size of possible extension queue 1175. Compared 117466 event pairs, 4670 based on Foata normal form. 292/13811 useless extension candidates. Maximal degree in co-relation 75669. Up to 6301 conditions per place. [2025-01-09 16:47:35,850 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 530 selfloop transitions, 6 changer transitions 12/592 dead transitions. [2025-01-09 16:47:35,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 592 transitions, 7392 flow [2025-01-09 16:47:35,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:47:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:47:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2025-01-09 16:47:35,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-01-09 16:47:35,851 INFO L175 Difference]: Start difference. First operand has 335 places, 316 transitions, 3310 flow. Second operand 7 states and 133 transitions. [2025-01-09 16:47:35,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 592 transitions, 7392 flow [2025-01-09 16:47:36,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 592 transitions, 7260 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-01-09 16:47:36,682 INFO L231 Difference]: Finished difference. Result has 337 places, 320 transitions, 3302 flow [2025-01-09 16:47:36,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3244, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3302, PETRI_PLACES=337, PETRI_TRANSITIONS=320} [2025-01-09 16:47:36,682 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 296 predicate places. [2025-01-09 16:47:36,683 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 320 transitions, 3302 flow [2025-01-09 16:47:36,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.833333333333334) internal successors, (166), 12 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:36,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:36,683 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:36,691 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-01-09 16:47:36,883 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-01-09 16:47:36,884 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-01-09 16:47:36,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:36,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1169015475, now seen corresponding path program 1 times [2025-01-09 16:47:36,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:36,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546237215] [2025-01-09 16:47:36,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:36,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:36,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 16:47:36,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 16:47:36,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:36,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:36,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:36,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546237215] [2025-01-09 16:47:36,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546237215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:36,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175290457] [2025-01-09 16:47:36,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:36,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:36,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:36,944 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-01-09 16:47:36,945 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-01-09 16:47:37,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 16:47:37,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 16:47:37,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:37,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:37,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:47:37,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:47:37,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:47:37,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175290457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:37,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:47:37,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-01-09 16:47:37,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594248634] [2025-01-09 16:47:37,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:37,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:47:37,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:37,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:47:37,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:47:37,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-01-09 16:47:37,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 320 transitions, 3302 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:37,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:37,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-01-09 16:47:37,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand