./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-word-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-word-trans.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 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:35:09,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:35:09,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:35:09,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:35:09,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:35:09,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:35:09,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:35:09,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:35:09,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:35:09,277 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:35:09,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:35:09,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:35:09,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:35:09,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:35:09,278 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:35:09,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:35:09,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:35:09,278 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:35:09,279 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:35:09,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:35:09,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:35:09,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:35:09,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:35:09,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:35:09,279 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:35:09,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:35:09,279 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:35:09,279 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:35:09,279 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:35:09,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:35:09,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:35:09,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:35:09,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:35:09,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:35:09,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:35:09,280 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:35:09,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:35:09,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:35:09,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:35:09,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:35:09,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:35:09,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:35:09,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:35:09,281 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 -> 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 [2025-02-06 04:35:09,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:35:09,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:35:09,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:35:09,595 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:35:09,595 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:35:09,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-02-06 04:35:10,911 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/025eb0ea3/75fd2b0d4dbb448a812044374be5c794/FLAG8fb13d902 [2025-02-06 04:35:11,206 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:35:11,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-02-06 04:35:11,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/025eb0ea3/75fd2b0d4dbb448a812044374be5c794/FLAG8fb13d902 [2025-02-06 04:35:11,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/025eb0ea3/75fd2b0d4dbb448a812044374be5c794 [2025-02-06 04:35:11,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:35:11,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:35:11,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:35:11,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:35:11,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:35:11,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:35:11" (1/1) ... [2025-02-06 04:35:11,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@568aa3a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:11, skipping insertion in model container [2025-02-06 04:35:11,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:35:11" (1/1) ... [2025-02-06 04:35:11,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:35:11,448 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/chl-word-trans.wvr.c[3331,3344] [2025-02-06 04:35:11,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:35:11,476 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:35:11,502 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/chl-word-trans.wvr.c[3331,3344] [2025-02-06 04:35:11,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:35:11,519 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:35:11,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:11 WrapperNode [2025-02-06 04:35:11,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:35:11,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:35:11,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:35:11,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:35:11,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:11" (1/1) ... [2025-02-06 04:35:11,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:11" (1/1) ... [2025-02-06 04:35:11,569 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 156 [2025-02-06 04:35:11,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:35:11,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:35:11,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:35:11,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:35:11,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:11" (1/1) ... [2025-02-06 04:35:11,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:11" (1/1) ... [2025-02-06 04:35:11,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:11" (1/1) ... [2025-02-06 04:35:11,611 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-06 04:35:11,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:11" (1/1) ... [2025-02-06 04:35:11,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:11" (1/1) ... [2025-02-06 04:35:11,625 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:11" (1/1) ... [2025-02-06 04:35:11,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:11" (1/1) ... [2025-02-06 04:35:11,632 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:11" (1/1) ... [2025-02-06 04:35:11,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:11" (1/1) ... [2025-02-06 04:35:11,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:35:11,637 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:35:11,637 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:35:11,637 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:35:11,638 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:11" (1/1) ... [2025-02-06 04:35:11,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:35:11,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:35:11,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:35:11,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:35:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:35:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:35:11,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:35:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:35:11,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:35:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:35:11,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:35:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:35:11,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:35:11,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:35:11,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:35:11,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:35:11,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:35:11,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:35:11,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:35:11,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:35:11,692 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:35:11,807 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:35:11,809 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:35:12,219 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:35:12,219 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:35:12,508 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:35:12,508 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:35:12,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:35:12 BoogieIcfgContainer [2025-02-06 04:35:12,509 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:35:12,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:35:12,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:35:12,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:35:12,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:35:11" (1/3) ... [2025-02-06 04:35:12,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7898cb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:35:12, skipping insertion in model container [2025-02-06 04:35:12,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:11" (2/3) ... [2025-02-06 04:35:12,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7898cb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:35:12, skipping insertion in model container [2025-02-06 04:35:12,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:35:12" (3/3) ... [2025-02-06 04:35:12,519 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2025-02-06 04:35:12,534 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:35:12,536 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-trans.wvr.c that has 4 procedures, 38 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-06 04:35:12,536 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:35:12,594 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 04:35:12,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 119 flow [2025-02-06 04:35:12,662 INFO L124 PetriNetUnfolderBase]: 12/46 cut-off events. [2025-02-06 04:35:12,665 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:35:12,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 12/46 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-02-06 04:35:12,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 49 transitions, 119 flow [2025-02-06 04:35:12,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 45 transitions, 108 flow [2025-02-06 04:35:12,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:35:12,692 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;@147d3d10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:35:12,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:35:12,715 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:35:12,717 INFO L124 PetriNetUnfolderBase]: 12/44 cut-off events. [2025-02-06 04:35:12,717 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:35:12,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:12,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:12,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:12,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash -857301232, now seen corresponding path program 1 times [2025-02-06 04:35:12,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:12,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733789468] [2025-02-06 04:35:12,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:12,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:12,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:35:12,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:35:12,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:12,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:13,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:13,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733789468] [2025-02-06 04:35:13,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733789468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:13,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:13,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:13,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773777186] [2025-02-06 04:35:13,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:13,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:13,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:13,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:13,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:13,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:13,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:13,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:13,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:13,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:14,240 INFO L124 PetriNetUnfolderBase]: 3083/4271 cut-off events. [2025-02-06 04:35:14,240 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2025-02-06 04:35:14,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8609 conditions, 4271 events. 3083/4271 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 17973 event pairs, 1440 based on Foata normal form. 1/3480 useless extension candidates. Maximal degree in co-relation 7989. Up to 3035 conditions per place. [2025-02-06 04:35:14,274 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 79 selfloop transitions, 5 changer transitions 5/93 dead transitions. [2025-02-06 04:35:14,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 93 transitions, 409 flow [2025-02-06 04:35:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-02-06 04:35:14,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-02-06 04:35:14,289 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 108 flow. Second operand 5 states and 125 transitions. [2025-02-06 04:35:14,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 93 transitions, 409 flow [2025-02-06 04:35:14,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 93 transitions, 379 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 04:35:14,301 INFO L231 Difference]: Finished difference. Result has 44 places, 49 transitions, 135 flow [2025-02-06 04:35:14,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=49} [2025-02-06 04:35:14,306 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-02-06 04:35:14,307 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 49 transitions, 135 flow [2025-02-06 04:35:14,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:14,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:14,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:14,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:35:14,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:14,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash -167815958, now seen corresponding path program 2 times [2025-02-06 04:35:14,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:14,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429649582] [2025-02-06 04:35:14,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:35:14,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:14,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:35:14,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:35:14,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:35:14,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:14,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:14,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429649582] [2025-02-06 04:35:14,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429649582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:14,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:14,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:14,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504123495] [2025-02-06 04:35:14,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:14,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:14,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:14,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:14,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:14,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:14,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 49 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:14,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:14,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:14,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:15,365 INFO L124 PetriNetUnfolderBase]: 4113/5809 cut-off events. [2025-02-06 04:35:15,366 INFO L125 PetriNetUnfolderBase]: For 1272/1272 co-relation queries the response was YES. [2025-02-06 04:35:15,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12653 conditions, 5809 events. 4113/5809 cut-off events. For 1272/1272 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28187 event pairs, 2025 based on Foata normal form. 1/5302 useless extension candidates. Maximal degree in co-relation 9380. Up to 3982 conditions per place. [2025-02-06 04:35:15,405 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 91 selfloop transitions, 6 changer transitions 3/104 dead transitions. [2025-02-06 04:35:15,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 104 transitions, 473 flow [2025-02-06 04:35:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-02-06 04:35:15,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-02-06 04:35:15,409 INFO L175 Difference]: Start difference. First operand has 44 places, 49 transitions, 135 flow. Second operand 5 states and 131 transitions. [2025-02-06 04:35:15,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 104 transitions, 473 flow [2025-02-06 04:35:15,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 104 transitions, 464 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-06 04:35:15,418 INFO L231 Difference]: Finished difference. Result has 50 places, 54 transitions, 185 flow [2025-02-06 04:35:15,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=185, PETRI_PLACES=50, PETRI_TRANSITIONS=54} [2025-02-06 04:35:15,419 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2025-02-06 04:35:15,419 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 54 transitions, 185 flow [2025-02-06 04:35:15,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:15,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:15,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:15,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:35:15,419 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:15,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:15,423 INFO L85 PathProgramCache]: Analyzing trace with hash -865469760, now seen corresponding path program 3 times [2025-02-06 04:35:15,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:15,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844701262] [2025-02-06 04:35:15,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:35:15,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:15,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:35:15,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:35:15,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:35:15,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:15,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:15,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844701262] [2025-02-06 04:35:15,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844701262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:15,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:15,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:15,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374514556] [2025-02-06 04:35:15,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:15,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:15,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:15,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:15,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:15,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:15,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 54 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:15,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:15,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:15,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:16,513 INFO L124 PetriNetUnfolderBase]: 5322/7640 cut-off events. [2025-02-06 04:35:16,513 INFO L125 PetriNetUnfolderBase]: For 3700/3700 co-relation queries the response was YES. [2025-02-06 04:35:16,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18022 conditions, 7640 events. 5322/7640 cut-off events. For 3700/3700 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 40297 event pairs, 2665 based on Foata normal form. 1/7421 useless extension candidates. Maximal degree in co-relation 12889. Up to 4828 conditions per place. [2025-02-06 04:35:16,566 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 90 selfloop transitions, 17 changer transitions 1/112 dead transitions. [2025-02-06 04:35:16,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 112 transitions, 575 flow [2025-02-06 04:35:16,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-02-06 04:35:16,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2025-02-06 04:35:16,568 INFO L175 Difference]: Start difference. First operand has 50 places, 54 transitions, 185 flow. Second operand 5 states and 135 transitions. [2025-02-06 04:35:16,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 112 transitions, 575 flow [2025-02-06 04:35:16,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 112 transitions, 566 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-06 04:35:16,607 INFO L231 Difference]: Finished difference. Result has 56 places, 64 transitions, 312 flow [2025-02-06 04:35:16,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=56, PETRI_TRANSITIONS=64} [2025-02-06 04:35:16,608 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2025-02-06 04:35:16,608 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 64 transitions, 312 flow [2025-02-06 04:35:16,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:16,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:16,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:16,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:35:16,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:16,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:16,609 INFO L85 PathProgramCache]: Analyzing trace with hash -282444556, now seen corresponding path program 4 times [2025-02-06 04:35:16,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:16,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009480217] [2025-02-06 04:35:16,609 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:35:16,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:16,621 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-02-06 04:35:16,626 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 24 statements. [2025-02-06 04:35:16,627 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:35:16,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:16,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:16,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009480217] [2025-02-06 04:35:16,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009480217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:16,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:16,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:16,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464714211] [2025-02-06 04:35:16,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:16,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:16,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:16,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:16,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:16,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:16,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 64 transitions, 312 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:16,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:16,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:16,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:17,687 INFO L124 PetriNetUnfolderBase]: 5933/8536 cut-off events. [2025-02-06 04:35:17,688 INFO L125 PetriNetUnfolderBase]: For 10731/10759 co-relation queries the response was YES. [2025-02-06 04:35:17,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23161 conditions, 8536 events. 5933/8536 cut-off events. For 10731/10759 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 46843 event pairs, 2853 based on Foata normal form. 1/8266 useless extension candidates. Maximal degree in co-relation 15654. Up to 5334 conditions per place. [2025-02-06 04:35:17,728 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 105 selfloop transitions, 19 changer transitions 2/130 dead transitions. [2025-02-06 04:35:17,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 130 transitions, 815 flow [2025-02-06 04:35:17,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-02-06 04:35:17,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2025-02-06 04:35:17,730 INFO L175 Difference]: Start difference. First operand has 56 places, 64 transitions, 312 flow. Second operand 5 states and 137 transitions. [2025-02-06 04:35:17,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 130 transitions, 815 flow [2025-02-06 04:35:17,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 130 transitions, 785 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-02-06 04:35:17,768 INFO L231 Difference]: Finished difference. Result has 62 places, 78 transitions, 490 flow [2025-02-06 04:35:17,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=490, PETRI_PLACES=62, PETRI_TRANSITIONS=78} [2025-02-06 04:35:17,770 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2025-02-06 04:35:17,770 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 490 flow [2025-02-06 04:35:17,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:17,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:17,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:17,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:35:17,771 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:17,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:17,772 INFO L85 PathProgramCache]: Analyzing trace with hash -396364416, now seen corresponding path program 5 times [2025-02-06 04:35:17,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:17,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627565651] [2025-02-06 04:35:17,772 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:35:17,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:17,785 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:35:17,798 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:35:17,799 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:35:17,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:18,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:18,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627565651] [2025-02-06 04:35:18,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627565651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:18,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:18,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:18,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29835375] [2025-02-06 04:35:18,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:18,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:18,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:18,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:18,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:18,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:18,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 490 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:18,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:18,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:18,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:18,923 INFO L124 PetriNetUnfolderBase]: 5913/8484 cut-off events. [2025-02-06 04:35:18,924 INFO L125 PetriNetUnfolderBase]: For 17772/17826 co-relation queries the response was YES. [2025-02-06 04:35:18,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25749 conditions, 8484 events. 5913/8484 cut-off events. For 17772/17826 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 45991 event pairs, 3000 based on Foata normal form. 1/8439 useless extension candidates. Maximal degree in co-relation 21050. Up to 5557 conditions per place. [2025-02-06 04:35:18,976 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 111 selfloop transitions, 10 changer transitions 3/128 dead transitions. [2025-02-06 04:35:18,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 128 transitions, 946 flow [2025-02-06 04:35:18,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-02-06 04:35:18,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2025-02-06 04:35:18,978 INFO L175 Difference]: Start difference. First operand has 62 places, 78 transitions, 490 flow. Second operand 5 states and 129 transitions. [2025-02-06 04:35:18,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 128 transitions, 946 flow [2025-02-06 04:35:19,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 128 transitions, 897 flow, removed 23 selfloop flow, removed 1 redundant places. [2025-02-06 04:35:19,038 INFO L231 Difference]: Finished difference. Result has 67 places, 78 transitions, 496 flow [2025-02-06 04:35:19,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=496, PETRI_PLACES=67, PETRI_TRANSITIONS=78} [2025-02-06 04:35:19,040 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2025-02-06 04:35:19,040 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 78 transitions, 496 flow [2025-02-06 04:35:19,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:19,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:19,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:19,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:35:19,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:19,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:19,041 INFO L85 PathProgramCache]: Analyzing trace with hash -494025906, now seen corresponding path program 6 times [2025-02-06 04:35:19,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:19,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152831610] [2025-02-06 04:35:19,042 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:35:19,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:19,057 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:35:19,065 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:35:19,065 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:35:19,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:19,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:19,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152831610] [2025-02-06 04:35:19,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152831610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:19,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:19,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:19,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813485672] [2025-02-06 04:35:19,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:19,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:19,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:19,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:19,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:19,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:19,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 78 transitions, 496 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:19,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:19,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:19,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:20,160 INFO L124 PetriNetUnfolderBase]: 6253/8975 cut-off events. [2025-02-06 04:35:20,161 INFO L125 PetriNetUnfolderBase]: For 18044/18044 co-relation queries the response was YES. [2025-02-06 04:35:20,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26989 conditions, 8975 events. 6253/8975 cut-off events. For 18044/18044 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 48921 event pairs, 2118 based on Foata normal form. 1/8954 useless extension candidates. Maximal degree in co-relation 26517. Up to 4246 conditions per place. [2025-02-06 04:35:20,204 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 97 selfloop transitions, 35 changer transitions 2/138 dead transitions. [2025-02-06 04:35:20,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 138 transitions, 1020 flow [2025-02-06 04:35:20,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-02-06 04:35:20,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-02-06 04:35:20,206 INFO L175 Difference]: Start difference. First operand has 67 places, 78 transitions, 496 flow. Second operand 5 states and 134 transitions. [2025-02-06 04:35:20,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 138 transitions, 1020 flow [2025-02-06 04:35:20,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 138 transitions, 991 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-02-06 04:35:20,256 INFO L231 Difference]: Finished difference. Result has 71 places, 90 transitions, 698 flow [2025-02-06 04:35:20,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=698, PETRI_PLACES=71, PETRI_TRANSITIONS=90} [2025-02-06 04:35:20,257 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2025-02-06 04:35:20,257 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 90 transitions, 698 flow [2025-02-06 04:35:20,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:20,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:20,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:20,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:35:20,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:20,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1106372436, now seen corresponding path program 1 times [2025-02-06 04:35:20,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:20,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979478128] [2025-02-06 04:35:20,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:20,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:20,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:35:20,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:35:20,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:20,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:20,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:20,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979478128] [2025-02-06 04:35:20,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979478128] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:20,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:20,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:20,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106924224] [2025-02-06 04:35:20,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:20,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:35:20,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:20,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:35:20,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:35:20,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:20,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 90 transitions, 698 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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-02-06 04:35:20,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:20,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:20,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:21,418 INFO L124 PetriNetUnfolderBase]: 10382/14609 cut-off events. [2025-02-06 04:35:21,419 INFO L125 PetriNetUnfolderBase]: For 42718/42746 co-relation queries the response was YES. [2025-02-06 04:35:21,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49112 conditions, 14609 events. 10382/14609 cut-off events. For 42718/42746 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 82153 event pairs, 3631 based on Foata normal form. 5/14588 useless extension candidates. Maximal degree in co-relation 44263. Up to 5751 conditions per place. [2025-02-06 04:35:21,482 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 149 selfloop transitions, 25 changer transitions 34/212 dead transitions. [2025-02-06 04:35:21,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 212 transitions, 1998 flow [2025-02-06 04:35:21,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:35:21,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:35:21,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2025-02-06 04:35:21,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49854227405247814 [2025-02-06 04:35:21,486 INFO L175 Difference]: Start difference. First operand has 71 places, 90 transitions, 698 flow. Second operand 7 states and 171 transitions. [2025-02-06 04:35:21,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 212 transitions, 1998 flow [2025-02-06 04:35:21,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 212 transitions, 1900 flow, removed 49 selfloop flow, removed 0 redundant places. [2025-02-06 04:35:21,620 INFO L231 Difference]: Finished difference. Result has 82 places, 103 transitions, 860 flow [2025-02-06 04:35:21,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=860, PETRI_PLACES=82, PETRI_TRANSITIONS=103} [2025-02-06 04:35:21,622 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2025-02-06 04:35:21,622 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 103 transitions, 860 flow [2025-02-06 04:35:21,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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-02-06 04:35:21,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:21,622 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] [2025-02-06 04:35:21,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:35:21,622 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:21,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:21,623 INFO L85 PathProgramCache]: Analyzing trace with hash -687261539, now seen corresponding path program 1 times [2025-02-06 04:35:21,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:21,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438579553] [2025-02-06 04:35:21,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:21,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:21,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:35:21,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:35:21,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:21,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:21,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:21,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438579553] [2025-02-06 04:35:21,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438579553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:21,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:21,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:35:21,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098427911] [2025-02-06 04:35:21,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:21,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:21,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:21,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:21,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:21,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:21,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 103 transitions, 860 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:21,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:21,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:21,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:23,239 INFO L124 PetriNetUnfolderBase]: 14790/20500 cut-off events. [2025-02-06 04:35:23,239 INFO L125 PetriNetUnfolderBase]: For 66177/66247 co-relation queries the response was YES. [2025-02-06 04:35:23,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73123 conditions, 20500 events. 14790/20500 cut-off events. For 66177/66247 co-relation queries the response was YES. Maximal size of possible extension queue 977. Compared 116036 event pairs, 4711 based on Foata normal form. 5/20453 useless extension candidates. Maximal degree in co-relation 73049. Up to 8847 conditions per place. [2025-02-06 04:35:23,392 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 164 selfloop transitions, 25 changer transitions 7/200 dead transitions. [2025-02-06 04:35:23,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 200 transitions, 1947 flow [2025-02-06 04:35:23,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:35:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:35:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2025-02-06 04:35:23,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5068027210884354 [2025-02-06 04:35:23,394 INFO L175 Difference]: Start difference. First operand has 82 places, 103 transitions, 860 flow. Second operand 6 states and 149 transitions. [2025-02-06 04:35:23,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 200 transitions, 1947 flow [2025-02-06 04:35:23,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 200 transitions, 1903 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-02-06 04:35:23,597 INFO L231 Difference]: Finished difference. Result has 88 places, 117 transitions, 1055 flow [2025-02-06 04:35:23,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1055, PETRI_PLACES=88, PETRI_TRANSITIONS=117} [2025-02-06 04:35:23,598 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2025-02-06 04:35:23,600 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 117 transitions, 1055 flow [2025-02-06 04:35:23,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:23,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:23,601 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] [2025-02-06 04:35:23,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:35:23,601 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:23,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:23,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1484275194, now seen corresponding path program 1 times [2025-02-06 04:35:23,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:23,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74375928] [2025-02-06 04:35:23,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:23,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:23,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:35:23,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:35:23,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:23,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:23,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:23,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74375928] [2025-02-06 04:35:23,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74375928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:23,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:23,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:23,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064551080] [2025-02-06 04:35:23,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:23,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:23,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:23,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:23,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:23,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:23,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 117 transitions, 1055 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:23,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:23,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:23,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:24,922 INFO L124 PetriNetUnfolderBase]: 13483/18987 cut-off events. [2025-02-06 04:35:24,922 INFO L125 PetriNetUnfolderBase]: For 65002/65002 co-relation queries the response was YES. [2025-02-06 04:35:24,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68943 conditions, 18987 events. 13483/18987 cut-off events. For 65002/65002 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 108156 event pairs, 4069 based on Foata normal form. 1/18954 useless extension candidates. Maximal degree in co-relation 60132. Up to 8604 conditions per place. [2025-02-06 04:35:25,062 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 165 selfloop transitions, 23 changer transitions 9/201 dead transitions. [2025-02-06 04:35:25,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 201 transitions, 2050 flow [2025-02-06 04:35:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:25,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-02-06 04:35:25,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-02-06 04:35:25,064 INFO L175 Difference]: Start difference. First operand has 88 places, 117 transitions, 1055 flow. Second operand 5 states and 133 transitions. [2025-02-06 04:35:25,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 201 transitions, 2050 flow [2025-02-06 04:35:25,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 201 transitions, 2008 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-02-06 04:35:25,223 INFO L231 Difference]: Finished difference. Result has 94 places, 129 transitions, 1278 flow [2025-02-06 04:35:25,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1278, PETRI_PLACES=94, PETRI_TRANSITIONS=129} [2025-02-06 04:35:25,224 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2025-02-06 04:35:25,225 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 129 transitions, 1278 flow [2025-02-06 04:35:25,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:25,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:25,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] [2025-02-06 04:35:25,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:35:25,225 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:25,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:25,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1108052336, now seen corresponding path program 2 times [2025-02-06 04:35:25,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:25,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244338184] [2025-02-06 04:35:25,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:35:25,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:25,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:35:25,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:35:25,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:35:25,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:25,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:25,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244338184] [2025-02-06 04:35:25,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244338184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:25,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:25,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:25,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666733713] [2025-02-06 04:35:25,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:25,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:25,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:25,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:25,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:25,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:25,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 129 transitions, 1278 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:25,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:25,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:25,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:26,427 INFO L124 PetriNetUnfolderBase]: 13342/18711 cut-off events. [2025-02-06 04:35:26,427 INFO L125 PetriNetUnfolderBase]: For 79660/79704 co-relation queries the response was YES. [2025-02-06 04:35:26,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69435 conditions, 18711 events. 13342/18711 cut-off events. For 79660/79704 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 105652 event pairs, 6881 based on Foata normal form. 1/18639 useless extension candidates. Maximal degree in co-relation 63300. Up to 12893 conditions per place. [2025-02-06 04:35:26,535 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 139 selfloop transitions, 20 changer transitions 16/179 dead transitions. [2025-02-06 04:35:26,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 179 transitions, 1830 flow [2025-02-06 04:35:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-02-06 04:35:26,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2025-02-06 04:35:26,536 INFO L175 Difference]: Start difference. First operand has 94 places, 129 transitions, 1278 flow. Second operand 5 states and 130 transitions. [2025-02-06 04:35:26,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 179 transitions, 1830 flow [2025-02-06 04:35:26,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 179 transitions, 1813 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:35:26,695 INFO L231 Difference]: Finished difference. Result has 98 places, 126 transitions, 1261 flow [2025-02-06 04:35:26,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1269, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1261, PETRI_PLACES=98, PETRI_TRANSITIONS=126} [2025-02-06 04:35:26,696 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places. [2025-02-06 04:35:26,696 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 126 transitions, 1261 flow [2025-02-06 04:35:26,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:26,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:26,696 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] [2025-02-06 04:35:26,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:35:26,697 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:26,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1234776276, now seen corresponding path program 3 times [2025-02-06 04:35:26,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:26,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168507614] [2025-02-06 04:35:26,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:35:26,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:26,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:35:26,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:35:26,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:35:26,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:26,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:26,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168507614] [2025-02-06 04:35:26,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168507614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:26,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:26,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:26,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641413154] [2025-02-06 04:35:26,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:26,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:26,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:26,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:26,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:26,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:26,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 126 transitions, 1261 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:26,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:26,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:26,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:28,201 INFO L124 PetriNetUnfolderBase]: 13385/18758 cut-off events. [2025-02-06 04:35:28,201 INFO L125 PetriNetUnfolderBase]: For 82108/82152 co-relation queries the response was YES. [2025-02-06 04:35:28,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70105 conditions, 18758 events. 13385/18758 cut-off events. For 82108/82152 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 105609 event pairs, 6696 based on Foata normal form. 1/18686 useless extension candidates. Maximal degree in co-relation 70030. Up to 12893 conditions per place. [2025-02-06 04:35:28,312 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 151 selfloop transitions, 26 changer transitions 9/190 dead transitions. [2025-02-06 04:35:28,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 190 transitions, 1968 flow [2025-02-06 04:35:28,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-02-06 04:35:28,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2025-02-06 04:35:28,313 INFO L175 Difference]: Start difference. First operand has 98 places, 126 transitions, 1261 flow. Second operand 5 states and 137 transitions. [2025-02-06 04:35:28,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 190 transitions, 1968 flow [2025-02-06 04:35:28,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 190 transitions, 1920 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-06 04:35:28,510 INFO L231 Difference]: Finished difference. Result has 99 places, 130 transitions, 1295 flow [2025-02-06 04:35:28,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1295, PETRI_PLACES=99, PETRI_TRANSITIONS=130} [2025-02-06 04:35:28,511 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 56 predicate places. [2025-02-06 04:35:28,511 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 130 transitions, 1295 flow [2025-02-06 04:35:28,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:28,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:28,511 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] [2025-02-06 04:35:28,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:35:28,511 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:28,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:28,511 INFO L85 PathProgramCache]: Analyzing trace with hash 393835810, now seen corresponding path program 4 times [2025-02-06 04:35:28,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:28,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936108105] [2025-02-06 04:35:28,512 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:35:28,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:28,519 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-02-06 04:35:28,522 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 26 statements. [2025-02-06 04:35:28,522 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:35:28,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:28,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:28,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936108105] [2025-02-06 04:35:28,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936108105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:28,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:28,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:28,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498536277] [2025-02-06 04:35:28,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:28,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:28,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:28,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:28,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:28,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:28,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 130 transitions, 1295 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:28,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:28,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:28,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:29,755 INFO L124 PetriNetUnfolderBase]: 13187/18460 cut-off events. [2025-02-06 04:35:29,755 INFO L125 PetriNetUnfolderBase]: For 87226/87270 co-relation queries the response was YES. [2025-02-06 04:35:29,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70295 conditions, 18460 events. 13187/18460 cut-off events. For 87226/87270 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 103664 event pairs, 7148 based on Foata normal form. 1/18406 useless extension candidates. Maximal degree in co-relation 66167. Up to 14470 conditions per place. [2025-02-06 04:35:29,862 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 148 selfloop transitions, 10 changer transitions 18/180 dead transitions. [2025-02-06 04:35:29,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 180 transitions, 1858 flow [2025-02-06 04:35:29,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-02-06 04:35:29,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2025-02-06 04:35:29,863 INFO L175 Difference]: Start difference. First operand has 99 places, 130 transitions, 1295 flow. Second operand 5 states and 128 transitions. [2025-02-06 04:35:29,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 180 transitions, 1858 flow [2025-02-06 04:35:30,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 180 transitions, 1816 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-02-06 04:35:30,073 INFO L231 Difference]: Finished difference. Result has 100 places, 125 transitions, 1189 flow [2025-02-06 04:35:30,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1257, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1189, PETRI_PLACES=100, PETRI_TRANSITIONS=125} [2025-02-06 04:35:30,073 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2025-02-06 04:35:30,073 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 125 transitions, 1189 flow [2025-02-06 04:35:30,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:30,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:30,074 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] [2025-02-06 04:35:30,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:35:30,074 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:30,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:30,074 INFO L85 PathProgramCache]: Analyzing trace with hash -987929018, now seen corresponding path program 5 times [2025-02-06 04:35:30,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:30,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442135927] [2025-02-06 04:35:30,075 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:35:30,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:30,082 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:35:30,090 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:35:30,090 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:35:30,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:30,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:30,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442135927] [2025-02-06 04:35:30,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442135927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:30,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:30,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:30,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780259873] [2025-02-06 04:35:30,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:30,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:30,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:30,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:30,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:30,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:30,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 125 transitions, 1189 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:30,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:30,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:30,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:31,299 INFO L124 PetriNetUnfolderBase]: 13582/19126 cut-off events. [2025-02-06 04:35:31,300 INFO L125 PetriNetUnfolderBase]: For 84878/84878 co-relation queries the response was YES. [2025-02-06 04:35:31,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72491 conditions, 19126 events. 13582/19126 cut-off events. For 84878/84878 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 109017 event pairs, 4108 based on Foata normal form. 1/19094 useless extension candidates. Maximal degree in co-relation 72415. Up to 9493 conditions per place. [2025-02-06 04:35:31,406 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 174 selfloop transitions, 9 changer transitions 10/197 dead transitions. [2025-02-06 04:35:31,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 197 transitions, 2024 flow [2025-02-06 04:35:31,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:31,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-02-06 04:35:31,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-02-06 04:35:31,407 INFO L175 Difference]: Start difference. First operand has 100 places, 125 transitions, 1189 flow. Second operand 5 states and 133 transitions. [2025-02-06 04:35:31,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 197 transitions, 2024 flow [2025-02-06 04:35:31,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 197 transitions, 1990 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-02-06 04:35:31,593 INFO L231 Difference]: Finished difference. Result has 102 places, 129 transitions, 1220 flow [2025-02-06 04:35:31,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1220, PETRI_PLACES=102, PETRI_TRANSITIONS=129} [2025-02-06 04:35:31,594 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places. [2025-02-06 04:35:31,594 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 129 transitions, 1220 flow [2025-02-06 04:35:31,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:31,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:31,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] [2025-02-06 04:35:31,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:35:31,595 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:31,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:31,595 INFO L85 PathProgramCache]: Analyzing trace with hash -891947968, now seen corresponding path program 6 times [2025-02-06 04:35:31,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:31,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15925716] [2025-02-06 04:35:31,595 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:35:31,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:31,602 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:35:31,608 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:35:31,608 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:35:31,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:31,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:31,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15925716] [2025-02-06 04:35:31,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15925716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:31,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:31,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:31,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354971958] [2025-02-06 04:35:31,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:31,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:31,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:31,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:31,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:31,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:31,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 129 transitions, 1220 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:31,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:31,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:31,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:33,178 INFO L124 PetriNetUnfolderBase]: 13567/19032 cut-off events. [2025-02-06 04:35:33,178 INFO L125 PetriNetUnfolderBase]: For 93451/93495 co-relation queries the response was YES. [2025-02-06 04:35:33,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73844 conditions, 19032 events. 13567/19032 cut-off events. For 93451/93495 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 107911 event pairs, 7153 based on Foata normal form. 1/18978 useless extension candidates. Maximal degree in co-relation 54008. Up to 14470 conditions per place. [2025-02-06 04:35:33,291 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 162 selfloop transitions, 15 changer transitions 10/191 dead transitions. [2025-02-06 04:35:33,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 191 transitions, 1906 flow [2025-02-06 04:35:33,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:33,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-02-06 04:35:33,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-02-06 04:35:33,293 INFO L175 Difference]: Start difference. First operand has 102 places, 129 transitions, 1220 flow. Second operand 5 states and 134 transitions. [2025-02-06 04:35:33,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 191 transitions, 1906 flow [2025-02-06 04:35:33,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 191 transitions, 1885 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-02-06 04:35:33,511 INFO L231 Difference]: Finished difference. Result has 107 places, 131 transitions, 1218 flow [2025-02-06 04:35:33,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1218, PETRI_PLACES=107, PETRI_TRANSITIONS=131} [2025-02-06 04:35:33,512 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 64 predicate places. [2025-02-06 04:35:33,512 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 131 transitions, 1218 flow [2025-02-06 04:35:33,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:33,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:33,512 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] [2025-02-06 04:35:33,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 04:35:33,512 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:33,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:33,513 INFO L85 PathProgramCache]: Analyzing trace with hash -995900130, now seen corresponding path program 1 times [2025-02-06 04:35:33,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:33,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348367115] [2025-02-06 04:35:33,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:33,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:33,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 04:35:33,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:35:33,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:33,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:35:33,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:33,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348367115] [2025-02-06 04:35:33,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348367115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:33,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:33,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:33,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295437281] [2025-02-06 04:35:33,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:33,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:33,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:33,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:33,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:33,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:33,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 131 transitions, 1218 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:33,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:33,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:33,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:34,894 INFO L124 PetriNetUnfolderBase]: 14553/20576 cut-off events. [2025-02-06 04:35:34,895 INFO L125 PetriNetUnfolderBase]: For 102581/102625 co-relation queries the response was YES. [2025-02-06 04:35:34,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80362 conditions, 20576 events. 14553/20576 cut-off events. For 102581/102625 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 120000 event pairs, 7176 based on Foata normal form. 1/20526 useless extension candidates. Maximal degree in co-relation 64342. Up to 13769 conditions per place. [2025-02-06 04:35:35,033 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 173 selfloop transitions, 18 changer transitions 3/198 dead transitions. [2025-02-06 04:35:35,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 198 transitions, 1967 flow [2025-02-06 04:35:35,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2025-02-06 04:35:35,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563265306122449 [2025-02-06 04:35:35,035 INFO L175 Difference]: Start difference. First operand has 107 places, 131 transitions, 1218 flow. Second operand 5 states and 138 transitions. [2025-02-06 04:35:35,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 198 transitions, 1967 flow [2025-02-06 04:35:35,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 198 transitions, 1919 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-02-06 04:35:35,197 INFO L231 Difference]: Finished difference. Result has 111 places, 135 transitions, 1302 flow [2025-02-06 04:35:35,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1302, PETRI_PLACES=111, PETRI_TRANSITIONS=135} [2025-02-06 04:35:35,197 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places. [2025-02-06 04:35:35,197 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 135 transitions, 1302 flow [2025-02-06 04:35:35,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:35,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:35,198 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] [2025-02-06 04:35:35,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 04:35:35,198 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:35,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:35,198 INFO L85 PathProgramCache]: Analyzing trace with hash -497890148, now seen corresponding path program 2 times [2025-02-06 04:35:35,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:35,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765723048] [2025-02-06 04:35:35,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:35:35,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:35,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:35:35,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-02-06 04:35:35,219 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:35:35,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:35:35,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:35,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765723048] [2025-02-06 04:35:35,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765723048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:35,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:35,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:35,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429336201] [2025-02-06 04:35:35,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:35,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:35,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:35,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:35,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:35,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:35,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 135 transitions, 1302 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:35,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:35,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:35,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:36,908 INFO L124 PetriNetUnfolderBase]: 14391/20634 cut-off events. [2025-02-06 04:35:36,908 INFO L125 PetriNetUnfolderBase]: For 112546/112634 co-relation queries the response was YES. [2025-02-06 04:35:36,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81024 conditions, 20634 events. 14391/20634 cut-off events. For 112546/112634 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 125484 event pairs, 4022 based on Foata normal form. 1/20627 useless extension candidates. Maximal degree in co-relation 75352. Up to 9519 conditions per place. [2025-02-06 04:35:37,020 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 188 selfloop transitions, 19 changer transitions 3/214 dead transitions. [2025-02-06 04:35:37,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 214 transitions, 2338 flow [2025-02-06 04:35:37,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-02-06 04:35:37,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2025-02-06 04:35:37,021 INFO L175 Difference]: Start difference. First operand has 111 places, 135 transitions, 1302 flow. Second operand 5 states and 137 transitions. [2025-02-06 04:35:37,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 214 transitions, 2338 flow [2025-02-06 04:35:37,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 214 transitions, 2316 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-06 04:35:37,161 INFO L231 Difference]: Finished difference. Result has 117 places, 146 transitions, 1610 flow [2025-02-06 04:35:37,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1610, PETRI_PLACES=117, PETRI_TRANSITIONS=146} [2025-02-06 04:35:37,161 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 74 predicate places. [2025-02-06 04:35:37,161 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 146 transitions, 1610 flow [2025-02-06 04:35:37,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:37,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:37,162 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] [2025-02-06 04:35:37,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 04:35:37,162 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:37,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:37,162 INFO L85 PathProgramCache]: Analyzing trace with hash 209587556, now seen corresponding path program 3 times [2025-02-06 04:35:37,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:37,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301207423] [2025-02-06 04:35:37,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:35:37,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:37,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:35:37,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-02-06 04:35:37,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:35:37,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:35:37,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:37,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301207423] [2025-02-06 04:35:37,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301207423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:37,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:37,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:37,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002571141] [2025-02-06 04:35:37,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:37,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:37,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:37,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:37,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:37,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:37,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 146 transitions, 1610 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:37,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:37,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:37,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:38,913 INFO L124 PetriNetUnfolderBase]: 14229/20100 cut-off events. [2025-02-06 04:35:38,914 INFO L125 PetriNetUnfolderBase]: For 122266/122310 co-relation queries the response was YES. [2025-02-06 04:35:38,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81568 conditions, 20100 events. 14229/20100 cut-off events. For 122266/122310 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 116636 event pairs, 7300 based on Foata normal form. 1/20050 useless extension candidates. Maximal degree in co-relation 77467. Up to 13769 conditions per place. [2025-02-06 04:35:39,013 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 156 selfloop transitions, 30 changer transitions 8/198 dead transitions. [2025-02-06 04:35:39,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 198 transitions, 2230 flow [2025-02-06 04:35:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:39,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-02-06 04:35:39,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-02-06 04:35:39,015 INFO L175 Difference]: Start difference. First operand has 117 places, 146 transitions, 1610 flow. Second operand 5 states and 133 transitions. [2025-02-06 04:35:39,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 198 transitions, 2230 flow [2025-02-06 04:35:39,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 198 transitions, 2196 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-02-06 04:35:39,205 INFO L231 Difference]: Finished difference. Result has 121 places, 143 transitions, 1612 flow [2025-02-06 04:35:39,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1612, PETRI_PLACES=121, PETRI_TRANSITIONS=143} [2025-02-06 04:35:39,206 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 78 predicate places. [2025-02-06 04:35:39,206 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 143 transitions, 1612 flow [2025-02-06 04:35:39,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:39,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:39,206 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] [2025-02-06 04:35:39,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 04:35:39,206 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:39,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:39,207 INFO L85 PathProgramCache]: Analyzing trace with hash -571069580, now seen corresponding path program 4 times [2025-02-06 04:35:39,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:39,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856586979] [2025-02-06 04:35:39,207 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:35:39,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:39,213 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:35:39,216 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-02-06 04:35:39,216 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:35:39,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:35:39,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:39,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856586979] [2025-02-06 04:35:39,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856586979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:39,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:39,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:39,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533182593] [2025-02-06 04:35:39,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:39,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:39,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:39,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:39,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:39,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:39,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 143 transitions, 1612 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:39,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:39,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:39,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:41,268 INFO L124 PetriNetUnfolderBase]: 18003/25940 cut-off events. [2025-02-06 04:35:41,268 INFO L125 PetriNetUnfolderBase]: For 154194/154274 co-relation queries the response was YES. [2025-02-06 04:35:41,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103982 conditions, 25940 events. 18003/25940 cut-off events. For 154194/154274 co-relation queries the response was YES. Maximal size of possible extension queue 1283. Compared 164555 event pairs, 2747 based on Foata normal form. 1/25935 useless extension candidates. Maximal degree in co-relation 101829. Up to 8395 conditions per place. [2025-02-06 04:35:41,496 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 221 selfloop transitions, 39 changer transitions 4/268 dead transitions. [2025-02-06 04:35:41,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 268 transitions, 3073 flow [2025-02-06 04:35:41,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:35:41,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:35:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2025-02-06 04:35:41,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020408163265306 [2025-02-06 04:35:41,497 INFO L175 Difference]: Start difference. First operand has 121 places, 143 transitions, 1612 flow. Second operand 6 states and 177 transitions. [2025-02-06 04:35:41,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 268 transitions, 3073 flow [2025-02-06 04:35:41,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 268 transitions, 2966 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-02-06 04:35:41,848 INFO L231 Difference]: Finished difference. Result has 126 places, 162 transitions, 1937 flow [2025-02-06 04:35:41,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1937, PETRI_PLACES=126, PETRI_TRANSITIONS=162} [2025-02-06 04:35:41,849 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places. [2025-02-06 04:35:41,849 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 162 transitions, 1937 flow [2025-02-06 04:35:41,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:41,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:41,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] [2025-02-06 04:35:41,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 04:35:41,850 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:41,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:41,850 INFO L85 PathProgramCache]: Analyzing trace with hash 517431162, now seen corresponding path program 5 times [2025-02-06 04:35:41,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:41,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201395460] [2025-02-06 04:35:41,850 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:35:41,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:41,858 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:35:41,865 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:35:41,865 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:35:41,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:35:41,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:41,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201395460] [2025-02-06 04:35:41,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201395460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:41,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:41,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:41,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126260019] [2025-02-06 04:35:41,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:41,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:41,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:41,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:41,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:41,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:41,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 162 transitions, 1937 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:41,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:41,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:41,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:44,039 INFO L124 PetriNetUnfolderBase]: 17821/25490 cut-off events. [2025-02-06 04:35:44,039 INFO L125 PetriNetUnfolderBase]: For 186118/186118 co-relation queries the response was YES. [2025-02-06 04:35:44,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107942 conditions, 25490 events. 17821/25490 cut-off events. For 186118/186118 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 156817 event pairs, 6002 based on Foata normal form. 1/25475 useless extension candidates. Maximal degree in co-relation 103963. Up to 13776 conditions per place. [2025-02-06 04:35:44,220 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 163 selfloop transitions, 50 changer transitions 8/225 dead transitions. [2025-02-06 04:35:44,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 225 transitions, 2767 flow [2025-02-06 04:35:44,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-02-06 04:35:44,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-02-06 04:35:44,221 INFO L175 Difference]: Start difference. First operand has 126 places, 162 transitions, 1937 flow. Second operand 5 states and 133 transitions. [2025-02-06 04:35:44,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 225 transitions, 2767 flow [2025-02-06 04:35:44,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 225 transitions, 2695 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-02-06 04:35:44,808 INFO L231 Difference]: Finished difference. Result has 131 places, 158 transitions, 1913 flow [2025-02-06 04:35:44,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1913, PETRI_PLACES=131, PETRI_TRANSITIONS=158} [2025-02-06 04:35:44,809 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 88 predicate places. [2025-02-06 04:35:44,809 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 158 transitions, 1913 flow [2025-02-06 04:35:44,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:44,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:44,809 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] [2025-02-06 04:35:44,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 04:35:44,809 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:44,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:44,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1569987560, now seen corresponding path program 6 times [2025-02-06 04:35:44,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:44,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759456586] [2025-02-06 04:35:44,810 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:35:44,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:44,815 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:35:44,820 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-02-06 04:35:44,821 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:35:44,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:35:44,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:44,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759456586] [2025-02-06 04:35:44,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759456586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:44,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:44,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:44,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618780013] [2025-02-06 04:35:44,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:44,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:44,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:44,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:44,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:44,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:44,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 158 transitions, 1913 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:44,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:44,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:44,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:46,844 INFO L124 PetriNetUnfolderBase]: 18133/26002 cut-off events. [2025-02-06 04:35:46,844 INFO L125 PetriNetUnfolderBase]: For 182050/182050 co-relation queries the response was YES. [2025-02-06 04:35:46,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107832 conditions, 26002 events. 18133/26002 cut-off events. For 182050/182050 co-relation queries the response was YES. Maximal size of possible extension queue 1267. Compared 161814 event pairs, 3686 based on Foata normal form. 1/25975 useless extension candidates. Maximal degree in co-relation 105741. Up to 9045 conditions per place. [2025-02-06 04:35:47,068 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 203 selfloop transitions, 67 changer transitions 4/278 dead transitions. [2025-02-06 04:35:47,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 278 transitions, 3366 flow [2025-02-06 04:35:47,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:35:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:35:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2025-02-06 04:35:47,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-02-06 04:35:47,070 INFO L175 Difference]: Start difference. First operand has 131 places, 158 transitions, 1913 flow. Second operand 6 states and 175 transitions. [2025-02-06 04:35:47,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 278 transitions, 3366 flow [2025-02-06 04:35:47,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 278 transitions, 3251 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-02-06 04:35:47,484 INFO L231 Difference]: Finished difference. Result has 136 places, 169 transitions, 2179 flow [2025-02-06 04:35:47,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2179, PETRI_PLACES=136, PETRI_TRANSITIONS=169} [2025-02-06 04:35:47,485 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 93 predicate places. [2025-02-06 04:35:47,485 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 169 transitions, 2179 flow [2025-02-06 04:35:47,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:47,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:47,485 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] [2025-02-06 04:35:47,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 04:35:47,486 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:47,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:47,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1705510005, now seen corresponding path program 1 times [2025-02-06 04:35:47,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:47,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606279374] [2025-02-06 04:35:47,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:47,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:47,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 04:35:47,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:35:47,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:47,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:47,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:47,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606279374] [2025-02-06 04:35:47,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606279374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:47,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:47,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:35:47,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657052415] [2025-02-06 04:35:47,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:47,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:47,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:47,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:47,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:47,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:47,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 169 transitions, 2179 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:47,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:47,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:47,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:49,696 INFO L124 PetriNetUnfolderBase]: 18939/27667 cut-off events. [2025-02-06 04:35:49,696 INFO L125 PetriNetUnfolderBase]: For 215106/215106 co-relation queries the response was YES. [2025-02-06 04:35:49,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117755 conditions, 27667 events. 18939/27667 cut-off events. For 215106/215106 co-relation queries the response was YES. Maximal size of possible extension queue 1367. Compared 181063 event pairs, 11090 based on Foata normal form. 530/28186 useless extension candidates. Maximal degree in co-relation 114202. Up to 17556 conditions per place. [2025-02-06 04:35:49,928 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 232 selfloop transitions, 9 changer transitions 65/310 dead transitions. [2025-02-06 04:35:49,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 310 transitions, 4493 flow [2025-02-06 04:35:49,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:35:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:35:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-02-06 04:35:49,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4931972789115646 [2025-02-06 04:35:49,929 INFO L175 Difference]: Start difference. First operand has 136 places, 169 transitions, 2179 flow. Second operand 6 states and 145 transitions. [2025-02-06 04:35:49,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 310 transitions, 4493 flow [2025-02-06 04:35:50,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 310 transitions, 4395 flow, removed 46 selfloop flow, removed 1 redundant places. [2025-02-06 04:35:50,596 INFO L231 Difference]: Finished difference. Result has 143 places, 166 transitions, 2144 flow [2025-02-06 04:35:50,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2071, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2144, PETRI_PLACES=143, PETRI_TRANSITIONS=166} [2025-02-06 04:35:50,597 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 100 predicate places. [2025-02-06 04:35:50,597 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 166 transitions, 2144 flow [2025-02-06 04:35:50,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:50,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:50,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:50,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 04:35:50,598 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:50,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:50,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1669589348, now seen corresponding path program 1 times [2025-02-06 04:35:50,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:50,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658583368] [2025-02-06 04:35:50,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:50,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:50,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 04:35:50,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:35:50,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:50,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:35:50,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:50,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658583368] [2025-02-06 04:35:50,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658583368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:50,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:50,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:50,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151356048] [2025-02-06 04:35:50,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:50,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:50,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:50,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:50,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:50,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:50,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 166 transitions, 2144 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:50,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:50,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:50,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:53,058 INFO L124 PetriNetUnfolderBase]: 18533/26924 cut-off events. [2025-02-06 04:35:53,058 INFO L125 PetriNetUnfolderBase]: For 197720/197720 co-relation queries the response was YES. [2025-02-06 04:35:53,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112901 conditions, 26924 events. 18533/26924 cut-off events. For 197720/197720 co-relation queries the response was YES. Maximal size of possible extension queue 1355. Compared 174889 event pairs, 8275 based on Foata normal form. 1/26912 useless extension candidates. Maximal degree in co-relation 107446. Up to 14446 conditions per place. [2025-02-06 04:35:53,371 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 210 selfloop transitions, 20 changer transitions 3/237 dead transitions. [2025-02-06 04:35:53,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 237 transitions, 3086 flow [2025-02-06 04:35:53,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-02-06 04:35:53,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5673469387755102 [2025-02-06 04:35:53,372 INFO L175 Difference]: Start difference. First operand has 143 places, 166 transitions, 2144 flow. Second operand 5 states and 139 transitions. [2025-02-06 04:35:53,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 237 transitions, 3086 flow [2025-02-06 04:35:54,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 237 transitions, 3053 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-02-06 04:35:54,122 INFO L231 Difference]: Finished difference. Result has 145 places, 175 transitions, 2348 flow [2025-02-06 04:35:54,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2123, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2348, PETRI_PLACES=145, PETRI_TRANSITIONS=175} [2025-02-06 04:35:54,123 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places. [2025-02-06 04:35:54,123 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 175 transitions, 2348 flow [2025-02-06 04:35:54,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:54,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:54,123 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] [2025-02-06 04:35:54,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 04:35:54,123 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:54,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:54,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1588024236, now seen corresponding path program 2 times [2025-02-06 04:35:54,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:54,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831031184] [2025-02-06 04:35:54,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:35:54,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:54,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:35:54,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-02-06 04:35:54,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:35:54,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:35:54,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:54,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831031184] [2025-02-06 04:35:54,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831031184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:54,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:54,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:54,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207454094] [2025-02-06 04:35:54,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:54,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:54,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:54,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:54,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:54,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:54,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 175 transitions, 2348 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:54,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:54,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:54,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:56,298 INFO L124 PetriNetUnfolderBase]: 18515/26946 cut-off events. [2025-02-06 04:35:56,298 INFO L125 PetriNetUnfolderBase]: For 208835/208835 co-relation queries the response was YES. [2025-02-06 04:35:56,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112425 conditions, 26946 events. 18515/26946 cut-off events. For 208835/208835 co-relation queries the response was YES. Maximal size of possible extension queue 1321. Compared 174688 event pairs, 9531 based on Foata normal form. 1/26930 useless extension candidates. Maximal degree in co-relation 108981. Up to 21208 conditions per place. [2025-02-06 04:35:56,917 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 210 selfloop transitions, 22 changer transitions 3/239 dead transitions. [2025-02-06 04:35:56,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 239 transitions, 3212 flow [2025-02-06 04:35:56,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:56,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-02-06 04:35:56,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5551020408163265 [2025-02-06 04:35:56,919 INFO L175 Difference]: Start difference. First operand has 145 places, 175 transitions, 2348 flow. Second operand 5 states and 136 transitions. [2025-02-06 04:35:56,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 239 transitions, 3212 flow [2025-02-06 04:35:57,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 239 transitions, 3186 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-02-06 04:35:57,446 INFO L231 Difference]: Finished difference. Result has 150 places, 177 transitions, 2436 flow [2025-02-06 04:35:57,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2327, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2436, PETRI_PLACES=150, PETRI_TRANSITIONS=177} [2025-02-06 04:35:57,447 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 107 predicate places. [2025-02-06 04:35:57,447 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 177 transitions, 2436 flow [2025-02-06 04:35:57,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:57,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:57,447 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] [2025-02-06 04:35:57,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 04:35:57,447 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:35:57,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:57,447 INFO L85 PathProgramCache]: Analyzing trace with hash -478141022, now seen corresponding path program 3 times [2025-02-06 04:35:57,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:57,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326041823] [2025-02-06 04:35:57,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:35:57,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:57,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:35:57,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-02-06 04:35:57,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:35:57,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:35:57,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:57,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326041823] [2025-02-06 04:35:57,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326041823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:57,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:57,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:35:57,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585794207] [2025-02-06 04:35:57,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:57,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:57,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:57,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:57,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:35:57,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:35:57,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 177 transitions, 2436 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:57,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:57,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:35:57,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:00,278 INFO L124 PetriNetUnfolderBase]: 22195/32428 cut-off events. [2025-02-06 04:36:00,278 INFO L125 PetriNetUnfolderBase]: For 243914/243914 co-relation queries the response was YES. [2025-02-06 04:36:00,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134346 conditions, 32428 events. 22195/32428 cut-off events. For 243914/243914 co-relation queries the response was YES. Maximal size of possible extension queue 1623. Compared 216746 event pairs, 4877 based on Foata normal form. 1/32424 useless extension candidates. Maximal degree in co-relation 131938. Up to 8478 conditions per place. [2025-02-06 04:36:00,488 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 213 selfloop transitions, 63 changer transitions 4/284 dead transitions. [2025-02-06 04:36:00,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 284 transitions, 3740 flow [2025-02-06 04:36:00,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:36:00,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:36:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2025-02-06 04:36:00,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020408163265306 [2025-02-06 04:36:00,489 INFO L175 Difference]: Start difference. First operand has 150 places, 177 transitions, 2436 flow. Second operand 6 states and 177 transitions. [2025-02-06 04:36:00,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 284 transitions, 3740 flow [2025-02-06 04:36:01,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 284 transitions, 3697 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-02-06 04:36:01,088 INFO L231 Difference]: Finished difference. Result has 158 places, 192 transitions, 2910 flow [2025-02-06 04:36:01,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2407, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2910, PETRI_PLACES=158, PETRI_TRANSITIONS=192} [2025-02-06 04:36:01,089 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places. [2025-02-06 04:36:01,089 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 192 transitions, 2910 flow [2025-02-06 04:36:01,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:01,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:01,089 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] [2025-02-06 04:36:01,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 04:36:01,089 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:01,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:01,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1257761300, now seen corresponding path program 4 times [2025-02-06 04:36:01,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:01,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562625351] [2025-02-06 04:36:01,090 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:36:01,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:01,096 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:36:01,098 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-02-06 04:36:01,098 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:36:01,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:36:01,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:01,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562625351] [2025-02-06 04:36:01,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562625351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:01,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:01,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:36:01,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104063736] [2025-02-06 04:36:01,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:01,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:36:01,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:01,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:36:01,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:36:01,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:36:01,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 192 transitions, 2910 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:01,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:01,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:36:01,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:04,617 INFO L124 PetriNetUnfolderBase]: 22078/32203 cut-off events. [2025-02-06 04:36:04,618 INFO L125 PetriNetUnfolderBase]: For 286294/286294 co-relation queries the response was YES. [2025-02-06 04:36:04,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141962 conditions, 32203 events. 22078/32203 cut-off events. For 286294/286294 co-relation queries the response was YES. Maximal size of possible extension queue 1614. Compared 214866 event pairs, 12111 based on Foata normal form. 1/32187 useless extension candidates. Maximal degree in co-relation 139735. Up to 26344 conditions per place. [2025-02-06 04:36:04,902 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 204 selfloop transitions, 28 changer transitions 7/243 dead transitions. [2025-02-06 04:36:04,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 243 transitions, 3643 flow [2025-02-06 04:36:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:36:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:36:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-02-06 04:36:04,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-02-06 04:36:04,903 INFO L175 Difference]: Start difference. First operand has 158 places, 192 transitions, 2910 flow. Second operand 5 states and 131 transitions. [2025-02-06 04:36:04,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 243 transitions, 3643 flow [2025-02-06 04:36:06,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 243 transitions, 3607 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-02-06 04:36:06,315 INFO L231 Difference]: Finished difference. Result has 162 places, 188 transitions, 2877 flow [2025-02-06 04:36:06,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2876, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2877, PETRI_PLACES=162, PETRI_TRANSITIONS=188} [2025-02-06 04:36:06,315 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places. [2025-02-06 04:36:06,315 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 188 transitions, 2877 flow [2025-02-06 04:36:06,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:06,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:06,316 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] [2025-02-06 04:36:06,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 04:36:06,316 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:06,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:06,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1262569122, now seen corresponding path program 5 times [2025-02-06 04:36:06,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:06,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123021245] [2025-02-06 04:36:06,317 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:36:06,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:06,323 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:36:06,328 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:36:06,329 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:36:06,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:36:06,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:06,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123021245] [2025-02-06 04:36:06,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123021245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:06,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:06,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:36:06,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090677579] [2025-02-06 04:36:06,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:06,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:36:06,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:06,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:36:06,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:36:06,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:36:06,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 188 transitions, 2877 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:06,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:06,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:36:06,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:09,587 INFO L124 PetriNetUnfolderBase]: 21949/32070 cut-off events. [2025-02-06 04:36:09,587 INFO L125 PetriNetUnfolderBase]: For 289573/289573 co-relation queries the response was YES. [2025-02-06 04:36:09,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140870 conditions, 32070 events. 21949/32070 cut-off events. For 289573/289573 co-relation queries the response was YES. Maximal size of possible extension queue 1602. Compared 213973 event pairs, 4696 based on Foata normal form. 1/32062 useless extension candidates. Maximal degree in co-relation 139265. Up to 12566 conditions per place. [2025-02-06 04:36:09,851 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 197 selfloop transitions, 81 changer transitions 4/286 dead transitions. [2025-02-06 04:36:09,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 286 transitions, 4097 flow [2025-02-06 04:36:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:36:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:36:09,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2025-02-06 04:36:09,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5884353741496599 [2025-02-06 04:36:09,852 INFO L175 Difference]: Start difference. First operand has 162 places, 188 transitions, 2877 flow. Second operand 6 states and 173 transitions. [2025-02-06 04:36:09,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 286 transitions, 4097 flow [2025-02-06 04:36:10,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 286 transitions, 3990 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-06 04:36:10,981 INFO L231 Difference]: Finished difference. Result has 164 places, 191 transitions, 3115 flow [2025-02-06 04:36:10,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2788, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3115, PETRI_PLACES=164, PETRI_TRANSITIONS=191} [2025-02-06 04:36:10,981 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places. [2025-02-06 04:36:10,981 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 191 transitions, 3115 flow [2025-02-06 04:36:10,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:10,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:10,982 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] [2025-02-06 04:36:10,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 04:36:10,982 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:10,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:10,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2015145864, now seen corresponding path program 6 times [2025-02-06 04:36:10,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:10,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516398054] [2025-02-06 04:36:10,983 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:36:10,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:10,990 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:36:10,999 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-02-06 04:36:10,999 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:36:10,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:11,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:36:11,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:11,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516398054] [2025-02-06 04:36:11,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516398054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:11,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:11,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:36:11,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246030329] [2025-02-06 04:36:11,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:11,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:36:11,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:11,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:36:11,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:36:11,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:36:11,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 191 transitions, 3115 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:11,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:11,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:36:11,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:14,126 INFO L124 PetriNetUnfolderBase]: 21832/31800 cut-off events. [2025-02-06 04:36:14,127 INFO L125 PetriNetUnfolderBase]: For 339949/339949 co-relation queries the response was YES. [2025-02-06 04:36:14,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144789 conditions, 31800 events. 21832/31800 cut-off events. For 339949/339949 co-relation queries the response was YES. Maximal size of possible extension queue 1582. Compared 210343 event pairs, 9172 based on Foata normal form. 1/31784 useless extension candidates. Maximal degree in co-relation 143111. Up to 19274 conditions per place. [2025-02-06 04:36:14,381 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 163 selfloop transitions, 71 changer transitions 8/246 dead transitions. [2025-02-06 04:36:14,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 246 transitions, 3935 flow [2025-02-06 04:36:14,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:36:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:36:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-02-06 04:36:14,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-02-06 04:36:14,382 INFO L175 Difference]: Start difference. First operand has 164 places, 191 transitions, 3115 flow. Second operand 5 states and 131 transitions. [2025-02-06 04:36:14,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 246 transitions, 3935 flow [2025-02-06 04:36:15,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 246 transitions, 3817 flow, removed 24 selfloop flow, removed 6 redundant places. [2025-02-06 04:36:15,858 INFO L231 Difference]: Finished difference. Result has 164 places, 192 transitions, 3261 flow [2025-02-06 04:36:15,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3001, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3261, PETRI_PLACES=164, PETRI_TRANSITIONS=192} [2025-02-06 04:36:15,859 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places. [2025-02-06 04:36:15,859 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 192 transitions, 3261 flow [2025-02-06 04:36:15,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:15,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:15,859 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-02-06 04:36:15,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 04:36:15,859 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:15,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash 615233887, now seen corresponding path program 1 times [2025-02-06 04:36:15,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:15,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480007465] [2025-02-06 04:36:15,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:15,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:36:15,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:36:15,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:15,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:36:15,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:15,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480007465] [2025-02-06 04:36:15,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480007465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:15,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:15,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:36:15,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474396397] [2025-02-06 04:36:15,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:15,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:36:15,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:15,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:36:15,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:36:15,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:36:15,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 192 transitions, 3261 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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-02-06 04:36:15,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:15,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:36:15,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:18,911 INFO L124 PetriNetUnfolderBase]: 20557/30884 cut-off events. [2025-02-06 04:36:18,912 INFO L125 PetriNetUnfolderBase]: For 342746/342746 co-relation queries the response was YES. [2025-02-06 04:36:19,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142624 conditions, 30884 events. 20557/30884 cut-off events. For 342746/342746 co-relation queries the response was YES. Maximal size of possible extension queue 1598. Compared 216978 event pairs, 12764 based on Foata normal form. 826/31703 useless extension candidates. Maximal degree in co-relation 138735. Up to 21018 conditions per place. [2025-02-06 04:36:19,113 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 243 selfloop transitions, 7 changer transitions 84/338 dead transitions. [2025-02-06 04:36:19,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 338 transitions, 6509 flow [2025-02-06 04:36:19,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:36:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:36:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2025-02-06 04:36:19,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-02-06 04:36:19,114 INFO L175 Difference]: Start difference. First operand has 164 places, 192 transitions, 3261 flow. Second operand 6 states and 140 transitions. [2025-02-06 04:36:19,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 338 transitions, 6509 flow [2025-02-06 04:36:20,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 338 transitions, 6183 flow, removed 70 selfloop flow, removed 5 redundant places. [2025-02-06 04:36:20,579 INFO L231 Difference]: Finished difference. Result has 164 places, 185 transitions, 3059 flow [2025-02-06 04:36:20,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3041, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3059, PETRI_PLACES=164, PETRI_TRANSITIONS=185} [2025-02-06 04:36:20,579 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places. [2025-02-06 04:36:20,579 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 185 transitions, 3059 flow [2025-02-06 04:36:20,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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-02-06 04:36:20,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:36:20,580 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-02-06 04:36:20,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 04:36:20,580 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:36:20,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:36:20,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1054523514, now seen corresponding path program 1 times [2025-02-06 04:36:20,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:36:20,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042624794] [2025-02-06 04:36:20,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:36:20,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:36:20,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:36:20,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:36:20,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:36:20,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:36:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:36:20,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:36:20,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042624794] [2025-02-06 04:36:20,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042624794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:36:20,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:36:20,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:36:20,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954391806] [2025-02-06 04:36:20,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:36:20,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:36:20,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:36:20,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:36:20,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:36:20,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-02-06 04:36:20,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 185 transitions, 3059 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:36:20,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:36:20,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-02-06 04:36:20,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:36:23,204 INFO L124 PetriNetUnfolderBase]: 18651/27484 cut-off events. [2025-02-06 04:36:23,204 INFO L125 PetriNetUnfolderBase]: For 272271/272271 co-relation queries the response was YES. [2025-02-06 04:36:23,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122562 conditions, 27484 events. 18651/27484 cut-off events. For 272271/272271 co-relation queries the response was YES. Maximal size of possible extension queue 1432. Compared 183871 event pairs, 8866 based on Foata normal form. 2/27470 useless extension candidates. Maximal degree in co-relation 101331. Up to 17999 conditions per place. [2025-02-06 04:36:23,469 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 197 selfloop transitions, 18 changer transitions 24/243 dead transitions. [2025-02-06 04:36:23,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 243 transitions, 3835 flow [2025-02-06 04:36:23,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:36:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:36:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-02-06 04:36:23,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5551020408163265 [2025-02-06 04:36:23,470 INFO L175 Difference]: Start difference. First operand has 164 places, 185 transitions, 3059 flow. Second operand 5 states and 136 transitions. [2025-02-06 04:36:23,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 243 transitions, 3835 flow