./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:46:04,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:46:04,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:46:04,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:46:04,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:46:04,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:46:04,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:46:04,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:46:04,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:46:04,431 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:46:04,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:46:04,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:46:04,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:46:04,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:46:04,433 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:46:04,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:46:04,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:46:04,433 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:46:04,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:46:04,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:46:04,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:46:04,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:46:04,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:46:04,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:46:04,434 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:46:04,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:46:04,434 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:46:04,434 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:46:04,434 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:46:04,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:46:04,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:46:04,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:46:04,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:46:04,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:46:04,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:46:04,435 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:46:04,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:46:04,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:46:04,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:46:04,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:46:04,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:46:04,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:46:04,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:46:04,436 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 [2025-03-17 06:46:04,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:46:04,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:46:04,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:46:04,674 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:46:04,674 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:46:04,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-03-17 06:46:05,838 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/204f33a1b/4fbc4390393b40c6a15ac65534c70289/FLAG0f4728f08 [2025-03-17 06:46:06,084 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:46:06,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-03-17 06:46:06,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/204f33a1b/4fbc4390393b40c6a15ac65534c70289/FLAG0f4728f08 [2025-03-17 06:46:06,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/204f33a1b/4fbc4390393b40c6a15ac65534c70289 [2025-03-17 06:46:06,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:46:06,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:46:06,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:46:06,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:46:06,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:46:06,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:46:06" (1/1) ... [2025-03-17 06:46:06,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:06, skipping insertion in model container [2025-03-17 06:46:06,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:46:06" (1/1) ... [2025-03-17 06:46:06,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:46:06,558 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c[2996,3009] [2025-03-17 06:46:06,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:46:06,570 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:46:06,591 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c[2996,3009] [2025-03-17 06:46:06,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:46:06,603 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:46:06,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:06 WrapperNode [2025-03-17 06:46:06,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:46:06,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:46:06,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:46:06,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:46:06,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:06" (1/1) ... [2025-03-17 06:46:06,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:06" (1/1) ... [2025-03-17 06:46:06,631 INFO L138 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-03-17 06:46:06,632 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:46:06,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:46:06,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:46:06,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:46:06,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:06" (1/1) ... [2025-03-17 06:46:06,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:06" (1/1) ... [2025-03-17 06:46:06,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:06" (1/1) ... [2025-03-17 06:46:06,654 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 06:46:06,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:06" (1/1) ... [2025-03-17 06:46:06,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:06" (1/1) ... [2025-03-17 06:46:06,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:06" (1/1) ... [2025-03-17 06:46:06,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:06" (1/1) ... [2025-03-17 06:46:06,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:06" (1/1) ... [2025-03-17 06:46:06,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:06" (1/1) ... [2025-03-17 06:46:06,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:46:06,661 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:46:06,661 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:46:06,661 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:46:06,661 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:06" (1/1) ... [2025-03-17 06:46:06,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:46:06,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:06,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:46:06,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:46:06,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:46:06,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 06:46:06,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 06:46:06,705 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 06:46:06,705 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 06:46:06,705 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 06:46:06,705 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 06:46:06,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:46:06,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 06:46:06,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 06:46:06,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:46:06,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:46:06,706 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:46:06,778 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:46:06,780 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:46:06,956 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:46:06,956 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:46:07,070 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:46:07,070 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:46:07,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:46:07 BoogieIcfgContainer [2025-03-17 06:46:07,071 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:46:07,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:46:07,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:46:07,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:46:07,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:46:06" (1/3) ... [2025-03-17 06:46:07,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d41940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:46:07, skipping insertion in model container [2025-03-17 06:46:07,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:06" (2/3) ... [2025-03-17 06:46:07,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d41940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:46:07, skipping insertion in model container [2025-03-17 06:46:07,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:46:07" (3/3) ... [2025-03-17 06:46:07,077 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2025-03-17 06:46:07,088 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:46:07,089 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-threaded-sum-3.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-17 06:46:07,089 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:46:07,131 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 06:46:07,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 91 flow [2025-03-17 06:46:07,189 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-03-17 06:46:07,191 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 06:46:07,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 3/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-03-17 06:46:07,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 35 transitions, 91 flow [2025-03-17 06:46:07,196 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 31 transitions, 80 flow [2025-03-17 06:46:07,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:46:07,212 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;@25c9fcca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:46:07,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 06:46:07,222 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:46:07,223 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-03-17 06:46:07,223 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 06:46:07,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:07,223 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] [2025-03-17 06:46:07,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:46:07,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:07,228 INFO L85 PathProgramCache]: Analyzing trace with hash -756756640, now seen corresponding path program 1 times [2025-03-17 06:46:07,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:07,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084848043] [2025-03-17 06:46:07,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:07,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:07,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 06:46:07,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 06:46:07,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:07,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:07,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:07,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084848043] [2025-03-17 06:46:07,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084848043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:07,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:07,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:46:07,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786923970] [2025-03-17 06:46:07,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:07,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:46:07,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:07,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:46:07,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:46:07,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-17 06:46:07,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:07,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:07,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-17 06:46:07,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:08,064 INFO L124 PetriNetUnfolderBase]: 644/1018 cut-off events. [2025-03-17 06:46:08,064 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-03-17 06:46:08,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 1018 events. 644/1018 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4532 event pairs, 47 based on Foata normal form. 35/1044 useless extension candidates. Maximal degree in co-relation 1805. Up to 727 conditions per place. [2025-03-17 06:46:08,075 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 43 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-03-17 06:46:08,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 236 flow [2025-03-17 06:46:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:46:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:46:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-17 06:46:08,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6357142857142857 [2025-03-17 06:46:08,088 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 80 flow. Second operand 4 states and 89 transitions. [2025-03-17 06:46:08,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 236 flow [2025-03-17 06:46:08,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 06:46:08,099 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 100 flow [2025-03-17 06:46:08,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-03-17 06:46:08,104 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-03-17 06:46:08,105 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 100 flow [2025-03-17 06:46:08,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:08,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:08,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:08,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:46:08,107 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:46:08,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:08,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1712773181, now seen corresponding path program 1 times [2025-03-17 06:46:08,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:08,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950643324] [2025-03-17 06:46:08,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:08,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:08,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 06:46:08,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 06:46:08,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:08,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:08,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:08,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950643324] [2025-03-17 06:46:08,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950643324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:08,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357397192] [2025-03-17 06:46:08,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:08,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:08,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:08,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:46:08,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:46:08,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 06:46:08,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 06:46:08,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:08,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:08,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 06:46:08,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:08,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:08,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:46:08,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357397192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:08,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:46:08,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-17 06:46:08,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519516348] [2025-03-17 06:46:08,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:08,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:46:08,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:08,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:46:08,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:46:08,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-03-17 06:46:08,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:08,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:08,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-03-17 06:46:08,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:08,980 INFO L124 PetriNetUnfolderBase]: 1225/1894 cut-off events. [2025-03-17 06:46:08,980 INFO L125 PetriNetUnfolderBase]: For 404/404 co-relation queries the response was YES. [2025-03-17 06:46:08,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4249 conditions, 1894 events. 1225/1894 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9354 event pairs, 384 based on Foata normal form. 28/1914 useless extension candidates. Maximal degree in co-relation 2782. Up to 1047 conditions per place. [2025-03-17 06:46:08,991 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 67 selfloop transitions, 20 changer transitions 0/93 dead transitions. [2025-03-17 06:46:08,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 93 transitions, 450 flow [2025-03-17 06:46:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:46:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:46:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2025-03-17 06:46:08,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2025-03-17 06:46:08,995 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 100 flow. Second operand 5 states and 120 transitions. [2025-03-17 06:46:08,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 93 transitions, 450 flow [2025-03-17 06:46:08,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 93 transitions, 450 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 06:46:08,996 INFO L231 Difference]: Finished difference. Result has 44 places, 53 transitions, 256 flow [2025-03-17 06:46:08,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=44, PETRI_TRANSITIONS=53} [2025-03-17 06:46:08,997 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-03-17 06:46:08,997 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 53 transitions, 256 flow [2025-03-17 06:46:08,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:08,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:08,997 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:09,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 06:46:09,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:09,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:46:09,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:09,204 INFO L85 PathProgramCache]: Analyzing trace with hash 712269045, now seen corresponding path program 2 times [2025-03-17 06:46:09,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:09,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794686118] [2025-03-17 06:46:09,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:46:09,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:09,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-17 06:46:09,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 06:46:09,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:46:09,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:09,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:09,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794686118] [2025-03-17 06:46:09,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794686118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:09,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:09,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:46:09,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817632517] [2025-03-17 06:46:09,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:09,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:46:09,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:09,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:46:09,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:46:09,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-17 06:46:09,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 53 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-03-17 06:46:09,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:09,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-17 06:46:09,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:09,646 INFO L124 PetriNetUnfolderBase]: 1125/1778 cut-off events. [2025-03-17 06:46:09,647 INFO L125 PetriNetUnfolderBase]: For 1978/1981 co-relation queries the response was YES. [2025-03-17 06:46:09,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5394 conditions, 1778 events. 1125/1778 cut-off events. For 1978/1981 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8764 event pairs, 186 based on Foata normal form. 82/1852 useless extension candidates. Maximal degree in co-relation 2348. Up to 896 conditions per place. [2025-03-17 06:46:09,661 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 70 selfloop transitions, 12 changer transitions 2/91 dead transitions. [2025-03-17 06:46:09,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 91 transitions, 600 flow [2025-03-17 06:46:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:46:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:46:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-17 06:46:09,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6357142857142857 [2025-03-17 06:46:09,663 INFO L175 Difference]: Start difference. First operand has 44 places, 53 transitions, 256 flow. Second operand 4 states and 89 transitions. [2025-03-17 06:46:09,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 91 transitions, 600 flow [2025-03-17 06:46:09,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 91 transitions, 600 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 06:46:09,668 INFO L231 Difference]: Finished difference. Result has 49 places, 62 transitions, 357 flow [2025-03-17 06:46:09,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=357, PETRI_PLACES=49, PETRI_TRANSITIONS=62} [2025-03-17 06:46:09,669 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-03-17 06:46:09,669 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 62 transitions, 357 flow [2025-03-17 06:46:09,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-03-17 06:46:09,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:09,670 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] [2025-03-17 06:46:09,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:46:09,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:46:09,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:09,671 INFO L85 PathProgramCache]: Analyzing trace with hash 982576485, now seen corresponding path program 1 times [2025-03-17 06:46:09,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:09,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279663781] [2025-03-17 06:46:09,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:09,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:09,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 06:46:09,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 06:46:09,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:09,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:46:09,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:09,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279663781] [2025-03-17 06:46:09,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279663781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:09,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:09,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:46:09,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977818941] [2025-03-17 06:46:09,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:09,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:46:09,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:09,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:46:09,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:46:09,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-17 06:46:09,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 62 transitions, 357 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 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-03-17 06:46:09,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:09,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-17 06:46:09,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:10,101 INFO L124 PetriNetUnfolderBase]: 1471/2298 cut-off events. [2025-03-17 06:46:10,101 INFO L125 PetriNetUnfolderBase]: For 3262/3262 co-relation queries the response was YES. [2025-03-17 06:46:10,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7413 conditions, 2298 events. 1471/2298 cut-off events. For 3262/3262 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 12090 event pairs, 224 based on Foata normal form. 72/2366 useless extension candidates. Maximal degree in co-relation 5120. Up to 1670 conditions per place. [2025-03-17 06:46:10,113 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 90 selfloop transitions, 10 changer transitions 2/109 dead transitions. [2025-03-17 06:46:10,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 109 transitions, 792 flow [2025-03-17 06:46:10,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:46:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:46:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-03-17 06:46:10,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6514285714285715 [2025-03-17 06:46:10,115 INFO L175 Difference]: Start difference. First operand has 49 places, 62 transitions, 357 flow. Second operand 5 states and 114 transitions. [2025-03-17 06:46:10,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 109 transitions, 792 flow [2025-03-17 06:46:10,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 109 transitions, 786 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-17 06:46:10,123 INFO L231 Difference]: Finished difference. Result has 56 places, 71 transitions, 470 flow [2025-03-17 06:46:10,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=470, PETRI_PLACES=56, PETRI_TRANSITIONS=71} [2025-03-17 06:46:10,124 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2025-03-17 06:46:10,124 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 71 transitions, 470 flow [2025-03-17 06:46:10,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 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-03-17 06:46:10,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:10,125 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] [2025-03-17 06:46:10,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:46:10,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:46:10,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:10,125 INFO L85 PathProgramCache]: Analyzing trace with hash 708705757, now seen corresponding path program 2 times [2025-03-17 06:46:10,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:10,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691038950] [2025-03-17 06:46:10,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:46:10,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:10,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-17 06:46:10,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 06:46:10,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:46:10,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:10,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:10,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691038950] [2025-03-17 06:46:10,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691038950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:10,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:10,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:46:10,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164925763] [2025-03-17 06:46:10,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:10,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:46:10,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:10,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:46:10,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:46:10,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-17 06:46:10,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 71 transitions, 470 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:10,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:10,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-17 06:46:10,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:10,592 INFO L124 PetriNetUnfolderBase]: 2075/3251 cut-off events. [2025-03-17 06:46:10,592 INFO L125 PetriNetUnfolderBase]: For 5957/5960 co-relation queries the response was YES. [2025-03-17 06:46:10,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11052 conditions, 3251 events. 2075/3251 cut-off events. For 5957/5960 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 18579 event pairs, 339 based on Foata normal form. 72/3315 useless extension candidates. Maximal degree in co-relation 6330. Up to 1924 conditions per place. [2025-03-17 06:46:10,613 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 91 selfloop transitions, 20 changer transitions 2/120 dead transitions. [2025-03-17 06:46:10,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 120 transitions, 951 flow [2025-03-17 06:46:10,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:46:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:46:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-03-17 06:46:10,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6514285714285715 [2025-03-17 06:46:10,615 INFO L175 Difference]: Start difference. First operand has 56 places, 71 transitions, 470 flow. Second operand 5 states and 114 transitions. [2025-03-17 06:46:10,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 120 transitions, 951 flow [2025-03-17 06:46:10,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 120 transitions, 937 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-17 06:46:10,627 INFO L231 Difference]: Finished difference. Result has 60 places, 73 transitions, 527 flow [2025-03-17 06:46:10,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=527, PETRI_PLACES=60, PETRI_TRANSITIONS=73} [2025-03-17 06:46:10,629 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2025-03-17 06:46:10,629 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 73 transitions, 527 flow [2025-03-17 06:46:10,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:10,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:10,630 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] [2025-03-17 06:46:10,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:46:10,630 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:46:10,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:10,631 INFO L85 PathProgramCache]: Analyzing trace with hash -489622449, now seen corresponding path program 3 times [2025-03-17 06:46:10,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:10,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804061885] [2025-03-17 06:46:10,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:46:10,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:10,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-03-17 06:46:10,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 06:46:10,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 06:46:10,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:10,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:10,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804061885] [2025-03-17 06:46:10,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804061885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:10,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:10,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:46:10,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508190294] [2025-03-17 06:46:10,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:10,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:46:10,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:10,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:46:10,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:46:10,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-17 06:46:10,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 73 transitions, 527 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 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-03-17 06:46:10,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:10,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-17 06:46:10,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:11,079 INFO L124 PetriNetUnfolderBase]: 2580/3983 cut-off events. [2025-03-17 06:46:11,080 INFO L125 PetriNetUnfolderBase]: For 7887/7903 co-relation queries the response was YES. [2025-03-17 06:46:11,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14150 conditions, 3983 events. 2580/3983 cut-off events. For 7887/7903 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 22419 event pairs, 240 based on Foata normal form. 124/4103 useless extension candidates. Maximal degree in co-relation 7124. Up to 2362 conditions per place. [2025-03-17 06:46:11,103 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 119 selfloop transitions, 13 changer transitions 0/139 dead transitions. [2025-03-17 06:46:11,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 139 transitions, 1169 flow [2025-03-17 06:46:11,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:46:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:46:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2025-03-17 06:46:11,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2025-03-17 06:46:11,105 INFO L175 Difference]: Start difference. First operand has 60 places, 73 transitions, 527 flow. Second operand 5 states and 120 transitions. [2025-03-17 06:46:11,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 139 transitions, 1169 flow [2025-03-17 06:46:11,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 139 transitions, 1130 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 06:46:11,120 INFO L231 Difference]: Finished difference. Result has 64 places, 80 transitions, 610 flow [2025-03-17 06:46:11,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=610, PETRI_PLACES=64, PETRI_TRANSITIONS=80} [2025-03-17 06:46:11,123 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 26 predicate places. [2025-03-17 06:46:11,123 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 80 transitions, 610 flow [2025-03-17 06:46:11,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 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-03-17 06:46:11,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:11,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:11,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:46:11,124 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:46:11,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:11,124 INFO L85 PathProgramCache]: Analyzing trace with hash 160278212, now seen corresponding path program 1 times [2025-03-17 06:46:11,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:11,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666249188] [2025-03-17 06:46:11,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:11,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:11,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 06:46:11,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 06:46:11,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:11,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:11,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:11,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:11,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666249188] [2025-03-17 06:46:11,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666249188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:11,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:11,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:46:11,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278032676] [2025-03-17 06:46:11,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:11,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:46:11,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:11,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:46:11,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:46:11,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-03-17 06:46:11,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 80 transitions, 610 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:11,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:11,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-03-17 06:46:11,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:11,899 INFO L124 PetriNetUnfolderBase]: 3856/5715 cut-off events. [2025-03-17 06:46:11,899 INFO L125 PetriNetUnfolderBase]: For 21581/21581 co-relation queries the response was YES. [2025-03-17 06:46:11,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23231 conditions, 5715 events. 3856/5715 cut-off events. For 21581/21581 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 32081 event pairs, 75 based on Foata normal form. 216/5713 useless extension candidates. Maximal degree in co-relation 11223. Up to 1626 conditions per place. [2025-03-17 06:46:11,931 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 216 selfloop transitions, 46 changer transitions 0/268 dead transitions. [2025-03-17 06:46:11,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 268 transitions, 2671 flow [2025-03-17 06:46:11,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:46:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 06:46:11,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions. [2025-03-17 06:46:11,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5771428571428572 [2025-03-17 06:46:11,933 INFO L175 Difference]: Start difference. First operand has 64 places, 80 transitions, 610 flow. Second operand 10 states and 202 transitions. [2025-03-17 06:46:11,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 268 transitions, 2671 flow [2025-03-17 06:46:11,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 268 transitions, 2631 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-03-17 06:46:11,955 INFO L231 Difference]: Finished difference. Result has 78 places, 110 transitions, 1012 flow [2025-03-17 06:46:11,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1012, PETRI_PLACES=78, PETRI_TRANSITIONS=110} [2025-03-17 06:46:11,955 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 40 predicate places. [2025-03-17 06:46:11,955 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 110 transitions, 1012 flow [2025-03-17 06:46:11,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:11,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:11,956 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] [2025-03-17 06:46:11,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:46:11,956 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:46:11,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash 480381162, now seen corresponding path program 2 times [2025-03-17 06:46:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:11,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264670910] [2025-03-17 06:46:11,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:46:11,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:11,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-03-17 06:46:11,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 06:46:11,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:46:11,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:12,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:12,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264670910] [2025-03-17 06:46:12,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264670910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:12,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:12,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:46:12,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111808942] [2025-03-17 06:46:12,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:12,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:46:12,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:12,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:46:12,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:46:12,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-17 06:46:12,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 110 transitions, 1012 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:12,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:12,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-17 06:46:12,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:12,463 INFO L124 PetriNetUnfolderBase]: 3222/4945 cut-off events. [2025-03-17 06:46:12,463 INFO L125 PetriNetUnfolderBase]: For 27157/27196 co-relation queries the response was YES. [2025-03-17 06:46:12,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23626 conditions, 4945 events. 3222/4945 cut-off events. For 27157/27196 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 28656 event pairs, 618 based on Foata normal form. 45/4970 useless extension candidates. Maximal degree in co-relation 16360. Up to 4375 conditions per place. [2025-03-17 06:46:12,489 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 98 selfloop transitions, 14 changer transitions 0/121 dead transitions. [2025-03-17 06:46:12,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 121 transitions, 1265 flow [2025-03-17 06:46:12,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:46:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:46:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-03-17 06:46:12,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-17 06:46:12,490 INFO L175 Difference]: Start difference. First operand has 78 places, 110 transitions, 1012 flow. Second operand 4 states and 84 transitions. [2025-03-17 06:46:12,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 121 transitions, 1265 flow [2025-03-17 06:46:12,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 121 transitions, 1245 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-03-17 06:46:12,524 INFO L231 Difference]: Finished difference. Result has 82 places, 105 transitions, 974 flow [2025-03-17 06:46:12,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=974, PETRI_PLACES=82, PETRI_TRANSITIONS=105} [2025-03-17 06:46:12,526 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 44 predicate places. [2025-03-17 06:46:12,526 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 105 transitions, 974 flow [2025-03-17 06:46:12,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:12,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:12,527 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] [2025-03-17 06:46:12,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:46:12,527 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:46:12,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:12,527 INFO L85 PathProgramCache]: Analyzing trace with hash -51843236, now seen corresponding path program 3 times [2025-03-17 06:46:12,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:12,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902369995] [2025-03-17 06:46:12,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:46:12,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:12,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-17 06:46:12,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 06:46:12,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 06:46:12,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:12,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:12,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902369995] [2025-03-17 06:46:12,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902369995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:12,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124105407] [2025-03-17 06:46:12,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:46:12,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:12,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:12,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:46:12,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:46:12,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-17 06:46:12,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 06:46:12,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 06:46:12,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:12,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 06:46:12,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:12,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:12,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124105407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:46:12,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:46:12,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2025-03-17 06:46:12,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332981308] [2025-03-17 06:46:12,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:46:12,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:46:12,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:12,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:46:12,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:46:12,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-17 06:46:12,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 105 transitions, 974 flow. Second operand has 12 states, 12 states have (on average 10.5) internal successors, (126), 12 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:12,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:12,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-17 06:46:12,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:14,762 INFO L124 PetriNetUnfolderBase]: 12309/17334 cut-off events. [2025-03-17 06:46:14,762 INFO L125 PetriNetUnfolderBase]: For 72812/72812 co-relation queries the response was YES. [2025-03-17 06:46:14,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74891 conditions, 17334 events. 12309/17334 cut-off events. For 72812/72812 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 96494 event pairs, 313 based on Foata normal form. 502/17835 useless extension candidates. Maximal degree in co-relation 48379. Up to 3873 conditions per place. [2025-03-17 06:46:14,854 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 335 selfloop transitions, 174 changer transitions 0/513 dead transitions. [2025-03-17 06:46:14,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 513 transitions, 5250 flow [2025-03-17 06:46:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 06:46:14,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-17 06:46:14,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 487 transitions. [2025-03-17 06:46:14,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4638095238095238 [2025-03-17 06:46:14,857 INFO L175 Difference]: Start difference. First operand has 82 places, 105 transitions, 974 flow. Second operand 30 states and 487 transitions. [2025-03-17 06:46:14,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 513 transitions, 5250 flow [2025-03-17 06:46:15,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 513 transitions, 5191 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-17 06:46:15,007 INFO L231 Difference]: Finished difference. Result has 133 places, 257 transitions, 3052 flow [2025-03-17 06:46:15,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3052, PETRI_PLACES=133, PETRI_TRANSITIONS=257} [2025-03-17 06:46:15,007 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 95 predicate places. [2025-03-17 06:46:15,008 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 257 transitions, 3052 flow [2025-03-17 06:46:15,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.5) internal successors, (126), 12 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:15,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:15,008 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] [2025-03-17 06:46:15,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 06:46:15,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-17 06:46:15,212 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:46:15,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:15,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1304132716, now seen corresponding path program 4 times [2025-03-17 06:46:15,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:15,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041930900] [2025-03-17 06:46:15,212 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:46:15,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:15,218 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-17 06:46:15,240 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 06:46:15,240 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:46:15,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:16,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:16,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041930900] [2025-03-17 06:46:16,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041930900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:16,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:16,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:46:16,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80501738] [2025-03-17 06:46:16,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:16,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:46:16,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:16,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:46:16,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:46:16,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-17 06:46:16,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 257 transitions, 3052 flow. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 10 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:16,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:16,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-17 06:46:16,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:21,128 INFO L124 PetriNetUnfolderBase]: 10683/16184 cut-off events. [2025-03-17 06:46:21,128 INFO L125 PetriNetUnfolderBase]: For 178142/179737 co-relation queries the response was YES. [2025-03-17 06:46:21,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94155 conditions, 16184 events. 10683/16184 cut-off events. For 178142/179737 co-relation queries the response was YES. Maximal size of possible extension queue 1058. Compared 108226 event pairs, 781 based on Foata normal form. 424/16154 useless extension candidates. Maximal degree in co-relation 79359. Up to 11291 conditions per place. [2025-03-17 06:46:21,266 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 349 selfloop transitions, 168 changer transitions 24/578 dead transitions. [2025-03-17 06:46:21,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 578 transitions, 7270 flow [2025-03-17 06:46:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 06:46:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-17 06:46:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 443 transitions. [2025-03-17 06:46:21,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5273809523809524 [2025-03-17 06:46:21,268 INFO L175 Difference]: Start difference. First operand has 133 places, 257 transitions, 3052 flow. Second operand 24 states and 443 transitions. [2025-03-17 06:46:21,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 578 transitions, 7270 flow [2025-03-17 06:46:22,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 578 transitions, 6959 flow, removed 151 selfloop flow, removed 1 redundant places. [2025-03-17 06:46:22,040 INFO L231 Difference]: Finished difference. Result has 169 places, 416 transitions, 5384 flow [2025-03-17 06:46:22,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2833, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=5384, PETRI_PLACES=169, PETRI_TRANSITIONS=416} [2025-03-17 06:46:22,041 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 131 predicate places. [2025-03-17 06:46:22,041 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 416 transitions, 5384 flow [2025-03-17 06:46:22,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 10 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:22,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:22,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, 1, 1, 1, 1] [2025-03-17 06:46:22,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:46:22,044 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:46:22,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:22,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1485296260, now seen corresponding path program 5 times [2025-03-17 06:46:22,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:22,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707353140] [2025-03-17 06:46:22,045 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:46:22,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:22,050 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-03-17 06:46:22,065 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 06:46:22,065 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:46:22,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:23,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:23,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707353140] [2025-03-17 06:46:23,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707353140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:23,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:23,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:46:23,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396493627] [2025-03-17 06:46:23,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:23,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:46:23,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:23,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:46:23,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:46:23,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-03-17 06:46:23,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 416 transitions, 5384 flow. Second operand has 12 states, 12 states have (on average 10.916666666666666) internal successors, (131), 12 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:23,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:23,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-03-17 06:46:23,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:28,317 INFO L124 PetriNetUnfolderBase]: 14447/21351 cut-off events. [2025-03-17 06:46:28,318 INFO L125 PetriNetUnfolderBase]: For 283933/285627 co-relation queries the response was YES. [2025-03-17 06:46:28,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136203 conditions, 21351 events. 14447/21351 cut-off events. For 283933/285627 co-relation queries the response was YES. Maximal size of possible extension queue 1250. Compared 140342 event pairs, 961 based on Foata normal form. 414/21246 useless extension candidates. Maximal degree in co-relation 136102. Up to 13147 conditions per place. [2025-03-17 06:46:28,500 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 483 selfloop transitions, 322 changer transitions 25/854 dead transitions. [2025-03-17 06:46:28,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 854 transitions, 11683 flow [2025-03-17 06:46:28,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 06:46:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-17 06:46:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 514 transitions. [2025-03-17 06:46:28,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5064039408866995 [2025-03-17 06:46:28,502 INFO L175 Difference]: Start difference. First operand has 169 places, 416 transitions, 5384 flow. Second operand 29 states and 514 transitions. [2025-03-17 06:46:28,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 854 transitions, 11683 flow [2025-03-17 06:46:29,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 854 transitions, 11320 flow, removed 167 selfloop flow, removed 5 redundant places. [2025-03-17 06:46:29,581 INFO L231 Difference]: Finished difference. Result has 204 places, 586 transitions, 8545 flow [2025-03-17 06:46:29,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5177, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=8545, PETRI_PLACES=204, PETRI_TRANSITIONS=586} [2025-03-17 06:46:29,582 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 166 predicate places. [2025-03-17 06:46:29,582 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 586 transitions, 8545 flow [2025-03-17 06:46:29,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.916666666666666) internal successors, (131), 12 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:29,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:29,582 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] [2025-03-17 06:46:29,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:46:29,583 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:46:29,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:29,583 INFO L85 PathProgramCache]: Analyzing trace with hash 743594322, now seen corresponding path program 6 times [2025-03-17 06:46:29,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:29,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366318073] [2025-03-17 06:46:29,583 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 06:46:29,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:29,587 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 1 equivalence classes. [2025-03-17 06:46:29,602 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 06:46:29,602 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 06:46:29,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:30,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:30,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366318073] [2025-03-17 06:46:30,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366318073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:30,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:30,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:46:30,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515887633] [2025-03-17 06:46:30,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:30,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:46:30,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:30,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:46:30,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:46:30,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-17 06:46:30,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 586 transitions, 8545 flow. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 10 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:30,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:30,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-17 06:46:30,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:35,167 INFO L124 PetriNetUnfolderBase]: 14443/22063 cut-off events. [2025-03-17 06:46:35,167 INFO L125 PetriNetUnfolderBase]: For 340618/342863 co-relation queries the response was YES. [2025-03-17 06:46:35,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148467 conditions, 22063 events. 14443/22063 cut-off events. For 340618/342863 co-relation queries the response was YES. Maximal size of possible extension queue 1318. Compared 154408 event pairs, 872 based on Foata normal form. 573/22046 useless extension candidates. Maximal degree in co-relation 148373. Up to 9501 conditions per place. [2025-03-17 06:46:35,467 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 627 selfloop transitions, 337 changer transitions 32/1033 dead transitions. [2025-03-17 06:46:35,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 1033 transitions, 15721 flow [2025-03-17 06:46:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 06:46:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-17 06:46:35,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 554 transitions. [2025-03-17 06:46:35,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5276190476190477 [2025-03-17 06:46:35,472 INFO L175 Difference]: Start difference. First operand has 204 places, 586 transitions, 8545 flow. Second operand 30 states and 554 transitions. [2025-03-17 06:46:35,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 1033 transitions, 15721 flow [2025-03-17 06:46:37,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 1033 transitions, 15422 flow, removed 143 selfloop flow, removed 4 redundant places. [2025-03-17 06:46:37,081 INFO L231 Difference]: Finished difference. Result has 242 places, 729 transitions, 11513 flow [2025-03-17 06:46:37,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8344, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=11513, PETRI_PLACES=242, PETRI_TRANSITIONS=729} [2025-03-17 06:46:37,082 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 204 predicate places. [2025-03-17 06:46:37,082 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 729 transitions, 11513 flow [2025-03-17 06:46:37,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 10 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:37,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:37,083 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] [2025-03-17 06:46:37,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:46:37,083 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:46:37,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:37,083 INFO L85 PathProgramCache]: Analyzing trace with hash 953754474, now seen corresponding path program 7 times [2025-03-17 06:46:37,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:37,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593374264] [2025-03-17 06:46:37,083 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 06:46:37,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:37,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 06:46:37,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 06:46:37,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:37,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:38,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:38,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593374264] [2025-03-17 06:46:38,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593374264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:38,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:38,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:46:38,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024614098] [2025-03-17 06:46:38,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:38,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:46:38,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:38,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:46:38,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:46:38,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-17 06:46:38,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 729 transitions, 11513 flow. Second operand has 11 states, 11 states have (on average 12.090909090909092) internal successors, (133), 11 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:38,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:38,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-17 06:46:38,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:43,888 INFO L124 PetriNetUnfolderBase]: 18643/28408 cut-off events. [2025-03-17 06:46:43,888 INFO L125 PetriNetUnfolderBase]: For 565020/568080 co-relation queries the response was YES. [2025-03-17 06:46:44,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211692 conditions, 28408 events. 18643/28408 cut-off events. For 565020/568080 co-relation queries the response was YES. Maximal size of possible extension queue 1678. Compared 205664 event pairs, 1659 based on Foata normal form. 781/28535 useless extension candidates. Maximal degree in co-relation 211578. Up to 17376 conditions per place. [2025-03-17 06:46:44,464 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 811 selfloop transitions, 212 changer transitions 6/1066 dead transitions. [2025-03-17 06:46:44,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 1066 transitions, 18210 flow [2025-03-17 06:46:44,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 06:46:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 06:46:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 269 transitions. [2025-03-17 06:46:44,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5489795918367347 [2025-03-17 06:46:44,466 INFO L175 Difference]: Start difference. First operand has 242 places, 729 transitions, 11513 flow. Second operand 14 states and 269 transitions. [2025-03-17 06:46:44,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 1066 transitions, 18210 flow [2025-03-17 06:46:47,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 1066 transitions, 17753 flow, removed 194 selfloop flow, removed 8 redundant places. [2025-03-17 06:46:47,946 INFO L231 Difference]: Finished difference. Result has 251 places, 790 transitions, 12797 flow [2025-03-17 06:46:47,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11098, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=12797, PETRI_PLACES=251, PETRI_TRANSITIONS=790} [2025-03-17 06:46:47,947 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 213 predicate places. [2025-03-17 06:46:47,947 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 790 transitions, 12797 flow [2025-03-17 06:46:47,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.090909090909092) internal successors, (133), 11 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:47,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:47,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:47,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:46:47,947 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:46:47,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:47,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1296820086, now seen corresponding path program 8 times [2025-03-17 06:46:47,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:47,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478821562] [2025-03-17 06:46:47,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:46:47,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:47,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-17 06:46:47,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 06:46:47,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:46:47,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:48,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:48,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478821562] [2025-03-17 06:46:48,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478821562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:48,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422783597] [2025-03-17 06:46:48,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:46:48,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:48,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:48,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:46:48,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:46:48,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-17 06:46:48,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 06:46:48,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:46:48,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:48,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 06:46:48,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:49,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:50,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422783597] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:46:50,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:46:50,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11] total 29 [2025-03-17 06:46:50,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607754417] [2025-03-17 06:46:50,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:46:50,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 06:46:50,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:50,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 06:46:50,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2025-03-17 06:46:50,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-17 06:46:50,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 790 transitions, 12797 flow. Second operand has 30 states, 30 states have (on average 9.166666666666666) internal successors, (275), 30 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:50,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:50,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-17 06:46:50,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:47:04,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 06:47:08,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 06:47:11,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 06:47:22,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 06:47:30,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 06:47:34,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 06:47:37,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []