./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-counter-fun.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-counter-fun.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 fbe9f324c9eba6beb8c990e3f85f0b00a68548fe05ffdb4e97bc061354d1cdf2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:22:41,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:22:42,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:22:42,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:22:42,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:22:42,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:22:42,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:22:42,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:22:42,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:22:42,047 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:22:42,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:22:42,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:22:42,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:22:42,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:22:42,048 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:22:42,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:22:42,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:22:42,048 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:22:42,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:22:42,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:22:42,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:22:42,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:22:42,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:22:42,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:22:42,049 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:22:42,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:22:42,049 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:22:42,049 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:22:42,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:22:42,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:22:42,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:22:42,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:22:42,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:22:42,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:22:42,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:22:42,050 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:22:42,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:22:42,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:22:42,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:22:42,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:22:42,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:22:42,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:22:42,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:22:42,050 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 -> fbe9f324c9eba6beb8c990e3f85f0b00a68548fe05ffdb4e97bc061354d1cdf2 [2025-03-04 02:22:42,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:22:42,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:22:42,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:22:42,264 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:22:42,264 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:22:42,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-counter-fun.wvr.c [2025-03-04 02:22:43,374 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b252606a/0247086936204fb8b356bc903101e684/FLAG4ce91c72c [2025-03-04 02:22:43,646 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:22:43,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-fun.wvr.c [2025-03-04 02:22:43,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b252606a/0247086936204fb8b356bc903101e684/FLAG4ce91c72c [2025-03-04 02:22:43,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b252606a/0247086936204fb8b356bc903101e684 [2025-03-04 02:22:43,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:22:43,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:22:43,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:22:43,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:22:43,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:22:43,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:22:43" (1/1) ... [2025-03-04 02:22:43,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32101cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:43, skipping insertion in model container [2025-03-04 02:22:43,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:22:43" (1/1) ... [2025-03-04 02:22:43,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:22:44,077 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-counter-fun.wvr.c[2707,2720] [2025-03-04 02:22:44,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:22:44,090 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:22:44,106 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-counter-fun.wvr.c[2707,2720] [2025-03-04 02:22:44,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:22:44,120 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:22:44,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:44 WrapperNode [2025-03-04 02:22:44,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:22:44,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:22:44,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:22:44,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:22:44,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:44" (1/1) ... [2025-03-04 02:22:44,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:44" (1/1) ... [2025-03-04 02:22:44,154 INFO L138 Inliner]: procedures = 23, calls = 35, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 179 [2025-03-04 02:22:44,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:22:44,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:22:44,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:22:44,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:22:44,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:44" (1/1) ... [2025-03-04 02:22:44,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:44" (1/1) ... [2025-03-04 02:22:44,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:44" (1/1) ... [2025-03-04 02:22:44,185 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 02:22:44,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:44" (1/1) ... [2025-03-04 02:22:44,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:44" (1/1) ... [2025-03-04 02:22:44,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:44" (1/1) ... [2025-03-04 02:22:44,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:44" (1/1) ... [2025-03-04 02:22:44,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:44" (1/1) ... [2025-03-04 02:22:44,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:44" (1/1) ... [2025-03-04 02:22:44,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:22:44,201 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:22:44,201 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:22:44,201 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:22:44,205 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:44" (1/1) ... [2025-03-04 02:22:44,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:22:44,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:44,231 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-04 02:22:44,233 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-04 02:22:44,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:22:44,252 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:22:44,252 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:22:44,252 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:22:44,252 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:22:44,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:22:44,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:22:44,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:22:44,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:22:44,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:22:44,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:22:44,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:22:44,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:22:44,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:22:44,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:22:44,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:22:44,255 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:22:44,339 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:22:44,341 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:22:44,637 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:22:44,637 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:22:44,836 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:22:44,836 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:22:44,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:22:44 BoogieIcfgContainer [2025-03-04 02:22:44,837 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:22:44,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:22:44,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:22:44,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:22:44,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:22:43" (1/3) ... [2025-03-04 02:22:44,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e9c433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:22:44, skipping insertion in model container [2025-03-04 02:22:44,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:44" (2/3) ... [2025-03-04 02:22:44,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e9c433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:22:44, skipping insertion in model container [2025-03-04 02:22:44,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:22:44" (3/3) ... [2025-03-04 02:22:44,845 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-counter-fun.wvr.c [2025-03-04 02:22:44,856 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:22:44,857 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-counter-fun.wvr.c that has 3 procedures, 23 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-04 02:22:44,857 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:22:44,896 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:22:44,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 66 flow [2025-03-04 02:22:44,943 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-03-04 02:22:44,946 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:22:44,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 4/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-03-04 02:22:44,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 66 flow [2025-03-04 02:22:44,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 23 transitions, 58 flow [2025-03-04 02:22:44,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:22:44,972 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;@422f16f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:22:44,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:22:44,983 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:22:44,983 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2025-03-04 02:22:44,983 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:22:44,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:44,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:44,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:44,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:44,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1742457691, now seen corresponding path program 1 times [2025-03-04 02:22:44,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:44,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596679880] [2025-03-04 02:22:44,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:44,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:45,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:22:45,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:22:45,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:45,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:45,231 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-04 02:22:45,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:45,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596679880] [2025-03-04 02:22:45,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596679880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:45,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:45,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:22:45,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672966978] [2025-03-04 02:22:45,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:45,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:22:45,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:45,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:22:45,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:22:45,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2025-03-04 02:22:45,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-04 02:22:45,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:45,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2025-03-04 02:22:45,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:45,344 INFO L124 PetriNetUnfolderBase]: 94/182 cut-off events. [2025-03-04 02:22:45,347 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 02:22:45,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 182 events. 94/182 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 581 event pairs, 22 based on Foata normal form. 1/177 useless extension candidates. Maximal degree in co-relation 314. Up to 113 conditions per place. [2025-03-04 02:22:45,350 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 27 selfloop transitions, 3 changer transitions 1/34 dead transitions. [2025-03-04 02:22:45,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 151 flow [2025-03-04 02:22:45,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:22:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:22:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-03-04 02:22:45,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2025-03-04 02:22:45,360 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 58 flow. Second operand 3 states and 47 transitions. [2025-03-04 02:22:45,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 151 flow [2025-03-04 02:22:45,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 34 transitions, 137 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:22:45,365 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 69 flow [2025-03-04 02:22:45,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=25, PETRI_TRANSITIONS=25} [2025-03-04 02:22:45,371 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2025-03-04 02:22:45,372 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 69 flow [2025-03-04 02:22:45,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-04 02:22:45,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:45,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:45,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:22:45,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:45,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:45,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1477620010, now seen corresponding path program 1 times [2025-03-04 02:22:45,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:45,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359172963] [2025-03-04 02:22:45,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:45,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:45,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:22:45,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:22:45,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:45,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:45,535 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-04 02:22:45,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:45,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359172963] [2025-03-04 02:22:45,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359172963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:45,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:45,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:22:45,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352510947] [2025-03-04 02:22:45,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:45,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:22:45,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:45,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:22:45,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:22:45,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2025-03-04 02:22:45,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 69 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-04 02:22:45,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:45,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2025-03-04 02:22:45,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:45,679 INFO L124 PetriNetUnfolderBase]: 188/335 cut-off events. [2025-03-04 02:22:45,679 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 02:22:45,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 335 events. 188/335 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1324 event pairs, 62 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 196. Up to 187 conditions per place. [2025-03-04 02:22:45,681 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 39 selfloop transitions, 9 changer transitions 1/51 dead transitions. [2025-03-04 02:22:45,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 51 transitions, 240 flow [2025-03-04 02:22:45,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:22:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:22:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-03-04 02:22:45,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:22:45,682 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 69 flow. Second operand 5 states and 65 transitions. [2025-03-04 02:22:45,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 51 transitions, 240 flow [2025-03-04 02:22:45,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 51 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:22:45,683 INFO L231 Difference]: Finished difference. Result has 31 places, 33 transitions, 124 flow [2025-03-04 02:22:45,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=31, PETRI_TRANSITIONS=33} [2025-03-04 02:22:45,684 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2025-03-04 02:22:45,684 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 33 transitions, 124 flow [2025-03-04 02:22:45,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-04 02:22:45,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:45,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:45,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:22:45,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:45,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:45,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1549140602, now seen corresponding path program 2 times [2025-03-04 02:22:45,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:45,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480793292] [2025-03-04 02:22:45,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:22:45,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:45,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:22:45,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:22:45,725 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:22:45,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:45,839 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-04 02:22:45,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:45,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480793292] [2025-03-04 02:22:45,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480793292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:45,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877880991] [2025-03-04 02:22:45,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:22:45,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:45,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:45,843 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-04 02:22:45,844 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-04 02:22:45,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:22:45,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:22:45,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:22:45,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:45,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:22:45,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:45,973 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-04 02:22:45,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:46,001 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-04 02:22:46,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877880991] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:46,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:46,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-04 02:22:46,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734800415] [2025-03-04 02:22:46,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:46,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:22:46,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:46,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:22:46,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:22:46,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:22:46,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 33 transitions, 124 flow. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 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-04 02:22:46,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:46,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:22:46,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:46,287 INFO L124 PetriNetUnfolderBase]: 302/520 cut-off events. [2025-03-04 02:22:46,287 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2025-03-04 02:22:46,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 520 events. 302/520 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2099 event pairs, 25 based on Foata normal form. 13/531 useless extension candidates. Maximal degree in co-relation 726. Up to 101 conditions per place. [2025-03-04 02:22:46,290 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 76 selfloop transitions, 35 changer transitions 1/113 dead transitions. [2025-03-04 02:22:46,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 113 transitions, 627 flow [2025-03-04 02:22:46,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:22:46,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:22:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 141 transitions. [2025-03-04 02:22:46,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3873626373626374 [2025-03-04 02:22:46,294 INFO L175 Difference]: Start difference. First operand has 31 places, 33 transitions, 124 flow. Second operand 14 states and 141 transitions. [2025-03-04 02:22:46,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 113 transitions, 627 flow [2025-03-04 02:22:46,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 113 transitions, 627 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:22:46,296 INFO L231 Difference]: Finished difference. Result has 50 places, 61 transitions, 357 flow [2025-03-04 02:22:46,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=357, PETRI_PLACES=50, PETRI_TRANSITIONS=61} [2025-03-04 02:22:46,299 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 24 predicate places. [2025-03-04 02:22:46,299 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 61 transitions, 357 flow [2025-03-04 02:22:46,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 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-04 02:22:46,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:46,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:46,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:22:46,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:46,504 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:46,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:46,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2071414805, now seen corresponding path program 1 times [2025-03-04 02:22:46,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:46,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165893229] [2025-03-04 02:22:46,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:46,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:46,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:22:46,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:22:46,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:46,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:46,600 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-04 02:22:46,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:46,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165893229] [2025-03-04 02:22:46,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165893229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:46,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:46,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:22:46,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766534229] [2025-03-04 02:22:46,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:46,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:22:46,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:46,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:22:46,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:22:46,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2025-03-04 02:22:46,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 61 transitions, 357 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-04 02:22:46,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:46,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2025-03-04 02:22:46,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:46,731 INFO L124 PetriNetUnfolderBase]: 262/468 cut-off events. [2025-03-04 02:22:46,731 INFO L125 PetriNetUnfolderBase]: For 709/709 co-relation queries the response was YES. [2025-03-04 02:22:46,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 468 events. 262/468 cut-off events. For 709/709 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1990 event pairs, 72 based on Foata normal form. 3/466 useless extension candidates. Maximal degree in co-relation 1478. Up to 209 conditions per place. [2025-03-04 02:22:46,735 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 61 selfloop transitions, 12 changer transitions 6/83 dead transitions. [2025-03-04 02:22:46,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 83 transitions, 604 flow [2025-03-04 02:22:46,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:22:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:22:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2025-03-04 02:22:46,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5153846153846153 [2025-03-04 02:22:46,738 INFO L175 Difference]: Start difference. First operand has 50 places, 61 transitions, 357 flow. Second operand 5 states and 67 transitions. [2025-03-04 02:22:46,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 83 transitions, 604 flow [2025-03-04 02:22:46,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 83 transitions, 571 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-03-04 02:22:46,746 INFO L231 Difference]: Finished difference. Result has 55 places, 61 transitions, 362 flow [2025-03-04 02:22:46,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=362, PETRI_PLACES=55, PETRI_TRANSITIONS=61} [2025-03-04 02:22:46,747 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 29 predicate places. [2025-03-04 02:22:46,747 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 61 transitions, 362 flow [2025-03-04 02:22:46,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-04 02:22:46,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:46,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:46,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:22:46,749 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:46,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:46,749 INFO L85 PathProgramCache]: Analyzing trace with hash 620762438, now seen corresponding path program 3 times [2025-03-04 02:22:46,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:46,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206945223] [2025-03-04 02:22:46,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:22:46,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:46,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:22:46,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:22:46,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:22:46,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:46,854 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-04 02:22:46,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:46,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206945223] [2025-03-04 02:22:46,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206945223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:46,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153111338] [2025-03-04 02:22:46,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:22:46,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:46,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:46,858 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-04 02:22:46,859 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-04 02:22:46,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:22:46,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:22:46,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:22:46,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:46,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:22:46,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:46,965 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-04 02:22:46,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:46,994 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-04 02:22:46,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153111338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:46,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:46,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-04 02:22:46,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380061139] [2025-03-04 02:22:46,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:46,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:22:46,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:46,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:22:46,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:22:47,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:22:47,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 61 transitions, 362 flow. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:47,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:47,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:22:47,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:47,216 INFO L124 PetriNetUnfolderBase]: 398/679 cut-off events. [2025-03-04 02:22:47,216 INFO L125 PetriNetUnfolderBase]: For 1351/1351 co-relation queries the response was YES. [2025-03-04 02:22:47,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2453 conditions, 679 events. 398/679 cut-off events. For 1351/1351 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2768 event pairs, 58 based on Foata normal form. 17/694 useless extension candidates. Maximal degree in co-relation 1976. Up to 262 conditions per place. [2025-03-04 02:22:47,220 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 75 selfloop transitions, 46 changer transitions 0/122 dead transitions. [2025-03-04 02:22:47,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 122 transitions, 930 flow [2025-03-04 02:22:47,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:22:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:22:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2025-03-04 02:22:47,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2025-03-04 02:22:47,223 INFO L175 Difference]: Start difference. First operand has 55 places, 61 transitions, 362 flow. Second operand 8 states and 96 transitions. [2025-03-04 02:22:47,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 122 transitions, 930 flow [2025-03-04 02:22:47,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 122 transitions, 889 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 02:22:47,229 INFO L231 Difference]: Finished difference. Result has 63 places, 86 transitions, 654 flow [2025-03-04 02:22:47,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=654, PETRI_PLACES=63, PETRI_TRANSITIONS=86} [2025-03-04 02:22:47,230 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 37 predicate places. [2025-03-04 02:22:47,231 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 86 transitions, 654 flow [2025-03-04 02:22:47,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:47,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:47,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:47,237 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-04 02:22:47,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:47,432 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:47,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:47,432 INFO L85 PathProgramCache]: Analyzing trace with hash 888577858, now seen corresponding path program 4 times [2025-03-04 02:22:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:47,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114943057] [2025-03-04 02:22:47,432 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:22:47,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:47,441 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:22:47,444 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 18 statements. [2025-03-04 02:22:47,444 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:22:47,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:47,477 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-04 02:22:47,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:47,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114943057] [2025-03-04 02:22:47,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114943057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:47,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:47,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:22:47,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694649901] [2025-03-04 02:22:47,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:47,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:22:47,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:47,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:22:47,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:22:47,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:22:47,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 86 transitions, 654 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-04 02:22:47,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:47,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:22:47,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:47,609 INFO L124 PetriNetUnfolderBase]: 404/701 cut-off events. [2025-03-04 02:22:47,610 INFO L125 PetriNetUnfolderBase]: For 1633/1633 co-relation queries the response was YES. [2025-03-04 02:22:47,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 701 events. 404/701 cut-off events. For 1633/1633 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2934 event pairs, 96 based on Foata normal form. 2/701 useless extension candidates. Maximal degree in co-relation 2249. Up to 318 conditions per place. [2025-03-04 02:22:47,614 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 88 selfloop transitions, 19 changer transitions 4/112 dead transitions. [2025-03-04 02:22:47,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 112 transitions, 1028 flow [2025-03-04 02:22:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:22:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:22:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2025-03-04 02:22:47,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2025-03-04 02:22:47,615 INFO L175 Difference]: Start difference. First operand has 63 places, 86 transitions, 654 flow. Second operand 5 states and 60 transitions. [2025-03-04 02:22:47,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 112 transitions, 1028 flow [2025-03-04 02:22:47,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 112 transitions, 1006 flow, removed 11 selfloop flow, removed 0 redundant places. [2025-03-04 02:22:47,622 INFO L231 Difference]: Finished difference. Result has 69 places, 86 transitions, 679 flow [2025-03-04 02:22:47,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=679, PETRI_PLACES=69, PETRI_TRANSITIONS=86} [2025-03-04 02:22:47,622 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 43 predicate places. [2025-03-04 02:22:47,622 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 86 transitions, 679 flow [2025-03-04 02:22:47,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-04 02:22:47,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:47,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:47,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:22:47,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:47,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:47,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2140063561, now seen corresponding path program 2 times [2025-03-04 02:22:47,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:47,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121745808] [2025-03-04 02:22:47,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:22:47,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:47,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:22:47,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:22:47,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:22:47,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:47,712 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-04 02:22:47,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:47,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121745808] [2025-03-04 02:22:47,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121745808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:47,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265062000] [2025-03-04 02:22:47,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:22:47,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:47,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:47,714 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-04 02:22:47,716 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-04 02:22:47,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:22:47,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:22:47,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:22:47,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:47,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:22:47,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:47,797 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-04 02:22:47,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:47,821 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-04 02:22:47,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265062000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:47,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:47,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-04 02:22:47,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875914539] [2025-03-04 02:22:47,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:47,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:22:47,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:47,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:22:47,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:22:47,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:22:47,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 86 transitions, 679 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-04 02:22:47,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:47,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:22:47,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:48,080 INFO L124 PetriNetUnfolderBase]: 455/786 cut-off events. [2025-03-04 02:22:48,080 INFO L125 PetriNetUnfolderBase]: For 2145/2145 co-relation queries the response was YES. [2025-03-04 02:22:48,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3204 conditions, 786 events. 455/786 cut-off events. For 2145/2145 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3373 event pairs, 22 based on Foata normal form. 8/792 useless extension candidates. Maximal degree in co-relation 2895. Up to 159 conditions per place. [2025-03-04 02:22:48,086 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 91 selfloop transitions, 80 changer transitions 2/174 dead transitions. [2025-03-04 02:22:48,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 174 transitions, 1574 flow [2025-03-04 02:22:48,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:22:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:22:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 134 transitions. [2025-03-04 02:22:48,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36813186813186816 [2025-03-04 02:22:48,088 INFO L175 Difference]: Start difference. First operand has 69 places, 86 transitions, 679 flow. Second operand 14 states and 134 transitions. [2025-03-04 02:22:48,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 174 transitions, 1574 flow [2025-03-04 02:22:48,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 174 transitions, 1507 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-03-04 02:22:48,097 INFO L231 Difference]: Finished difference. Result has 82 places, 122 transitions, 1153 flow [2025-03-04 02:22:48,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1153, PETRI_PLACES=82, PETRI_TRANSITIONS=122} [2025-03-04 02:22:48,097 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 56 predicate places. [2025-03-04 02:22:48,097 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 122 transitions, 1153 flow [2025-03-04 02:22:48,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-04 02:22:48,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:48,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:48,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:22:48,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:48,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:48,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:48,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1977902446, now seen corresponding path program 5 times [2025-03-04 02:22:48,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:48,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496389392] [2025-03-04 02:22:48,299 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:22:48,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:48,308 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:22:48,314 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:22:48,314 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:22:48,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:48,365 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-04 02:22:48,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:48,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496389392] [2025-03-04 02:22:48,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496389392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:48,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:48,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:22:48,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404371319] [2025-03-04 02:22:48,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:48,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:22:48,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:48,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:22:48,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:22:48,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:22:48,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 122 transitions, 1153 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-04 02:22:48,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:48,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:22:48,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:48,479 INFO L124 PetriNetUnfolderBase]: 444/769 cut-off events. [2025-03-04 02:22:48,479 INFO L125 PetriNetUnfolderBase]: For 2679/2679 co-relation queries the response was YES. [2025-03-04 02:22:48,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3454 conditions, 769 events. 444/769 cut-off events. For 2679/2679 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3338 event pairs, 124 based on Foata normal form. 8/775 useless extension candidates. Maximal degree in co-relation 3173. Up to 485 conditions per place. [2025-03-04 02:22:48,483 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 102 selfloop transitions, 32 changer transitions 0/135 dead transitions. [2025-03-04 02:22:48,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 135 transitions, 1450 flow [2025-03-04 02:22:48,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:22:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:22:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-03-04 02:22:48,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2025-03-04 02:22:48,484 INFO L175 Difference]: Start difference. First operand has 82 places, 122 transitions, 1153 flow. Second operand 5 states and 64 transitions. [2025-03-04 02:22:48,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 135 transitions, 1450 flow [2025-03-04 02:22:48,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 135 transitions, 1339 flow, removed 32 selfloop flow, removed 4 redundant places. [2025-03-04 02:22:48,493 INFO L231 Difference]: Finished difference. Result has 81 places, 119 transitions, 1071 flow [2025-03-04 02:22:48,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1071, PETRI_PLACES=81, PETRI_TRANSITIONS=119} [2025-03-04 02:22:48,495 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 55 predicate places. [2025-03-04 02:22:48,495 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 119 transitions, 1071 flow [2025-03-04 02:22:48,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-04 02:22:48,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:48,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:48,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:22:48,495 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:48,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:48,496 INFO L85 PathProgramCache]: Analyzing trace with hash -321860933, now seen corresponding path program 3 times [2025-03-04 02:22:48,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:48,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199779693] [2025-03-04 02:22:48,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:22:48,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:48,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:22:48,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:22:48,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:22:48,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:48,563 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-04 02:22:48,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:48,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199779693] [2025-03-04 02:22:48,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199779693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:48,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565616556] [2025-03-04 02:22:48,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:22:48,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:48,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:48,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:22:48,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:22:48,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:22:48,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:22:48,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:22:48,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:48,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:22:48,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:48,650 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-04 02:22:48,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:48,666 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-04 02:22:48,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565616556] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:48,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:48,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-04 02:22:48,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120132434] [2025-03-04 02:22:48,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:48,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:22:48,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:48,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:22:48,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:22:48,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:22:48,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 119 transitions, 1071 flow. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:48,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:48,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:22:48,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:48,885 INFO L124 PetriNetUnfolderBase]: 478/823 cut-off events. [2025-03-04 02:22:48,885 INFO L125 PetriNetUnfolderBase]: For 2691/2691 co-relation queries the response was YES. [2025-03-04 02:22:48,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3563 conditions, 823 events. 478/823 cut-off events. For 2691/2691 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3615 event pairs, 89 based on Foata normal form. 8/829 useless extension candidates. Maximal degree in co-relation 3351. Up to 333 conditions per place. [2025-03-04 02:22:48,889 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 105 selfloop transitions, 54 changer transitions 0/160 dead transitions. [2025-03-04 02:22:48,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 160 transitions, 1600 flow [2025-03-04 02:22:48,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:22:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:22:48,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2025-03-04 02:22:48,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2025-03-04 02:22:48,890 INFO L175 Difference]: Start difference. First operand has 81 places, 119 transitions, 1071 flow. Second operand 8 states and 96 transitions. [2025-03-04 02:22:48,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 160 transitions, 1600 flow [2025-03-04 02:22:48,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 160 transitions, 1508 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 02:22:48,898 INFO L231 Difference]: Finished difference. Result has 86 places, 127 transitions, 1200 flow [2025-03-04 02:22:48,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1200, PETRI_PLACES=86, PETRI_TRANSITIONS=127} [2025-03-04 02:22:48,898 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 60 predicate places. [2025-03-04 02:22:48,898 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 127 transitions, 1200 flow [2025-03-04 02:22:48,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:48,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:48,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:48,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:22:49,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:49,099 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:49,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:49,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1461318048, now seen corresponding path program 6 times [2025-03-04 02:22:49,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:49,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945519599] [2025-03-04 02:22:49,100 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:22:49,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:49,106 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:22:49,113 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:22:49,113 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:22:49,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:49,173 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-04 02:22:49,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:49,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945519599] [2025-03-04 02:22:49,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945519599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:49,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631051756] [2025-03-04 02:22:49,173 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:22:49,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:49,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:49,175 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:22:49,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:22:49,220 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:22:49,236 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:22:49,236 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:22:49,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:49,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:22:49,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:49,264 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-04 02:22:49,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:49,306 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-04 02:22:49,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631051756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:49,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:49,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-04 02:22:49,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781134179] [2025-03-04 02:22:49,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:49,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:22:49,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:49,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:22:49,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:22:49,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:22:49,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 127 transitions, 1200 flow. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:49,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:49,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:22:49,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:49,569 INFO L124 PetriNetUnfolderBase]: 538/934 cut-off events. [2025-03-04 02:22:49,569 INFO L125 PetriNetUnfolderBase]: For 2913/2913 co-relation queries the response was YES. [2025-03-04 02:22:49,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4140 conditions, 934 events. 538/934 cut-off events. For 2913/2913 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4286 event pairs, 40 based on Foata normal form. 9/941 useless extension candidates. Maximal degree in co-relation 3915. Up to 200 conditions per place. [2025-03-04 02:22:49,573 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 110 selfloop transitions, 87 changer transitions 1/199 dead transitions. [2025-03-04 02:22:49,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 199 transitions, 1999 flow [2025-03-04 02:22:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:22:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:22:49,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 154 transitions. [2025-03-04 02:22:49,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39487179487179486 [2025-03-04 02:22:49,575 INFO L175 Difference]: Start difference. First operand has 86 places, 127 transitions, 1200 flow. Second operand 15 states and 154 transitions. [2025-03-04 02:22:49,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 199 transitions, 1999 flow [2025-03-04 02:22:49,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 199 transitions, 1869 flow, removed 28 selfloop flow, removed 4 redundant places. [2025-03-04 02:22:49,583 INFO L231 Difference]: Finished difference. Result has 99 places, 142 transitions, 1445 flow [2025-03-04 02:22:49,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1445, PETRI_PLACES=99, PETRI_TRANSITIONS=142} [2025-03-04 02:22:49,584 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 73 predicate places. [2025-03-04 02:22:49,584 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 142 transitions, 1445 flow [2025-03-04 02:22:49,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:49,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:49,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:49,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 02:22:49,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 02:22:49,789 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:49,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:49,790 INFO L85 PathProgramCache]: Analyzing trace with hash -65703339, now seen corresponding path program 4 times [2025-03-04 02:22:49,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:49,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014213129] [2025-03-04 02:22:49,790 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:22:49,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:49,795 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:22:49,797 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 18 statements. [2025-03-04 02:22:49,797 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:22:49,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:49,816 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-04 02:22:49,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:49,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014213129] [2025-03-04 02:22:49,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014213129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:49,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:49,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:22:49,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944230221] [2025-03-04 02:22:49,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:49,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:22:49,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:49,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:22:49,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:22:49,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:22:49,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 142 transitions, 1445 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-04 02:22:49,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:49,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:22:49,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:49,954 INFO L124 PetriNetUnfolderBase]: 533/930 cut-off events. [2025-03-04 02:22:49,954 INFO L125 PetriNetUnfolderBase]: For 3214/3214 co-relation queries the response was YES. [2025-03-04 02:22:49,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 930 events. 533/930 cut-off events. For 3214/3214 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4339 event pairs, 148 based on Foata normal form. 3/931 useless extension candidates. Maximal degree in co-relation 3978. Up to 594 conditions per place. [2025-03-04 02:22:49,959 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 128 selfloop transitions, 29 changer transitions 3/161 dead transitions. [2025-03-04 02:22:49,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 161 transitions, 1856 flow [2025-03-04 02:22:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:22:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:22:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-03-04 02:22:49,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46923076923076923 [2025-03-04 02:22:49,961 INFO L175 Difference]: Start difference. First operand has 99 places, 142 transitions, 1445 flow. Second operand 5 states and 61 transitions. [2025-03-04 02:22:49,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 161 transitions, 1856 flow [2025-03-04 02:22:49,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 161 transitions, 1751 flow, removed 15 selfloop flow, removed 7 redundant places. [2025-03-04 02:22:49,972 INFO L231 Difference]: Finished difference. Result has 97 places, 141 transitions, 1389 flow [2025-03-04 02:22:49,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1389, PETRI_PLACES=97, PETRI_TRANSITIONS=141} [2025-03-04 02:22:49,974 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 71 predicate places. [2025-03-04 02:22:49,974 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 141 transitions, 1389 flow [2025-03-04 02:22:49,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-04 02:22:49,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:49,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:49,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:22:49,974 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:49,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:49,975 INFO L85 PathProgramCache]: Analyzing trace with hash 308714597, now seen corresponding path program 5 times [2025-03-04 02:22:49,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:49,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301026147] [2025-03-04 02:22:49,975 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:22:49,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:49,981 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:22:49,986 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:22:49,986 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:22:49,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:50,033 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-04 02:22:50,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:50,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301026147] [2025-03-04 02:22:50,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301026147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:50,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624150783] [2025-03-04 02:22:50,034 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:22:50,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:50,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:50,036 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:22:50,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:22:50,080 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:22:50,094 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:22:50,095 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:22:50,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:50,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:22:50,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:50,120 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-04 02:22:50,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:22:50,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624150783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:50,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:22:50,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-04 02:22:50,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426453502] [2025-03-04 02:22:50,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:50,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:22:50,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:50,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:22:50,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:22:50,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2025-03-04 02:22:50,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 141 transitions, 1389 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-04 02:22:50,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:50,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2025-03-04 02:22:50,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:50,231 INFO L124 PetriNetUnfolderBase]: 446/881 cut-off events. [2025-03-04 02:22:50,231 INFO L125 PetriNetUnfolderBase]: For 3799/3833 co-relation queries the response was YES. [2025-03-04 02:22:50,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4008 conditions, 881 events. 446/881 cut-off events. For 3799/3833 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4663 event pairs, 195 based on Foata normal form. 30/901 useless extension candidates. Maximal degree in co-relation 3626. Up to 667 conditions per place. [2025-03-04 02:22:50,236 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 95 selfloop transitions, 2 changer transitions 16/158 dead transitions. [2025-03-04 02:22:50,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 158 transitions, 1762 flow [2025-03-04 02:22:50,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:22:50,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:22:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-03-04 02:22:50,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2025-03-04 02:22:50,237 INFO L175 Difference]: Start difference. First operand has 97 places, 141 transitions, 1389 flow. Second operand 4 states and 54 transitions. [2025-03-04 02:22:50,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 158 transitions, 1762 flow [2025-03-04 02:22:50,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 158 transitions, 1688 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 02:22:50,247 INFO L231 Difference]: Finished difference. Result has 97 places, 142 transitions, 1345 flow [2025-03-04 02:22:50,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1345, PETRI_PLACES=97, PETRI_TRANSITIONS=142} [2025-03-04 02:22:50,249 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 71 predicate places. [2025-03-04 02:22:50,249 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 142 transitions, 1345 flow [2025-03-04 02:22:50,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-04 02:22:50,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:50,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:50,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 02:22:50,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:50,450 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:50,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:50,450 INFO L85 PathProgramCache]: Analyzing trace with hash 732055848, now seen corresponding path program 1 times [2025-03-04 02:22:50,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:50,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572812828] [2025-03-04 02:22:50,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:50,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:50,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:22:50,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:22:50,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:50,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:22:50,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572812828] [2025-03-04 02:22:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572812828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:50,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:50,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:22:50,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710646311] [2025-03-04 02:22:50,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:50,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:22:50,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:50,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:22:50,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:22:50,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2025-03-04 02:22:50,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 142 transitions, 1345 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-04 02:22:50,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:50,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2025-03-04 02:22:50,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:50,644 INFO L124 PetriNetUnfolderBase]: 462/830 cut-off events. [2025-03-04 02:22:50,645 INFO L125 PetriNetUnfolderBase]: For 2957/2983 co-relation queries the response was YES. [2025-03-04 02:22:50,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3705 conditions, 830 events. 462/830 cut-off events. For 2957/2983 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3895 event pairs, 114 based on Foata normal form. 2/825 useless extension candidates. Maximal degree in co-relation 3670. Up to 403 conditions per place. [2025-03-04 02:22:50,651 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 93 selfloop transitions, 35 changer transitions 3/155 dead transitions. [2025-03-04 02:22:50,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 155 transitions, 1679 flow [2025-03-04 02:22:50,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:22:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:22:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-03-04 02:22:50,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46923076923076923 [2025-03-04 02:22:50,652 INFO L175 Difference]: Start difference. First operand has 97 places, 142 transitions, 1345 flow. Second operand 5 states and 61 transitions. [2025-03-04 02:22:50,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 155 transitions, 1679 flow [2025-03-04 02:22:50,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 155 transitions, 1665 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 02:22:50,662 INFO L231 Difference]: Finished difference. Result has 99 places, 141 transitions, 1403 flow [2025-03-04 02:22:50,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1337, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1403, PETRI_PLACES=99, PETRI_TRANSITIONS=141} [2025-03-04 02:22:50,663 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 73 predicate places. [2025-03-04 02:22:50,663 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 141 transitions, 1403 flow [2025-03-04 02:22:50,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-04 02:22:50,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:50,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:50,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:22:50,664 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:50,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:50,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1456122595, now seen corresponding path program 1 times [2025-03-04 02:22:50,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:50,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596879251] [2025-03-04 02:22:50,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:50,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:22:50,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:22:50,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:50,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:22:50,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:50,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596879251] [2025-03-04 02:22:50,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596879251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:50,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932544444] [2025-03-04 02:22:50,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:50,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:50,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:50,752 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:22:50,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:22:50,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:22:50,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:22:50,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:50,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:50,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:22:50,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:22:50,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:22:50,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932544444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:50,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:50,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-04 02:22:50,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046069270] [2025-03-04 02:22:50,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:50,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:22:50,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:50,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:22:50,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:22:50,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:22:50,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 141 transitions, 1403 flow. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 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-04 02:22:50,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:50,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:22:50,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:51,184 INFO L124 PetriNetUnfolderBase]: 576/993 cut-off events. [2025-03-04 02:22:51,184 INFO L125 PetriNetUnfolderBase]: For 3488/3488 co-relation queries the response was YES. [2025-03-04 02:22:51,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4439 conditions, 993 events. 576/993 cut-off events. For 3488/3488 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4593 event pairs, 44 based on Foata normal form. 8/1000 useless extension candidates. Maximal degree in co-relation 4400. Up to 223 conditions per place. [2025-03-04 02:22:51,190 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 114 selfloop transitions, 93 changer transitions 1/209 dead transitions. [2025-03-04 02:22:51,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 209 transitions, 2207 flow [2025-03-04 02:22:51,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:22:51,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:22:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 149 transitions. [2025-03-04 02:22:51,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.382051282051282 [2025-03-04 02:22:51,192 INFO L175 Difference]: Start difference. First operand has 99 places, 141 transitions, 1403 flow. Second operand 15 states and 149 transitions. [2025-03-04 02:22:51,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 209 transitions, 2207 flow [2025-03-04 02:22:51,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 209 transitions, 2117 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-04 02:22:51,208 INFO L231 Difference]: Finished difference. Result has 109 places, 157 transitions, 1686 flow [2025-03-04 02:22:51,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1686, PETRI_PLACES=109, PETRI_TRANSITIONS=157} [2025-03-04 02:22:51,209 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 83 predicate places. [2025-03-04 02:22:51,209 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 157 transitions, 1686 flow [2025-03-04 02:22:51,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 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-04 02:22:51,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:51,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:51,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 02:22:51,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:51,410 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:51,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:51,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1593825123, now seen corresponding path program 2 times [2025-03-04 02:22:51,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:51,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208451101] [2025-03-04 02:22:51,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:22:51,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:51,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:22:51,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:22:51,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:22:51,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:22:51,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:51,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208451101] [2025-03-04 02:22:51,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208451101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:51,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:51,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:22:51,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287522905] [2025-03-04 02:22:51,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:51,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:22:51,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:51,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:22:51,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:22:51,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2025-03-04 02:22:51,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 157 transitions, 1686 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-04 02:22:51,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:51,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2025-03-04 02:22:51,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:51,600 INFO L124 PetriNetUnfolderBase]: 506/888 cut-off events. [2025-03-04 02:22:51,600 INFO L125 PetriNetUnfolderBase]: For 3855/3879 co-relation queries the response was YES. [2025-03-04 02:22:51,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4201 conditions, 888 events. 506/888 cut-off events. For 3855/3879 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4195 event pairs, 137 based on Foata normal form. 3/880 useless extension candidates. Maximal degree in co-relation 4162. Up to 465 conditions per place. [2025-03-04 02:22:51,607 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 106 selfloop transitions, 34 changer transitions 3/169 dead transitions. [2025-03-04 02:22:51,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 169 transitions, 2012 flow [2025-03-04 02:22:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:22:51,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:22:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2025-03-04 02:22:51,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2025-03-04 02:22:51,608 INFO L175 Difference]: Start difference. First operand has 109 places, 157 transitions, 1686 flow. Second operand 5 states and 60 transitions. [2025-03-04 02:22:51,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 169 transitions, 2012 flow [2025-03-04 02:22:51,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 169 transitions, 1889 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-03-04 02:22:51,619 INFO L231 Difference]: Finished difference. Result has 108 places, 156 transitions, 1618 flow [2025-03-04 02:22:51,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1618, PETRI_PLACES=108, PETRI_TRANSITIONS=156} [2025-03-04 02:22:51,620 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 82 predicate places. [2025-03-04 02:22:51,620 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 156 transitions, 1618 flow [2025-03-04 02:22:51,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-04 02:22:51,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:51,620 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:51,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:22:51,620 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:51,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1335385408, now seen corresponding path program 1 times [2025-03-04 02:22:51,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:51,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777731938] [2025-03-04 02:22:51,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:51,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:51,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:22:51,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:22:51,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:51,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:51,686 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-04 02:22:51,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:51,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777731938] [2025-03-04 02:22:51,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777731938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:51,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:51,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:22:51,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857809491] [2025-03-04 02:22:51,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:51,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:22:51,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:51,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:22:51,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:22:51,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2025-03-04 02:22:51,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 156 transitions, 1618 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 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-04 02:22:51,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:51,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2025-03-04 02:22:51,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:51,802 INFO L124 PetriNetUnfolderBase]: 474/887 cut-off events. [2025-03-04 02:22:51,802 INFO L125 PetriNetUnfolderBase]: For 3669/3698 co-relation queries the response was YES. [2025-03-04 02:22:51,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4124 conditions, 887 events. 474/887 cut-off events. For 3669/3698 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4405 event pairs, 120 based on Foata normal form. 21/895 useless extension candidates. Maximal degree in co-relation 3584. Up to 690 conditions per place. [2025-03-04 02:22:51,809 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 116 selfloop transitions, 5 changer transitions 0/172 dead transitions. [2025-03-04 02:22:51,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 172 transitions, 1979 flow [2025-03-04 02:22:51,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:22:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:22:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2025-03-04 02:22:51,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43846153846153846 [2025-03-04 02:22:51,814 INFO L175 Difference]: Start difference. First operand has 108 places, 156 transitions, 1618 flow. Second operand 5 states and 57 transitions. [2025-03-04 02:22:51,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 172 transitions, 1979 flow [2025-03-04 02:22:51,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 172 transitions, 1899 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 02:22:51,825 INFO L231 Difference]: Finished difference. Result has 109 places, 160 transitions, 1589 flow [2025-03-04 02:22:51,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1589, PETRI_PLACES=109, PETRI_TRANSITIONS=160} [2025-03-04 02:22:51,826 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 83 predicate places. [2025-03-04 02:22:51,826 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 160 transitions, 1589 flow [2025-03-04 02:22:51,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 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-04 02:22:51,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:51,827 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] [2025-03-04 02:22:51,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 02:22:51,827 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:51,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:51,827 INFO L85 PathProgramCache]: Analyzing trace with hash -536164984, now seen corresponding path program 2 times [2025-03-04 02:22:51,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:51,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176317785] [2025-03-04 02:22:51,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:22:51,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:51,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:22:51,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-03-04 02:22:51,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:22:51,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:51,903 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-04 02:22:51,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:51,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176317785] [2025-03-04 02:22:51,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176317785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:51,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:51,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:22:51,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356094501] [2025-03-04 02:22:51,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:51,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:22:51,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:51,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:22:51,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:22:51,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2025-03-04 02:22:51,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 160 transitions, 1589 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 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-04 02:22:51,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:51,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2025-03-04 02:22:51,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:52,010 INFO L124 PetriNetUnfolderBase]: 462/877 cut-off events. [2025-03-04 02:22:52,010 INFO L125 PetriNetUnfolderBase]: For 3105/3153 co-relation queries the response was YES. [2025-03-04 02:22:52,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4022 conditions, 877 events. 462/877 cut-off events. For 3105/3153 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4409 event pairs, 200 based on Foata normal form. 12/881 useless extension candidates. Maximal degree in co-relation 3724. Up to 678 conditions per place. [2025-03-04 02:22:52,020 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 104 selfloop transitions, 2 changer transitions 14/171 dead transitions. [2025-03-04 02:22:52,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 171 transitions, 1917 flow [2025-03-04 02:22:52,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:22:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:22:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2025-03-04 02:22:52,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2025-03-04 02:22:52,022 INFO L175 Difference]: Start difference. First operand has 109 places, 160 transitions, 1589 flow. Second operand 5 states and 56 transitions. [2025-03-04 02:22:52,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 171 transitions, 1917 flow [2025-03-04 02:22:52,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 171 transitions, 1913 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:22:52,033 INFO L231 Difference]: Finished difference. Result has 112 places, 157 transitions, 1566 flow [2025-03-04 02:22:52,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1566, PETRI_PLACES=112, PETRI_TRANSITIONS=157} [2025-03-04 02:22:52,034 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 86 predicate places. [2025-03-04 02:22:52,034 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 157 transitions, 1566 flow [2025-03-04 02:22:52,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 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-04 02:22:52,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:52,034 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] [2025-03-04 02:22:52,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 02:22:52,034 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:52,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:52,035 INFO L85 PathProgramCache]: Analyzing trace with hash -140300566, now seen corresponding path program 1 times [2025-03-04 02:22:52,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:52,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521726051] [2025-03-04 02:22:52,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:52,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:52,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:22:52,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:22:52,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:52,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:22:52,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:52,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521726051] [2025-03-04 02:22:52,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521726051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:52,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350367233] [2025-03-04 02:22:52,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:52,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:52,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:52,248 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:22:52,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:22:52,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:22:52,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:22:52,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:52,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:52,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 02:22:52,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:22:52,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:52,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 12 [2025-03-04 02:22:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:22:52,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350367233] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:52,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:52,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-03-04 02:22:52,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081618307] [2025-03-04 02:22:52,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:52,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:22:52,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:52,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:22:52,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:22:52,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2025-03-04 02:22:52,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 157 transitions, 1566 flow. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-04 02:22:52,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:52,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2025-03-04 02:22:52,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:52,775 INFO L124 PetriNetUnfolderBase]: 1325/2404 cut-off events. [2025-03-04 02:22:52,776 INFO L125 PetriNetUnfolderBase]: For 9246/9436 co-relation queries the response was YES. [2025-03-04 02:22:52,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11029 conditions, 2404 events. 1325/2404 cut-off events. For 9246/9436 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 14690 event pairs, 172 based on Foata normal form. 62/2452 useless extension candidates. Maximal degree in co-relation 11000. Up to 641 conditions per place. [2025-03-04 02:22:52,791 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 343 selfloop transitions, 14 changer transitions 20/428 dead transitions. [2025-03-04 02:22:52,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 428 transitions, 5056 flow [2025-03-04 02:22:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:22:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:22:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2025-03-04 02:22:52,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5341880341880342 [2025-03-04 02:22:52,792 INFO L175 Difference]: Start difference. First operand has 112 places, 157 transitions, 1566 flow. Second operand 9 states and 125 transitions. [2025-03-04 02:22:52,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 428 transitions, 5056 flow [2025-03-04 02:22:52,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 428 transitions, 5040 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 02:22:52,812 INFO L231 Difference]: Finished difference. Result has 116 places, 170 transitions, 1673 flow [2025-03-04 02:22:52,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1673, PETRI_PLACES=116, PETRI_TRANSITIONS=170} [2025-03-04 02:22:52,813 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 90 predicate places. [2025-03-04 02:22:52,813 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 170 transitions, 1673 flow [2025-03-04 02:22:52,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-04 02:22:52,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:52,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:52,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 02:22:53,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 02:22:53,013 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:53,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:53,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2064144814, now seen corresponding path program 2 times [2025-03-04 02:22:53,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:53,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084660857] [2025-03-04 02:22:53,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:22:53,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:53,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:22:53,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-03-04 02:22:53,037 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:22:53,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:53,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:53,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:53,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084660857] [2025-03-04 02:22:53,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084660857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:53,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:53,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:22:53,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040894434] [2025-03-04 02:22:53,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:53,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:22:53,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:53,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:22:53,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:22:53,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2025-03-04 02:22:53,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 170 transitions, 1673 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 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-04 02:22:53,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:53,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2025-03-04 02:22:53,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:53,445 INFO L124 PetriNetUnfolderBase]: 1832/3328 cut-off events. [2025-03-04 02:22:53,445 INFO L125 PetriNetUnfolderBase]: For 13692/13942 co-relation queries the response was YES. [2025-03-04 02:22:53,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16073 conditions, 3328 events. 1832/3328 cut-off events. For 13692/13942 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 21248 event pairs, 197 based on Foata normal form. 118/3438 useless extension candidates. Maximal degree in co-relation 13960. Up to 1928 conditions per place. [2025-03-04 02:22:53,468 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 208 selfloop transitions, 13 changer transitions 1/273 dead transitions. [2025-03-04 02:22:53,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 273 transitions, 3168 flow [2025-03-04 02:22:53,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:22:53,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:22:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-03-04 02:22:53,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-04 02:22:53,469 INFO L175 Difference]: Start difference. First operand has 116 places, 170 transitions, 1673 flow. Second operand 4 states and 65 transitions. [2025-03-04 02:22:53,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 273 transitions, 3168 flow [2025-03-04 02:22:53,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 273 transitions, 3136 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-03-04 02:22:53,496 INFO L231 Difference]: Finished difference. Result has 120 places, 178 transitions, 1750 flow [2025-03-04 02:22:53,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1653, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1750, PETRI_PLACES=120, PETRI_TRANSITIONS=178} [2025-03-04 02:22:53,497 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 94 predicate places. [2025-03-04 02:22:53,497 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 178 transitions, 1750 flow [2025-03-04 02:22:53,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 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-04 02:22:53,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:53,497 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:53,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 02:22:53,497 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:53,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:53,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1778638005, now seen corresponding path program 3 times [2025-03-04 02:22:53,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:53,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654557407] [2025-03-04 02:22:53,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:22:53,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:53,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:22:53,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:22:53,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:22:53,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:53,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:53,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654557407] [2025-03-04 02:22:53,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654557407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:53,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088545523] [2025-03-04 02:22:53,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:22:53,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:53,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:53,589 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:22:53,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:22:53,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:22:53,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:22:53,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:22:53,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:53,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:22:53,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:53,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:53,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088545523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:53,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:53,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 02:22:53,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341675343] [2025-03-04 02:22:53,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:53,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:22:53,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:53,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:22:53,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:22:53,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:22:53,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 178 transitions, 1750 flow. Second operand has 15 states, 15 states have (on average 6.4) internal successors, (96), 15 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-04 02:22:53,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:53,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:22:53,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:54,597 INFO L124 PetriNetUnfolderBase]: 3374/5623 cut-off events. [2025-03-04 02:22:54,597 INFO L125 PetriNetUnfolderBase]: For 19728/19728 co-relation queries the response was YES. [2025-03-04 02:22:54,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26905 conditions, 5623 events. 3374/5623 cut-off events. For 19728/19728 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 34237 event pairs, 137 based on Foata normal form. 144/5767 useless extension candidates. Maximal degree in co-relation 23703. Up to 1018 conditions per place. [2025-03-04 02:22:54,628 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 304 selfloop transitions, 154 changer transitions 8/467 dead transitions. [2025-03-04 02:22:54,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 467 transitions, 4749 flow [2025-03-04 02:22:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 02:22:54,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-04 02:22:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 287 transitions. [2025-03-04 02:22:54,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3806366047745358 [2025-03-04 02:22:54,629 INFO L175 Difference]: Start difference. First operand has 120 places, 178 transitions, 1750 flow. Second operand 29 states and 287 transitions. [2025-03-04 02:22:54,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 467 transitions, 4749 flow [2025-03-04 02:22:54,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 467 transitions, 4729 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-03-04 02:22:54,709 INFO L231 Difference]: Finished difference. Result has 165 places, 243 transitions, 2902 flow [2025-03-04 02:22:54,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1746, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=2902, PETRI_PLACES=165, PETRI_TRANSITIONS=243} [2025-03-04 02:22:54,709 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 139 predicate places. [2025-03-04 02:22:54,710 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 243 transitions, 2902 flow [2025-03-04 02:22:54,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.4) internal successors, (96), 15 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-04 02:22:54,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:54,710 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:54,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 02:22:54,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:54,917 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:54,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:54,918 INFO L85 PathProgramCache]: Analyzing trace with hash 36455725, now seen corresponding path program 4 times [2025-03-04 02:22:54,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:54,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258034014] [2025-03-04 02:22:54,918 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:22:54,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:54,926 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:22:54,928 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 26 statements. [2025-03-04 02:22:54,928 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:22:54,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:54,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:54,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258034014] [2025-03-04 02:22:54,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258034014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:54,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756079187] [2025-03-04 02:22:54,965 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:22:54,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:54,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:54,967 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:22:54,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:22:55,018 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:22:55,028 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 26 statements. [2025-03-04 02:22:55,029 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:22:55,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:55,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:22:55,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:55,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:55,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756079187] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:55,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:55,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-04 02:22:55,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841878659] [2025-03-04 02:22:55,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:55,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:22:55,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:55,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:22:55,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:22:55,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:22:55,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 243 transitions, 2902 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:55,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:55,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:22:55,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:56,079 INFO L124 PetriNetUnfolderBase]: 4569/7605 cut-off events. [2025-03-04 02:22:56,079 INFO L125 PetriNetUnfolderBase]: For 56122/56122 co-relation queries the response was YES. [2025-03-04 02:22:56,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43225 conditions, 7605 events. 4569/7605 cut-off events. For 56122/56122 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 48146 event pairs, 222 based on Foata normal form. 46/7651 useless extension candidates. Maximal degree in co-relation 40636. Up to 1499 conditions per place. [2025-03-04 02:22:56,133 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 234 selfloop transitions, 212 changer transitions 9/456 dead transitions. [2025-03-04 02:22:56,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 456 transitions, 5826 flow [2025-03-04 02:22:56,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:22:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:22:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 152 transitions. [2025-03-04 02:22:56,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38974358974358975 [2025-03-04 02:22:56,136 INFO L175 Difference]: Start difference. First operand has 165 places, 243 transitions, 2902 flow. Second operand 15 states and 152 transitions. [2025-03-04 02:22:56,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 456 transitions, 5826 flow [2025-03-04 02:22:56,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 456 transitions, 5676 flow, removed 32 selfloop flow, removed 5 redundant places. [2025-03-04 02:22:56,406 INFO L231 Difference]: Finished difference. Result has 181 places, 322 transitions, 4458 flow [2025-03-04 02:22:56,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2788, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4458, PETRI_PLACES=181, PETRI_TRANSITIONS=322} [2025-03-04 02:22:56,407 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 155 predicate places. [2025-03-04 02:22:56,407 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 322 transitions, 4458 flow [2025-03-04 02:22:56,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:56,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:56,407 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:56,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 02:22:56,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 02:22:56,608 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:56,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:56,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1828114975, now seen corresponding path program 5 times [2025-03-04 02:22:56,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:56,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505028734] [2025-03-04 02:22:56,608 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:22:56,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:56,616 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-03-04 02:22:56,624 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:22:56,624 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:22:56,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:56,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:56,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505028734] [2025-03-04 02:22:56,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505028734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:56,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744449049] [2025-03-04 02:22:56,682 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:22:56,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:56,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:56,684 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:22:56,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:22:56,736 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-03-04 02:22:56,759 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:22:56,759 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:22:56,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:56,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:22:56,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:56,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:56,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744449049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:56,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:56,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-04 02:22:56,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375306462] [2025-03-04 02:22:56,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:56,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:22:56,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:56,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:22:56,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:22:56,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:22:56,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 322 transitions, 4458 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:56,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:56,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:22:56,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:58,289 INFO L124 PetriNetUnfolderBase]: 5912/9817 cut-off events. [2025-03-04 02:22:58,289 INFO L125 PetriNetUnfolderBase]: For 105316/105316 co-relation queries the response was YES. [2025-03-04 02:22:58,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61243 conditions, 9817 events. 5912/9817 cut-off events. For 105316/105316 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 63620 event pairs, 265 based on Foata normal form. 100/9917 useless extension candidates. Maximal degree in co-relation 57799. Up to 2255 conditions per place. [2025-03-04 02:22:58,370 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 257 selfloop transitions, 273 changer transitions 6/537 dead transitions. [2025-03-04 02:22:58,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 537 transitions, 7716 flow [2025-03-04 02:22:58,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:22:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:22:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions. [2025-03-04 02:22:58,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2025-03-04 02:22:58,375 INFO L175 Difference]: Start difference. First operand has 181 places, 322 transitions, 4458 flow. Second operand 16 states and 168 transitions. [2025-03-04 02:22:58,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 537 transitions, 7716 flow [2025-03-04 02:22:59,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 537 transitions, 7658 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-03-04 02:22:59,158 INFO L231 Difference]: Finished difference. Result has 204 places, 394 transitions, 6479 flow [2025-03-04 02:22:59,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=4408, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6479, PETRI_PLACES=204, PETRI_TRANSITIONS=394} [2025-03-04 02:22:59,159 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 178 predicate places. [2025-03-04 02:22:59,159 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 394 transitions, 6479 flow [2025-03-04 02:22:59,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:59,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:59,159 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:59,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 02:22:59,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 02:22:59,359 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:59,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:59,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1170148507, now seen corresponding path program 6 times [2025-03-04 02:22:59,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:59,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303354544] [2025-03-04 02:22:59,360 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:22:59,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:59,374 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:22:59,383 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:22:59,384 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:22:59,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:59,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:59,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303354544] [2025-03-04 02:22:59,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303354544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:59,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496413858] [2025-03-04 02:22:59,461 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:22:59,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:59,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:59,463 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:22:59,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 02:22:59,521 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:22:59,542 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:22:59,542 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:22:59,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:59,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:22:59,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:59,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:59,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496413858] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:59,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:59,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 02:22:59,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369649622] [2025-03-04 02:22:59,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:59,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:22:59,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:59,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:22:59,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:22:59,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:22:59,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 394 transitions, 6479 flow. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-04 02:22:59,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:59,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:22:59,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:23:01,466 INFO L124 PetriNetUnfolderBase]: 7134/11852 cut-off events. [2025-03-04 02:23:01,466 INFO L125 PetriNetUnfolderBase]: For 192123/192123 co-relation queries the response was YES. [2025-03-04 02:23:01,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83573 conditions, 11852 events. 7134/11852 cut-off events. For 192123/192123 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 79208 event pairs, 288 based on Foata normal form. 76/11928 useless extension candidates. Maximal degree in co-relation 79938. Up to 2115 conditions per place. [2025-03-04 02:23:01,659 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 356 selfloop transitions, 347 changer transitions 4/708 dead transitions. [2025-03-04 02:23:01,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 708 transitions, 11365 flow [2025-03-04 02:23:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 02:23:01,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 02:23:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 261 transitions. [2025-03-04 02:23:01,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.386094674556213 [2025-03-04 02:23:01,660 INFO L175 Difference]: Start difference. First operand has 204 places, 394 transitions, 6479 flow. Second operand 26 states and 261 transitions. [2025-03-04 02:23:01,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 708 transitions, 11365 flow [2025-03-04 02:23:03,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 708 transitions, 11275 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 02:23:03,038 INFO L231 Difference]: Finished difference. Result has 238 places, 481 transitions, 9227 flow [2025-03-04 02:23:03,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=6389, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=267, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=9227, PETRI_PLACES=238, PETRI_TRANSITIONS=481} [2025-03-04 02:23:03,038 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 212 predicate places. [2025-03-04 02:23:03,039 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 481 transitions, 9227 flow [2025-03-04 02:23:03,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-04 02:23:03,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:23:03,039 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:23:03,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 02:23:03,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 02:23:03,243 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:23:03,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:23:03,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1376375701, now seen corresponding path program 7 times [2025-03-04 02:23:03,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:23:03,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388794971] [2025-03-04 02:23:03,244 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:23:03,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:23:03,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:23:03,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:23:03,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:23:03,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:03,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:23:03,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388794971] [2025-03-04 02:23:03,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388794971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:23:03,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998094600] [2025-03-04 02:23:03,316 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:23:03,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:23:03,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:23:03,318 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:23:03,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 02:23:03,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:23:03,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:23:03,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:23:03,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:03,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:23:03,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:23:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:03,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:23:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:03,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998094600] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:23:03,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:23:03,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 02:23:03,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249645083] [2025-03-04 02:23:03,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:23:03,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:23:03,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:23:03,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:23:03,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:23:03,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:23:03,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 481 transitions, 9227 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-04 02:23:03,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:23:03,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:23:03,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:23:05,744 INFO L124 PetriNetUnfolderBase]: 7154/11912 cut-off events. [2025-03-04 02:23:05,744 INFO L125 PetriNetUnfolderBase]: For 255984/255984 co-relation queries the response was YES. [2025-03-04 02:23:05,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94428 conditions, 11912 events. 7154/11912 cut-off events. For 255984/255984 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 80345 event pairs, 793 based on Foata normal form. 22/11934 useless extension candidates. Maximal degree in co-relation 90687. Up to 3263 conditions per place. [2025-03-04 02:23:05,881 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 404 selfloop transitions, 226 changer transitions 6/637 dead transitions. [2025-03-04 02:23:05,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 637 transitions, 11943 flow [2025-03-04 02:23:05,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:23:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:23:05,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2025-03-04 02:23:05,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4319526627218935 [2025-03-04 02:23:05,885 INFO L175 Difference]: Start difference. First operand has 238 places, 481 transitions, 9227 flow. Second operand 13 states and 146 transitions. [2025-03-04 02:23:05,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 637 transitions, 11943 flow [2025-03-04 02:23:08,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 637 transitions, 11431 flow, removed 160 selfloop flow, removed 13 redundant places. [2025-03-04 02:23:08,395 INFO L231 Difference]: Finished difference. Result has 239 places, 480 transitions, 9169 flow [2025-03-04 02:23:08,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=8715, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9169, PETRI_PLACES=239, PETRI_TRANSITIONS=480} [2025-03-04 02:23:08,396 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 213 predicate places. [2025-03-04 02:23:08,396 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 480 transitions, 9169 flow [2025-03-04 02:23:08,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-04 02:23:08,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:23:08,396 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:23:08,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 02:23:08,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 02:23:08,597 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:23:08,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:23:08,597 INFO L85 PathProgramCache]: Analyzing trace with hash -231056415, now seen corresponding path program 8 times [2025-03-04 02:23:08,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:23:08,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804259925] [2025-03-04 02:23:08,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:23:08,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:23:08,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:23:08,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:23:08,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:23:08,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:08,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:23:08,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804259925] [2025-03-04 02:23:08,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804259925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:23:08,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653408527] [2025-03-04 02:23:08,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:23:08,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:23:08,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:23:08,668 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:23:08,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 02:23:08,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:23:08,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:23:08,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:23:08,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:08,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:23:08,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:23:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:08,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:23:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:08,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653408527] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:23:08,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:23:08,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2025-03-04 02:23:08,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562976733] [2025-03-04 02:23:08,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:23:08,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:23:08,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:23:08,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:23:08,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:23:08,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:23:08,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 480 transitions, 9169 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-04 02:23:08,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:23:08,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:23:08,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:23:11,097 INFO L124 PetriNetUnfolderBase]: 8206/13548 cut-off events. [2025-03-04 02:23:11,098 INFO L125 PetriNetUnfolderBase]: For 281345/281345 co-relation queries the response was YES. [2025-03-04 02:23:11,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107916 conditions, 13548 events. 8206/13548 cut-off events. For 281345/281345 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 91838 event pairs, 515 based on Foata normal form. 70/13618 useless extension candidates. Maximal degree in co-relation 107423. Up to 2744 conditions per place. [2025-03-04 02:23:11,194 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 364 selfloop transitions, 427 changer transitions 4/796 dead transitions. [2025-03-04 02:23:11,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 796 transitions, 14505 flow [2025-03-04 02:23:11,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 02:23:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 02:23:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 255 transitions. [2025-03-04 02:23:11,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3772189349112426 [2025-03-04 02:23:11,195 INFO L175 Difference]: Start difference. First operand has 239 places, 480 transitions, 9169 flow. Second operand 26 states and 255 transitions. [2025-03-04 02:23:11,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 796 transitions, 14505 flow [2025-03-04 02:23:14,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 796 transitions, 14062 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-03-04 02:23:14,169 INFO L231 Difference]: Finished difference. Result has 264 places, 569 transitions, 12170 flow [2025-03-04 02:23:14,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=8765, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=347, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=12170, PETRI_PLACES=264, PETRI_TRANSITIONS=569} [2025-03-04 02:23:14,170 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 238 predicate places. [2025-03-04 02:23:14,170 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 569 transitions, 12170 flow [2025-03-04 02:23:14,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-04 02:23:14,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:23:14,170 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:23:14,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 02:23:14,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:23:14,371 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:23:14,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:23:14,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1809121527, now seen corresponding path program 9 times [2025-03-04 02:23:14,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:23:14,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95718810] [2025-03-04 02:23:14,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:23:14,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:23:14,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:23:14,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:23:14,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:23:14,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:14,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:23:14,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95718810] [2025-03-04 02:23:14,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95718810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:23:14,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008085417] [2025-03-04 02:23:14,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:23:14,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:23:14,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:23:14,452 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:23:14,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 02:23:14,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:23:14,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:23:14,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:23:14,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:14,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:23:14,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:23:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:14,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:23:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:14,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008085417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:23:14,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:23:14,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 02:23:14,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75581266] [2025-03-04 02:23:14,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:23:14,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:23:14,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:23:14,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:23:14,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:23:14,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:23:14,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 569 transitions, 12170 flow. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-04 02:23:14,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:23:14,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:23:14,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:23:17,702 INFO L124 PetriNetUnfolderBase]: 8897/14621 cut-off events. [2025-03-04 02:23:17,703 INFO L125 PetriNetUnfolderBase]: For 394184/394184 co-relation queries the response was YES. [2025-03-04 02:23:17,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127697 conditions, 14621 events. 8897/14621 cut-off events. For 394184/394184 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 99971 event pairs, 927 based on Foata normal form. 30/14651 useless extension candidates. Maximal degree in co-relation 126293. Up to 3865 conditions per place. [2025-03-04 02:23:17,839 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 477 selfloop transitions, 277 changer transitions 16/771 dead transitions. [2025-03-04 02:23:17,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 771 transitions, 15992 flow [2025-03-04 02:23:17,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:23:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:23:17,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 165 transitions. [2025-03-04 02:23:17,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39663461538461536 [2025-03-04 02:23:17,840 INFO L175 Difference]: Start difference. First operand has 264 places, 569 transitions, 12170 flow. Second operand 16 states and 165 transitions. [2025-03-04 02:23:17,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 771 transitions, 15992 flow [2025-03-04 02:23:22,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 771 transitions, 15486 flow, removed 170 selfloop flow, removed 9 redundant places. [2025-03-04 02:23:22,446 INFO L231 Difference]: Finished difference. Result has 276 places, 586 transitions, 12879 flow [2025-03-04 02:23:22,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=11777, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=257, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=12879, PETRI_PLACES=276, PETRI_TRANSITIONS=586} [2025-03-04 02:23:22,447 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 250 predicate places. [2025-03-04 02:23:22,447 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 586 transitions, 12879 flow [2025-03-04 02:23:22,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-04 02:23:22,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:23:22,447 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:23:22,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 02:23:22,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 02:23:22,648 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:23:22,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:23:22,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1612935882, now seen corresponding path program 10 times [2025-03-04 02:23:22,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:23:22,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419111971] [2025-03-04 02:23:22,648 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:23:22,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:23:22,654 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:23:22,656 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 26 statements. [2025-03-04 02:23:22,657 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:23:22,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:22,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:23:22,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419111971] [2025-03-04 02:23:22,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419111971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:23:22,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585104745] [2025-03-04 02:23:22,696 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:23:22,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:23:22,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:23:22,700 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:23:22,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 02:23:22,758 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:23:22,769 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 26 statements. [2025-03-04 02:23:22,769 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:23:22,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:22,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:23:22,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:23:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:22,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:23:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:22,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585104745] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:23:22,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:23:22,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-04 02:23:22,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538982540] [2025-03-04 02:23:22,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:23:22,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:23:22,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:23:22,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:23:22,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:23:22,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:23:22,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 586 transitions, 12879 flow. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-04 02:23:22,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:23:22,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:23:22,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:23:25,845 INFO L124 PetriNetUnfolderBase]: 9930/16320 cut-off events. [2025-03-04 02:23:25,845 INFO L125 PetriNetUnfolderBase]: For 470775/470775 co-relation queries the response was YES. [2025-03-04 02:23:25,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144232 conditions, 16320 events. 9930/16320 cut-off events. For 470775/470775 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 113678 event pairs, 1833 based on Foata normal form. 288/16608 useless extension candidates. Maximal degree in co-relation 143509. Up to 7262 conditions per place. [2025-03-04 02:23:25,988 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 683 selfloop transitions, 195 changer transitions 0/879 dead transitions. [2025-03-04 02:23:25,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 879 transitions, 19003 flow [2025-03-04 02:23:25,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:23:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 02:23:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 208 transitions. [2025-03-04 02:23:25,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-04 02:23:25,989 INFO L175 Difference]: Start difference. First operand has 276 places, 586 transitions, 12879 flow. Second operand 20 states and 208 transitions. [2025-03-04 02:23:25,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 879 transitions, 19003 flow [2025-03-04 02:23:31,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 879 transitions, 18661 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-03-04 02:23:31,044 INFO L231 Difference]: Finished difference. Result has 296 places, 643 transitions, 14774 flow [2025-03-04 02:23:31,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=12453, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=14774, PETRI_PLACES=296, PETRI_TRANSITIONS=643} [2025-03-04 02:23:31,045 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 270 predicate places. [2025-03-04 02:23:31,045 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 643 transitions, 14774 flow [2025-03-04 02:23:31,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-04 02:23:31,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:23:31,045 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:23:31,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 02:23:31,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 02:23:31,246 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:23:31,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:23:31,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2092288753, now seen corresponding path program 11 times [2025-03-04 02:23:31,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:23:31,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731873008] [2025-03-04 02:23:31,247 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:23:31,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:23:31,254 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-03-04 02:23:31,262 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:23:31,263 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:23:31,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:31,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:23:31,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731873008] [2025-03-04 02:23:31,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731873008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:23:31,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857101215] [2025-03-04 02:23:31,317 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:23:31,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:23:31,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:23:31,319 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:23:31,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 02:23:31,383 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-03-04 02:23:31,404 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:23:31,405 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:23:31,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:31,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:23:31,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:23:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:31,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:23:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:31,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857101215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:23:31,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:23:31,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-04 02:23:31,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722309919] [2025-03-04 02:23:31,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:23:31,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:23:31,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:23:31,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:23:31,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:23:31,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:23:31,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 643 transitions, 14774 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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-04 02:23:31,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:23:31,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:23:31,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:23:35,513 INFO L124 PetriNetUnfolderBase]: 10824/17731 cut-off events. [2025-03-04 02:23:35,513 INFO L125 PetriNetUnfolderBase]: For 591932/591932 co-relation queries the response was YES. [2025-03-04 02:23:35,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165800 conditions, 17731 events. 10824/17731 cut-off events. For 591932/591932 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 124668 event pairs, 1606 based on Foata normal form. 144/17875 useless extension candidates. Maximal degree in co-relation 164094. Up to 8093 conditions per place. [2025-03-04 02:23:35,723 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 542 selfloop transitions, 313 changer transitions 5/861 dead transitions. [2025-03-04 02:23:35,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 861 transitions, 19429 flow [2025-03-04 02:23:35,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:23:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 02:23:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 211 transitions. [2025-03-04 02:23:35,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40576923076923077 [2025-03-04 02:23:35,724 INFO L175 Difference]: Start difference. First operand has 296 places, 643 transitions, 14774 flow. Second operand 20 states and 211 transitions. [2025-03-04 02:23:35,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 861 transitions, 19429 flow [2025-03-04 02:23:43,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 861 transitions, 18877 flow, removed 228 selfloop flow, removed 8 redundant places. [2025-03-04 02:23:43,175 INFO L231 Difference]: Finished difference. Result has 319 places, 681 transitions, 16583 flow [2025-03-04 02:23:43,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=14224, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=277, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=16583, PETRI_PLACES=319, PETRI_TRANSITIONS=681} [2025-03-04 02:23:43,176 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 293 predicate places. [2025-03-04 02:23:43,176 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 681 transitions, 16583 flow [2025-03-04 02:23:43,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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-04 02:23:43,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:23:43,176 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:23:43,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 02:23:43,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 02:23:43,377 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:23:43,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:23:43,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1313307082, now seen corresponding path program 12 times [2025-03-04 02:23:43,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:23:43,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041438936] [2025-03-04 02:23:43,378 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:23:43,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:23:43,383 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-03-04 02:23:43,390 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:23:43,391 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:23:43,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:43,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:23:43,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041438936] [2025-03-04 02:23:43,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041438936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:23:43,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402286381] [2025-03-04 02:23:43,446 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:23:43,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:23:43,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:23:43,448 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:23:43,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 02:23:43,508 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-03-04 02:23:43,541 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:23:43,541 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:23:43,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:43,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:23:43,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:23:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:43,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:23:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:43,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402286381] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:23:43,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:23:43,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 02:23:43,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087440363] [2025-03-04 02:23:43,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:23:43,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:23:43,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:23:43,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:23:43,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:23:43,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:23:43,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 681 transitions, 16583 flow. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-04 02:23:43,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:23:43,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:23:43,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:23:48,341 INFO L124 PetriNetUnfolderBase]: 12160/19843 cut-off events. [2025-03-04 02:23:48,342 INFO L125 PetriNetUnfolderBase]: For 794104/794104 co-relation queries the response was YES. [2025-03-04 02:23:48,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198091 conditions, 19843 events. 12160/19843 cut-off events. For 794104/794104 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 141755 event pairs, 605 based on Foata normal form. 216/20059 useless extension candidates. Maximal degree in co-relation 196497. Up to 6995 conditions per place. [2025-03-04 02:23:48,601 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 729 selfloop transitions, 324 changer transitions 0/1054 dead transitions. [2025-03-04 02:23:48,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 1054 transitions, 24729 flow [2025-03-04 02:23:48,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 02:23:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-04 02:23:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 281 transitions. [2025-03-04 02:23:48,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3726790450928382 [2025-03-04 02:23:48,603 INFO L175 Difference]: Start difference. First operand has 319 places, 681 transitions, 16583 flow. Second operand 29 states and 281 transitions. [2025-03-04 02:23:48,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 1054 transitions, 24729 flow [2025-03-04 02:23:57,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 1054 transitions, 24356 flow, removed 163 selfloop flow, removed 3 redundant places. [2025-03-04 02:23:57,357 INFO L231 Difference]: Finished difference. Result has 361 places, 760 transitions, 19453 flow [2025-03-04 02:23:57,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=16226, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=19453, PETRI_PLACES=361, PETRI_TRANSITIONS=760} [2025-03-04 02:23:57,358 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 335 predicate places. [2025-03-04 02:23:57,358 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 760 transitions, 19453 flow [2025-03-04 02:23:57,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-04 02:23:57,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:23:57,358 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:23:57,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 02:23:57,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 02:23:57,559 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:23:57,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:23:57,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1476289602, now seen corresponding path program 13 times [2025-03-04 02:23:57,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:23:57,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500479212] [2025-03-04 02:23:57,559 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:23:57,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:23:57,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:23:57,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:23:57,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:23:57,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:57,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:23:57,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500479212] [2025-03-04 02:23:57,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500479212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:23:57,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675609289] [2025-03-04 02:23:57,659 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:23:57,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:23:57,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:23:57,661 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:23:57,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 02:23:57,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:23:57,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:23:57,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:23:57,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:57,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:23:57,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:23:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:57,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:23:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:57,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675609289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:23:57,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:23:57,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-04 02:23:57,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324720300] [2025-03-04 02:23:57,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:23:57,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:23:57,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:23:57,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:23:57,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:23:57,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:23:57,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 760 transitions, 19453 flow. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-04 02:23:57,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:23:57,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:23:57,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:03,114 INFO L124 PetriNetUnfolderBase]: 13273/21671 cut-off events. [2025-03-04 02:24:03,114 INFO L125 PetriNetUnfolderBase]: For 953328/953328 co-relation queries the response was YES. [2025-03-04 02:24:03,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228540 conditions, 21671 events. 13273/21671 cut-off events. For 953328/953328 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 157356 event pairs, 528 based on Foata normal form. 54/21725 useless extension candidates. Maximal degree in co-relation 226607. Up to 7170 conditions per place. [2025-03-04 02:24:03,662 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 611 selfloop transitions, 456 changer transitions 0/1068 dead transitions. [2025-03-04 02:24:03,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 1068 transitions, 28449 flow [2025-03-04 02:24:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:24:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:24:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 145 transitions. [2025-03-04 02:24:03,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2025-03-04 02:24:03,664 INFO L175 Difference]: Start difference. First operand has 361 places, 760 transitions, 19453 flow. Second operand 15 states and 145 transitions. [2025-03-04 02:24:03,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 1068 transitions, 28449 flow [2025-03-04 02:24:16,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 1068 transitions, 27007 flow, removed 685 selfloop flow, removed 4 redundant places. [2025-03-04 02:24:16,639 INFO L231 Difference]: Finished difference. Result has 378 places, 883 transitions, 23193 flow [2025-03-04 02:24:16,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=18715, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=336, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=23193, PETRI_PLACES=378, PETRI_TRANSITIONS=883} [2025-03-04 02:24:16,640 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 352 predicate places. [2025-03-04 02:24:16,640 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 883 transitions, 23193 flow [2025-03-04 02:24:16,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-04 02:24:16,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:16,640 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:16,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 02:24:16,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:16,841 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:24:16,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:16,842 INFO L85 PathProgramCache]: Analyzing trace with hash -28879129, now seen corresponding path program 14 times [2025-03-04 02:24:16,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:16,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770419552] [2025-03-04 02:24:16,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:24:16,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:16,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:24:16,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:24:16,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:24:16,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:24:16,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:16,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770419552] [2025-03-04 02:24:16,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770419552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:16,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045656481] [2025-03-04 02:24:16,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:24:16,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:16,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:16,913 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:24:16,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 02:24:16,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:24:16,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:24:16,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:24:16,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:16,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:24:16,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:17,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:24:17,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:24:17,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045656481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:24:17,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:24:17,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2025-03-04 02:24:17,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370648503] [2025-03-04 02:24:17,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:24:17,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:24:17,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:17,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:24:17,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:24:17,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-03-04 02:24:17,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 883 transitions, 23193 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-04 02:24:17,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:17,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-03-04 02:24:17,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand