./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/unroll-3.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/unroll-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4cca88acec68e5dbb90cd5700ef248bb5273dc097847f9475a683bfbdc7b189 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:28:32,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:28:32,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:28:32,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:28:32,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:28:32,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:28:32,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:28:32,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:28:32,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:28:32,309 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:28:32,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:28:32,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:28:32,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:28:32,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:28:32,310 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:28:32,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:28:32,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:28:32,311 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:28:32,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:28:32,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:28:32,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:28:32,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:28:32,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:28:32,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:28:32,311 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:28:32,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:28:32,311 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:28:32,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:28:32,311 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:28:32,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:28:32,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:28:32,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:28:32,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:28:32,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:28:32,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:28:32,312 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:28:32,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:28:32,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:28:32,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:28:32,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:28:32,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:28:32,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:28:32,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:28:32,312 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 -> a4cca88acec68e5dbb90cd5700ef248bb5273dc097847f9475a683bfbdc7b189 [2025-03-04 02:28:32,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:28:32,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:28:32,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:28:32,531 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:28:32,531 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:28:32,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-3.wvr.c [2025-03-04 02:28:33,593 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/901cace4d/1f57a8872a8f42c0937693cec4b6b145/FLAG18ff75a12 [2025-03-04 02:28:33,800 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:28:33,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-3.wvr.c [2025-03-04 02:28:33,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/901cace4d/1f57a8872a8f42c0937693cec4b6b145/FLAG18ff75a12 [2025-03-04 02:28:34,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/901cace4d/1f57a8872a8f42c0937693cec4b6b145 [2025-03-04 02:28:34,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:28:34,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:28:34,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:28:34,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:28:34,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:28:34,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:28:34" (1/1) ... [2025-03-04 02:28:34,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a132d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:34, skipping insertion in model container [2025-03-04 02:28:34,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:28:34" (1/1) ... [2025-03-04 02:28:34,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:28:34,308 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/unroll-3.wvr.c[2526,2539] [2025-03-04 02:28:34,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:28:34,327 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:28:34,342 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/unroll-3.wvr.c[2526,2539] [2025-03-04 02:28:34,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:28:34,362 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:28:34,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:34 WrapperNode [2025-03-04 02:28:34,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:28:34,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:28:34,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:28:34,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:28:34,368 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:28:34" (1/1) ... [2025-03-04 02:28:34,374 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:28:34" (1/1) ... [2025-03-04 02:28:34,390 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 128 [2025-03-04 02:28:34,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:28:34,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:28:34,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:28:34,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:28:34,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:34" (1/1) ... [2025-03-04 02:28:34,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:34" (1/1) ... [2025-03-04 02:28:34,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:34" (1/1) ... [2025-03-04 02:28:34,416 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 02:28:34,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:34" (1/1) ... [2025-03-04 02:28:34,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:34" (1/1) ... [2025-03-04 02:28:34,426 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:34" (1/1) ... [2025-03-04 02:28:34,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:34" (1/1) ... [2025-03-04 02:28:34,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:34" (1/1) ... [2025-03-04 02:28:34,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:34" (1/1) ... [2025-03-04 02:28:34,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:28:34,435 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:28:34,435 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:28:34,435 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:28:34,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:34" (1/1) ... [2025-03-04 02:28:34,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:28:34,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:34,461 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:28:34,463 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:28:34,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:28:34,481 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:28:34,482 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:28:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:28:34,482 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:28:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:28:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:28:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:28:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:28:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:28:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:28:34,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:28:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:28:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:28:34,483 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:28:34,560 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:28:34,562 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:28:34,754 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:28:34,754 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:28:34,900 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:28:34,900 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:28:34,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:28:34 BoogieIcfgContainer [2025-03-04 02:28:34,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:28:34,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:28:34,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:28:34,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:28:34,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:28:34" (1/3) ... [2025-03-04 02:28:34,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3e57f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:28:34, skipping insertion in model container [2025-03-04 02:28:34,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:34" (2/3) ... [2025-03-04 02:28:34,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3e57f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:28:34, skipping insertion in model container [2025-03-04 02:28:34,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:28:34" (3/3) ... [2025-03-04 02:28:34,909 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2025-03-04 02:28:34,920 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:28:34,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-3.wvr.c that has 3 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 02:28:34,921 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:28:34,960 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:28:34,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2025-03-04 02:28:35,008 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-03-04 02:28:35,010 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:28:35,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-03-04 02:28:35,012 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2025-03-04 02:28:35,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2025-03-04 02:28:35,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:28:35,030 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;@147b2b89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:28:35,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:28:35,039 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:28:35,040 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-03-04 02:28:35,040 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:28:35,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:35,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:35,041 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:28:35,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:35,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1905296501, now seen corresponding path program 1 times [2025-03-04 02:28:35,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:35,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876904039] [2025-03-04 02:28:35,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:35,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:35,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:28:35,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:28:35,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:35,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:35,312 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:28:35,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:35,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876904039] [2025-03-04 02:28:35,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876904039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:35,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:35,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:28:35,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530874534] [2025-03-04 02:28:35,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:35,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:28:35,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:35,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:28:35,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:28:35,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:35,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:28:35,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:35,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:35,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:35,422 INFO L124 PetriNetUnfolderBase]: 69/125 cut-off events. [2025-03-04 02:28:35,422 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 02:28:35,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 125 events. 69/125 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 315 event pairs, 22 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 220. Up to 72 conditions per place. [2025-03-04 02:28:35,424 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 23 selfloop transitions, 3 changer transitions 1/28 dead transitions. [2025-03-04 02:28:35,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 28 transitions, 131 flow [2025-03-04 02:28:35,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:28:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:28:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-03-04 02:28:35,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-03-04 02:28:35,435 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 37 transitions. [2025-03-04 02:28:35,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 28 transitions, 131 flow [2025-03-04 02:28:35,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 28 transitions, 117 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:35,442 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2025-03-04 02:28:35,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2025-03-04 02:28:35,445 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-03-04 02:28:35,446 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2025-03-04 02:28:35,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:28:35,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:35,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:35,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:28:35,447 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:28:35,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:35,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1034973386, now seen corresponding path program 1 times [2025-03-04 02:28:35,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:35,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679968352] [2025-03-04 02:28:35,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:35,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:35,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:28:35,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:28:35,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:35,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:35,593 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:28:35,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:35,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679968352] [2025-03-04 02:28:35,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679968352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:35,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:35,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:28:35,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549833946] [2025-03-04 02:28:35,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:35,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:28:35,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:35,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:28:35,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:28:35,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:35,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 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:28:35,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:35,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:35,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:35,652 INFO L124 PetriNetUnfolderBase]: 69/126 cut-off events. [2025-03-04 02:28:35,655 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 02:28:35,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 126 events. 69/126 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 298 event pairs, 44 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 110. Up to 125 conditions per place. [2025-03-04 02:28:35,657 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2025-03-04 02:28:35,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 20 transitions, 97 flow [2025-03-04 02:28:35,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:28:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:28:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-03-04 02:28:35,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-04 02:28:35,658 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 3 states and 27 transitions. [2025-03-04 02:28:35,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 20 transitions, 97 flow [2025-03-04 02:28:35,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:28:35,659 INFO L231 Difference]: Finished difference. Result has 22 places, 20 transitions, 66 flow [2025-03-04 02:28:35,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=22, PETRI_TRANSITIONS=20} [2025-03-04 02:28:35,659 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2025-03-04 02:28:35,659 INFO L471 AbstractCegarLoop]: Abstraction has has 22 places, 20 transitions, 66 flow [2025-03-04 02:28:35,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 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:28:35,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:35,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:35,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:28:35,660 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:28:35,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:35,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1673572502, now seen corresponding path program 1 times [2025-03-04 02:28:35,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:35,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310333210] [2025-03-04 02:28:35,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:35,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:35,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:28:35,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:35,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:35,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:35,834 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:28:35,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:35,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310333210] [2025-03-04 02:28:35,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310333210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:35,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425986649] [2025-03-04 02:28:35,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:35,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:35,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:35,837 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:28:35,839 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:28:35,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:28:35,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:35,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:35,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:35,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:28:35,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:35,928 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:28:35,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:35,971 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:28:35,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425986649] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:35,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:28:35,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-03-04 02:28:35,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269432375] [2025-03-04 02:28:35,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:35,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:28:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:35,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:28:35,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:28:35,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:35,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 20 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 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:28:35,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:35,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:35,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:36,061 INFO L124 PetriNetUnfolderBase]: 76/138 cut-off events. [2025-03-04 02:28:36,062 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-04 02:28:36,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 138 events. 76/138 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 22 based on Foata normal form. 5/142 useless extension candidates. Maximal degree in co-relation 317. Up to 71 conditions per place. [2025-03-04 02:28:36,064 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 28 selfloop transitions, 4 changer transitions 1/34 dead transitions. [2025-03-04 02:28:36,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 168 flow [2025-03-04 02:28:36,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:28:36,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:28:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-03-04 02:28:36,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-04 02:28:36,066 INFO L175 Difference]: Start difference. First operand has 22 places, 20 transitions, 66 flow. Second operand 4 states and 45 transitions. [2025-03-04 02:28:36,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 168 flow [2025-03-04 02:28:36,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 34 transitions, 164 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:28:36,068 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 88 flow [2025-03-04 02:28:36,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-03-04 02:28:36,068 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2025-03-04 02:28:36,069 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 88 flow [2025-03-04 02:28:36,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 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:28:36,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:36,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:36,075 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:28:36,269 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:28:36,270 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:28:36,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:36,270 INFO L85 PathProgramCache]: Analyzing trace with hash 536772906, now seen corresponding path program 2 times [2025-03-04 02:28:36,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:36,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630825031] [2025-03-04 02:28:36,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:36,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:36,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:36,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:36,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:36,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:36,557 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:28:36,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:36,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630825031] [2025-03-04 02:28:36,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630825031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:36,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785850585] [2025-03-04 02:28:36,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:36,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:36,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:36,561 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:28:36,562 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:28:36,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:36,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:36,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:36,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:36,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:28:36,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:36,897 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:28:36,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:28:36,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785850585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:36,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:28:36,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 02:28:36,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253746493] [2025-03-04 02:28:36,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:36,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:28:36,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:36,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:28:36,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:36,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:36,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 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:28:36,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:36,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:36,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:37,019 INFO L124 PetriNetUnfolderBase]: 93/179 cut-off events. [2025-03-04 02:28:37,019 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2025-03-04 02:28:37,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 179 events. 93/179 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 592 event pairs, 24 based on Foata normal form. 11/189 useless extension candidates. Maximal degree in co-relation 476. Up to 95 conditions per place. [2025-03-04 02:28:37,020 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 31 selfloop transitions, 7 changer transitions 10/49 dead transitions. [2025-03-04 02:28:37,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 49 transitions, 279 flow [2025-03-04 02:28:37,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:28:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:28:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2025-03-04 02:28:37,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-03-04 02:28:37,021 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 88 flow. Second operand 6 states and 63 transitions. [2025-03-04 02:28:37,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 49 transitions, 279 flow [2025-03-04 02:28:37,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 49 transitions, 272 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:28:37,023 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 150 flow [2025-03-04 02:28:37,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2025-03-04 02:28:37,024 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2025-03-04 02:28:37,024 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 150 flow [2025-03-04 02:28:37,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 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:28:37,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:37,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:37,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:37,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 02:28:37,225 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:28:37,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:37,226 INFO L85 PathProgramCache]: Analyzing trace with hash -481253712, now seen corresponding path program 3 times [2025-03-04 02:28:37,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:37,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032335510] [2025-03-04 02:28:37,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:37,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:37,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:37,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:37,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:37,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:37,435 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:28:37,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:37,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032335510] [2025-03-04 02:28:37,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032335510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:37,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986344095] [2025-03-04 02:28:37,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:37,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:37,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:37,438 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:28:37,439 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:28:37,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:37,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:37,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:37,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:37,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:28:37,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:37,526 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:28:37,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:37,585 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:28:37,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986344095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:37,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:37,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-04 02:28:37,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498801715] [2025-03-04 02:28:37,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:37,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:28:37,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:37,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:28:37,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:28:37,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:37,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 150 flow. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:28:37,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:37,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:37,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:37,741 INFO L124 PetriNetUnfolderBase]: 100/195 cut-off events. [2025-03-04 02:28:37,742 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2025-03-04 02:28:37,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 195 events. 100/195 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 608 event pairs, 33 based on Foata normal form. 5/199 useless extension candidates. Maximal degree in co-relation 690. Up to 119 conditions per place. [2025-03-04 02:28:37,744 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 30 selfloop transitions, 14 changer transitions 3/48 dead transitions. [2025-03-04 02:28:37,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 351 flow [2025-03-04 02:28:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:28:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:28:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2025-03-04 02:28:37,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-04 02:28:37,746 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 150 flow. Second operand 6 states and 56 transitions. [2025-03-04 02:28:37,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 351 flow [2025-03-04 02:28:37,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 331 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-04 02:28:37,748 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 231 flow [2025-03-04 02:28:37,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2025-03-04 02:28:37,749 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 18 predicate places. [2025-03-04 02:28:37,749 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 231 flow [2025-03-04 02:28:37,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:28:37,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:37,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:37,757 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:28:37,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:37,955 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:28:37,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash -119244809, now seen corresponding path program 1 times [2025-03-04 02:28:37,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:37,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597747459] [2025-03-04 02:28:37,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:37,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:37,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:28:37,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:37,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:37,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:38,020 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:28:38,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:38,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597747459] [2025-03-04 02:28:38,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597747459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:38,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:38,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:28:38,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434283304] [2025-03-04 02:28:38,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:38,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:28:38,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:38,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:28:38,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:28:38,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:38,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 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:28:38,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:38,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:38,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:38,093 INFO L124 PetriNetUnfolderBase]: 106/205 cut-off events. [2025-03-04 02:28:38,093 INFO L125 PetriNetUnfolderBase]: For 470/470 co-relation queries the response was YES. [2025-03-04 02:28:38,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 205 events. 106/205 cut-off events. For 470/470 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 656 event pairs, 30 based on Foata normal form. 4/209 useless extension candidates. Maximal degree in co-relation 823. Up to 140 conditions per place. [2025-03-04 02:28:38,096 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 33 selfloop transitions, 8 changer transitions 3/45 dead transitions. [2025-03-04 02:28:38,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 376 flow [2025-03-04 02:28:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:28:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:28:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-03-04 02:28:38,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-04 02:28:38,098 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 231 flow. Second operand 4 states and 44 transitions. [2025-03-04 02:28:38,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 376 flow [2025-03-04 02:28:38,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 361 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 02:28:38,103 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 258 flow [2025-03-04 02:28:38,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-03-04 02:28:38,104 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2025-03-04 02:28:38,104 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 258 flow [2025-03-04 02:28:38,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 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:28:38,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:38,104 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:38,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:28:38,105 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:28:38,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1670522795, now seen corresponding path program 2 times [2025-03-04 02:28:38,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:38,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409030372] [2025-03-04 02:28:38,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:38,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:38,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:38,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:38,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:38,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:38,185 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:28:38,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:38,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409030372] [2025-03-04 02:28:38,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409030372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:38,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963665355] [2025-03-04 02:28:38,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:38,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:38,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:38,189 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:28:38,191 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:28:38,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:38,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:38,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:38,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:38,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:28:38,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:38,267 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:28:38,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:38,307 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:28:38,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963665355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:38,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:38,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 02:28:38,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914182676] [2025-03-04 02:28:38,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:38,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:28:38,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:38,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:28:38,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:28:38,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:38,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 258 flow. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:28:38,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:38,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:38,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:38,393 INFO L124 PetriNetUnfolderBase]: 107/201 cut-off events. [2025-03-04 02:28:38,394 INFO L125 PetriNetUnfolderBase]: For 584/584 co-relation queries the response was YES. [2025-03-04 02:28:38,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 201 events. 107/201 cut-off events. For 584/584 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 632 event pairs, 31 based on Foata normal form. 4/204 useless extension candidates. Maximal degree in co-relation 844. Up to 136 conditions per place. [2025-03-04 02:28:38,395 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 30 selfloop transitions, 13 changer transitions 3/47 dead transitions. [2025-03-04 02:28:38,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 411 flow [2025-03-04 02:28:38,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:28:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:28:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2025-03-04 02:28:38,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49 [2025-03-04 02:28:38,397 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 258 flow. Second operand 5 states and 49 transitions. [2025-03-04 02:28:38,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 411 flow [2025-03-04 02:28:38,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 399 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 02:28:38,402 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 295 flow [2025-03-04 02:28:38,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=295, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-03-04 02:28:38,402 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2025-03-04 02:28:38,403 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 295 flow [2025-03-04 02:28:38,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:28:38,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:38,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:38,409 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:28:38,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:38,607 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:28:38,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:38,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2139034426, now seen corresponding path program 4 times [2025-03-04 02:28:38,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:38,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143173006] [2025-03-04 02:28:38,608 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:38,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:38,612 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:38,617 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:38,617 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:38,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:38,676 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:28:38,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:38,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143173006] [2025-03-04 02:28:38,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143173006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:38,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:38,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:28:38,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149434960] [2025-03-04 02:28:38,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:38,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:28:38,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:38,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:28:38,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:28:38,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:38,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 295 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 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:28:38,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:38,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:38,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:38,768 INFO L124 PetriNetUnfolderBase]: 95/169 cut-off events. [2025-03-04 02:28:38,768 INFO L125 PetriNetUnfolderBase]: For 651/651 co-relation queries the response was YES. [2025-03-04 02:28:38,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 169 events. 95/169 cut-off events. For 651/651 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 476 event pairs, 18 based on Foata normal form. 2/170 useless extension candidates. Maximal degree in co-relation 780. Up to 89 conditions per place. [2025-03-04 02:28:38,770 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 34 selfloop transitions, 15 changer transitions 3/53 dead transitions. [2025-03-04 02:28:38,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 498 flow [2025-03-04 02:28:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:28:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:28:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2025-03-04 02:28:38,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2025-03-04 02:28:38,771 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 295 flow. Second operand 6 states and 52 transitions. [2025-03-04 02:28:38,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 498 flow [2025-03-04 02:28:38,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 464 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:38,773 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 345 flow [2025-03-04 02:28:38,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2025-03-04 02:28:38,773 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 27 predicate places. [2025-03-04 02:28:38,774 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 345 flow [2025-03-04 02:28:38,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 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:28:38,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:38,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:38,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:28:38,774 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:28:38,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:38,774 INFO L85 PathProgramCache]: Analyzing trace with hash 65253917, now seen corresponding path program 1 times [2025-03-04 02:28:38,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:38,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818751413] [2025-03-04 02:28:38,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:38,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:38,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:38,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:38,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:38,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:28:39,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:39,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818751413] [2025-03-04 02:28:39,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818751413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:39,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139853684] [2025-03-04 02:28:39,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:39,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:39,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:39,073 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:28:39,075 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:28:39,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:39,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:39,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:39,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:39,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 02:28:39,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:39,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:28:39,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:28:39,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2025-03-04 02:28:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:39,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:39,534 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 132 treesize of output 116 [2025-03-04 02:28:39,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:28:39,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 563 treesize of output 515 [2025-03-04 02:28:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:54,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139853684] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:54,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:54,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2025-03-04 02:28:54,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089916833] [2025-03-04 02:28:54,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:54,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:28:54,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:54,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:28:54,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:28:54,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:54,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 345 flow. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:28:54,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:54,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:54,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:56,214 INFO L124 PetriNetUnfolderBase]: 227/396 cut-off events. [2025-03-04 02:28:56,214 INFO L125 PetriNetUnfolderBase]: For 1300/1300 co-relation queries the response was YES. [2025-03-04 02:28:56,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1960 conditions, 396 events. 227/396 cut-off events. For 1300/1300 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1449 event pairs, 7 based on Foata normal form. 33/427 useless extension candidates. Maximal degree in co-relation 1907. Up to 185 conditions per place. [2025-03-04 02:28:56,217 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 44 selfloop transitions, 21 changer transitions 66/132 dead transitions. [2025-03-04 02:28:56,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 132 transitions, 1259 flow [2025-03-04 02:28:56,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 02:28:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 02:28:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 170 transitions. [2025-03-04 02:28:56,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-03-04 02:28:56,219 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 345 flow. Second operand 21 states and 170 transitions. [2025-03-04 02:28:56,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 132 transitions, 1259 flow [2025-03-04 02:28:56,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 132 transitions, 1231 flow, removed 14 selfloop flow, removed 1 redundant places. [2025-03-04 02:28:56,225 INFO L231 Difference]: Finished difference. Result has 76 places, 47 transitions, 490 flow [2025-03-04 02:28:56,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=490, PETRI_PLACES=76, PETRI_TRANSITIONS=47} [2025-03-04 02:28:56,226 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 55 predicate places. [2025-03-04 02:28:56,226 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 47 transitions, 490 flow [2025-03-04 02:28:56,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:28:56,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:56,226 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:56,232 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:28:56,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:56,427 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:28:56,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1659446622, now seen corresponding path program 2 times [2025-03-04 02:28:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:56,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286972219] [2025-03-04 02:28:56,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:56,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:56,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:56,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:56,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:56,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:28:56,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:56,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286972219] [2025-03-04 02:28:56,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286972219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:56,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118920575] [2025-03-04 02:28:56,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:56,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:56,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:56,602 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:28:56,616 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:28:56,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:56,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:56,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:56,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:56,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:28:56,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:28:56,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:28:56,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118920575] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:56,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:56,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 02:28:56,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58025449] [2025-03-04 02:28:56,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:56,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:28:56,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:56,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:28:56,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:28:56,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:56,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 47 transitions, 490 flow. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:28:56,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:56,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:56,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:57,363 INFO L124 PetriNetUnfolderBase]: 220/386 cut-off events. [2025-03-04 02:28:57,363 INFO L125 PetriNetUnfolderBase]: For 2892/2892 co-relation queries the response was YES. [2025-03-04 02:28:57,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2249 conditions, 386 events. 220/386 cut-off events. For 2892/2892 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1352 event pairs, 13 based on Foata normal form. 42/428 useless extension candidates. Maximal degree in co-relation 2214. Up to 175 conditions per place. [2025-03-04 02:28:57,368 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 91 selfloop transitions, 26 changer transitions 0/118 dead transitions. [2025-03-04 02:28:57,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 118 transitions, 1349 flow [2025-03-04 02:28:57,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:28:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:28:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2025-03-04 02:28:57,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-03-04 02:28:57,370 INFO L175 Difference]: Start difference. First operand has 76 places, 47 transitions, 490 flow. Second operand 11 states and 108 transitions. [2025-03-04 02:28:57,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 118 transitions, 1349 flow [2025-03-04 02:28:57,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 118 transitions, 1177 flow, removed 69 selfloop flow, removed 12 redundant places. [2025-03-04 02:28:57,379 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 602 flow [2025-03-04 02:28:57,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=602, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2025-03-04 02:28:57,379 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 48 predicate places. [2025-03-04 02:28:57,380 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 602 flow [2025-03-04 02:28:57,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:28:57,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:57,380 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:57,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:28:57,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:57,585 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:28:57,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:57,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1795670154, now seen corresponding path program 3 times [2025-03-04 02:28:57,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:57,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042684388] [2025-03-04 02:28:57,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:57,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:57,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:28:57,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:28:57,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:57,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:58,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:58,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042684388] [2025-03-04 02:28:58,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042684388] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:58,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283211530] [2025-03-04 02:28:58,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:58,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:58,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:58,548 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:28:58,548 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:28:58,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:28:58,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:28:58,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:58,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:58,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:28:58,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:58,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:28:58,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2025-03-04 02:28:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:28:58,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:58,888 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2025-03-04 02:28:58,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2025-03-04 02:28:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:28:59,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283211530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:59,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:59,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 5] total 18 [2025-03-04 02:28:59,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381593836] [2025-03-04 02:28:59,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:59,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:28:59,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:59,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:28:59,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:28:59,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:59,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 602 flow. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:28:59,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:59,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:59,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:59,707 INFO L124 PetriNetUnfolderBase]: 571/1011 cut-off events. [2025-03-04 02:28:59,708 INFO L125 PetriNetUnfolderBase]: For 5610/5610 co-relation queries the response was YES. [2025-03-04 02:28:59,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5761 conditions, 1011 events. 571/1011 cut-off events. For 5610/5610 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4341 event pairs, 49 based on Foata normal form. 4/1015 useless extension candidates. Maximal degree in co-relation 5317. Up to 451 conditions per place. [2025-03-04 02:28:59,714 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 112 selfloop transitions, 79 changer transitions 2/194 dead transitions. [2025-03-04 02:28:59,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 194 transitions, 2264 flow [2025-03-04 02:28:59,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:28:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 02:28:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 176 transitions. [2025-03-04 02:28:59,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44 [2025-03-04 02:28:59,715 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 602 flow. Second operand 20 states and 176 transitions. [2025-03-04 02:28:59,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 194 transitions, 2264 flow [2025-03-04 02:28:59,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 194 transitions, 2042 flow, removed 85 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:59,725 INFO L231 Difference]: Finished difference. Result has 88 places, 123 transitions, 1402 flow [2025-03-04 02:28:59,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1402, PETRI_PLACES=88, PETRI_TRANSITIONS=123} [2025-03-04 02:28:59,725 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 67 predicate places. [2025-03-04 02:28:59,725 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 123 transitions, 1402 flow [2025-03-04 02:28:59,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:28:59,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:59,726 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:59,732 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:28:59,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:59,926 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:28:59,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:59,927 INFO L85 PathProgramCache]: Analyzing trace with hash 342350710, now seen corresponding path program 4 times [2025-03-04 02:28:59,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:59,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468853970] [2025-03-04 02:28:59,927 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:59,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:59,932 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:28:59,944 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:28:59,944 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:59,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:00,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:00,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468853970] [2025-03-04 02:29:00,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468853970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:00,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609967530] [2025-03-04 02:29:00,803 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:29:00,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:00,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:00,805 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:29:00,806 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:29:00,843 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:29:00,858 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:29:00,858 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:29:00,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:00,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:29:00,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:00,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:29:00,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 45 [2025-03-04 02:29:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:00,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:01,097 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2025-03-04 02:29:01,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2025-03-04 02:29:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:01,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609967530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:01,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:01,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 5] total 17 [2025-03-04 02:29:01,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735529258] [2025-03-04 02:29:01,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:01,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 02:29:01,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:01,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 02:29:01,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:29:01,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:01,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 123 transitions, 1402 flow. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 0 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:29:01,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:01,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:01,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:01,893 INFO L124 PetriNetUnfolderBase]: 1017/1805 cut-off events. [2025-03-04 02:29:01,893 INFO L125 PetriNetUnfolderBase]: For 10520/10520 co-relation queries the response was YES. [2025-03-04 02:29:01,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10396 conditions, 1805 events. 1017/1805 cut-off events. For 10520/10520 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9311 event pairs, 106 based on Foata normal form. 4/1809 useless extension candidates. Maximal degree in co-relation 9444. Up to 856 conditions per place. [2025-03-04 02:29:01,906 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 174 selfloop transitions, 128 changer transitions 2/305 dead transitions. [2025-03-04 02:29:01,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 305 transitions, 3689 flow [2025-03-04 02:29:01,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 02:29:01,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 02:29:01,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 203 transitions. [2025-03-04 02:29:01,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-04 02:29:01,907 INFO L175 Difference]: Start difference. First operand has 88 places, 123 transitions, 1402 flow. Second operand 21 states and 203 transitions. [2025-03-04 02:29:01,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 305 transitions, 3689 flow [2025-03-04 02:29:01,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 305 transitions, 3410 flow, removed 136 selfloop flow, removed 3 redundant places. [2025-03-04 02:29:01,930 INFO L231 Difference]: Finished difference. Result has 113 places, 207 transitions, 2545 flow [2025-03-04 02:29:01,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2545, PETRI_PLACES=113, PETRI_TRANSITIONS=207} [2025-03-04 02:29:01,932 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 92 predicate places. [2025-03-04 02:29:01,932 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 207 transitions, 2545 flow [2025-03-04 02:29:01,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 0 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:29:01,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:01,932 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:01,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 02:29:02,132 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,SelfDestructingSolverStorable11 [2025-03-04 02:29:02,133 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:29:02,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:02,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1875401008, now seen corresponding path program 5 times [2025-03-04 02:29:02,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:02,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717543048] [2025-03-04 02:29:02,133 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:29:02,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:02,138 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:29:02,157 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:29:02,157 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:02,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:03,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:03,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717543048] [2025-03-04 02:29:03,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717543048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:03,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811136416] [2025-03-04 02:29:03,030 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:29:03,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:03,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:03,032 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:29:03,033 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:29:03,070 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:29:03,180 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:29:03,180 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:03,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:03,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 02:29:03,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:03,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:29:03,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2025-03-04 02:29:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:03,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:03,485 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2025-03-04 02:29:03,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2025-03-04 02:29:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:03,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811136416] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:03,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:03,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 18 [2025-03-04 02:29:03,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269157150] [2025-03-04 02:29:03,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:03,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:29:03,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:03,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:29:03,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:29:03,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:03,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 207 transitions, 2545 flow. Second operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:29:03,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:03,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:03,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:04,516 INFO L124 PetriNetUnfolderBase]: 1443/2565 cut-off events. [2025-03-04 02:29:04,516 INFO L125 PetriNetUnfolderBase]: For 17585/17585 co-relation queries the response was YES. [2025-03-04 02:29:04,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15606 conditions, 2565 events. 1443/2565 cut-off events. For 17585/17585 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 14620 event pairs, 181 based on Foata normal form. 4/2569 useless extension candidates. Maximal degree in co-relation 15552. Up to 1412 conditions per place. [2025-03-04 02:29:04,536 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 206 selfloop transitions, 147 changer transitions 2/356 dead transitions. [2025-03-04 02:29:04,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 356 transitions, 4791 flow [2025-03-04 02:29:04,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 02:29:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 02:29:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 201 transitions. [2025-03-04 02:29:04,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4369565217391304 [2025-03-04 02:29:04,538 INFO L175 Difference]: Start difference. First operand has 113 places, 207 transitions, 2545 flow. Second operand 23 states and 201 transitions. [2025-03-04 02:29:04,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 356 transitions, 4791 flow [2025-03-04 02:29:04,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 356 transitions, 4398 flow, removed 172 selfloop flow, removed 9 redundant places. [2025-03-04 02:29:04,579 INFO L231 Difference]: Finished difference. Result has 132 places, 269 transitions, 3540 flow [2025-03-04 02:29:04,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2274, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3540, PETRI_PLACES=132, PETRI_TRANSITIONS=269} [2025-03-04 02:29:04,581 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 111 predicate places. [2025-03-04 02:29:04,581 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 269 transitions, 3540 flow [2025-03-04 02:29:04,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:29:04,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:04,582 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:04,589 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:29:04,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 02:29:04,783 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:29:04,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:04,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1448578288, now seen corresponding path program 6 times [2025-03-04 02:29:04,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:04,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30631015] [2025-03-04 02:29:04,784 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:29:04,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:04,792 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-03-04 02:29:04,808 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:29:04,808 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:29:04,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:05,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:05,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:05,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30631015] [2025-03-04 02:29:05,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30631015] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:05,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534455253] [2025-03-04 02:29:05,407 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:29:05,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:05,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:05,409 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:29:05,410 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:29:05,443 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-03-04 02:29:05,457 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:29:05,457 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:29:05,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:05,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:29:05,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:05,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:29:05,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2025-03-04 02:29:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:05,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:05,730 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2025-03-04 02:29:05,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2025-03-04 02:29:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:05,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534455253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:05,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:05,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 5] total 18 [2025-03-04 02:29:05,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127097409] [2025-03-04 02:29:05,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:05,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:29:05,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:05,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:29:05,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:29:05,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:05,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 269 transitions, 3540 flow. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:29:05,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:05,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:05,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:06,643 INFO L124 PetriNetUnfolderBase]: 1913/3402 cut-off events. [2025-03-04 02:29:06,643 INFO L125 PetriNetUnfolderBase]: For 23496/23496 co-relation queries the response was YES. [2025-03-04 02:29:06,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20838 conditions, 3402 events. 1913/3402 cut-off events. For 23496/23496 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 20547 event pairs, 325 based on Foata normal form. 5/3407 useless extension candidates. Maximal degree in co-relation 20777. Up to 2361 conditions per place. [2025-03-04 02:29:06,672 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 296 selfloop transitions, 112 changer transitions 2/411 dead transitions. [2025-03-04 02:29:06,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 411 transitions, 5848 flow [2025-03-04 02:29:06,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:29:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 02:29:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 170 transitions. [2025-03-04 02:29:06,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-03-04 02:29:06,673 INFO L175 Difference]: Start difference. First operand has 132 places, 269 transitions, 3540 flow. Second operand 20 states and 170 transitions. [2025-03-04 02:29:06,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 411 transitions, 5848 flow [2025-03-04 02:29:06,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 411 transitions, 5552 flow, removed 106 selfloop flow, removed 10 redundant places. [2025-03-04 02:29:06,740 INFO L231 Difference]: Finished difference. Result has 149 places, 345 transitions, 4679 flow [2025-03-04 02:29:06,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=3262, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4679, PETRI_PLACES=149, PETRI_TRANSITIONS=345} [2025-03-04 02:29:06,742 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 128 predicate places. [2025-03-04 02:29:06,742 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 345 transitions, 4679 flow [2025-03-04 02:29:06,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:29:06,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:06,742 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:06,749 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:29:06,943 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,SelfDestructingSolverStorable13 [2025-03-04 02:29:06,943 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:29:06,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:06,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2077333603, now seen corresponding path program 7 times [2025-03-04 02:29:06,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:06,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817143321] [2025-03-04 02:29:06,943 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:29:06,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:06,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:29:06,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:06,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:06,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:07,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:07,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817143321] [2025-03-04 02:29:07,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817143321] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:07,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484680464] [2025-03-04 02:29:07,073 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:29:07,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:07,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:07,075 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:29:07,077 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:29:07,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:29:07,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:07,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:07,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:07,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:29:07,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:07,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:07,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484680464] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:07,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:07,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-04 02:29:07,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715936584] [2025-03-04 02:29:07,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:07,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:29:07,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:07,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:29:07,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:29:07,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:07,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 345 transitions, 4679 flow. Second operand has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:29:07,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:07,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:07,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:08,553 INFO L124 PetriNetUnfolderBase]: 2191/4238 cut-off events. [2025-03-04 02:29:08,554 INFO L125 PetriNetUnfolderBase]: For 35106/35106 co-relation queries the response was YES. [2025-03-04 02:29:08,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26411 conditions, 4238 events. 2191/4238 cut-off events. For 35106/35106 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 30082 event pairs, 271 based on Foata normal form. 19/4257 useless extension candidates. Maximal degree in co-relation 26341. Up to 1331 conditions per place. [2025-03-04 02:29:08,580 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 428 selfloop transitions, 372 changer transitions 7/808 dead transitions. [2025-03-04 02:29:08,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 808 transitions, 12138 flow [2025-03-04 02:29:08,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 02:29:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-04 02:29:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 256 transitions. [2025-03-04 02:29:08,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-04 02:29:08,582 INFO L175 Difference]: Start difference. First operand has 149 places, 345 transitions, 4679 flow. Second operand 32 states and 256 transitions. [2025-03-04 02:29:08,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 808 transitions, 12138 flow [2025-03-04 02:29:08,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 808 transitions, 11363 flow, removed 371 selfloop flow, removed 7 redundant places. [2025-03-04 02:29:08,693 INFO L231 Difference]: Finished difference. Result has 185 places, 616 transitions, 9067 flow [2025-03-04 02:29:08,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=4341, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=9067, PETRI_PLACES=185, PETRI_TRANSITIONS=616} [2025-03-04 02:29:08,694 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 164 predicate places. [2025-03-04 02:29:08,694 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 616 transitions, 9067 flow [2025-03-04 02:29:08,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:29:08,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:08,694 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:08,700 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:29:08,899 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,SelfDestructingSolverStorable14 [2025-03-04 02:29:08,899 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:29:08,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:08,900 INFO L85 PathProgramCache]: Analyzing trace with hash -683720201, now seen corresponding path program 8 times [2025-03-04 02:29:08,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:08,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913915609] [2025-03-04 02:29:08,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:08,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:08,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:29:08,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:08,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:08,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:08,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:08,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913915609] [2025-03-04 02:29:08,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913915609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:08,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848086701] [2025-03-04 02:29:08,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:08,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:08,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:08,998 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:29:09,000 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:29:09,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:29:09,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:09,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:09,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:09,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:29:09,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:09,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:09,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848086701] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:09,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:09,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-04 02:29:09,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130234258] [2025-03-04 02:29:09,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:09,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:29:09,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:09,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:29:09,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:29:09,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:09,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 616 transitions, 9067 flow. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 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:29:09,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:09,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:09,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:10,194 INFO L124 PetriNetUnfolderBase]: 2167/4308 cut-off events. [2025-03-04 02:29:10,194 INFO L125 PetriNetUnfolderBase]: For 44226/44226 co-relation queries the response was YES. [2025-03-04 02:29:10,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28767 conditions, 4308 events. 2167/4308 cut-off events. For 44226/44226 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 31466 event pairs, 244 based on Foata normal form. 51/4359 useless extension candidates. Maximal degree in co-relation 28687. Up to 1349 conditions per place. [2025-03-04 02:29:10,220 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 520 selfloop transitions, 258 changer transitions 19/798 dead transitions. [2025-03-04 02:29:10,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 798 transitions, 12946 flow [2025-03-04 02:29:10,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:29:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:29:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 130 transitions. [2025-03-04 02:29:10,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40625 [2025-03-04 02:29:10,221 INFO L175 Difference]: Start difference. First operand has 185 places, 616 transitions, 9067 flow. Second operand 16 states and 130 transitions. [2025-03-04 02:29:10,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 798 transitions, 12946 flow [2025-03-04 02:29:10,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 798 transitions, 12166 flow, removed 264 selfloop flow, removed 5 redundant places. [2025-03-04 02:29:10,399 INFO L231 Difference]: Finished difference. Result has 197 places, 637 transitions, 9277 flow [2025-03-04 02:29:10,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=8295, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=9277, PETRI_PLACES=197, PETRI_TRANSITIONS=637} [2025-03-04 02:29:10,400 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 176 predicate places. [2025-03-04 02:29:10,400 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 637 transitions, 9277 flow [2025-03-04 02:29:10,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 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:29:10,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:10,400 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:10,406 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:29:10,600 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,SelfDestructingSolverStorable15 [2025-03-04 02:29:10,600 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:29:10,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:10,601 INFO L85 PathProgramCache]: Analyzing trace with hash -204557365, now seen corresponding path program 9 times [2025-03-04 02:29:10,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:10,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464920438] [2025-03-04 02:29:10,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:29:10,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:10,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-04 02:29:10,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:10,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:29:10,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:10,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:10,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464920438] [2025-03-04 02:29:10,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464920438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:10,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514391329] [2025-03-04 02:29:10,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:29:10,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:10,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:10,720 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:29:10,721 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:29:10,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-04 02:29:10,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:10,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:29:10,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:10,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:29:10,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:10,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:10,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:10,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514391329] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:10,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:10,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-04 02:29:10,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839279903] [2025-03-04 02:29:10,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:10,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:29:10,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:10,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:29:10,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:29:10,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:10,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 637 transitions, 9277 flow. Second operand has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 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:29:10,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:10,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:10,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:12,102 INFO L124 PetriNetUnfolderBase]: 2322/4538 cut-off events. [2025-03-04 02:29:12,102 INFO L125 PetriNetUnfolderBase]: For 52367/52367 co-relation queries the response was YES. [2025-03-04 02:29:12,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31940 conditions, 4538 events. 2322/4538 cut-off events. For 52367/52367 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 32741 event pairs, 641 based on Foata normal form. 28/4566 useless extension candidates. Maximal degree in co-relation 31857. Up to 2541 conditions per place. [2025-03-04 02:29:12,134 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 473 selfloop transitions, 363 changer transitions 3/840 dead transitions. [2025-03-04 02:29:12,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 840 transitions, 13917 flow [2025-03-04 02:29:12,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 02:29:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-04 02:29:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 220 transitions. [2025-03-04 02:29:12,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-04 02:29:12,135 INFO L175 Difference]: Start difference. First operand has 197 places, 637 transitions, 9277 flow. Second operand 28 states and 220 transitions. [2025-03-04 02:29:12,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 840 transitions, 13917 flow [2025-03-04 02:29:12,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 840 transitions, 12151 flow, removed 387 selfloop flow, removed 16 redundant places. [2025-03-04 02:29:12,428 INFO L231 Difference]: Finished difference. Result has 224 places, 733 transitions, 10324 flow [2025-03-04 02:29:12,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=7856, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=268, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=10324, PETRI_PLACES=224, PETRI_TRANSITIONS=733} [2025-03-04 02:29:12,429 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 203 predicate places. [2025-03-04 02:29:12,429 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 733 transitions, 10324 flow [2025-03-04 02:29:12,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 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:29:12,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:12,429 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:12,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 02:29:12,629 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,SelfDestructingSolverStorable16 [2025-03-04 02:29:12,629 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:29:12,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:12,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1911443753, now seen corresponding path program 10 times [2025-03-04 02:29:12,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:12,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733131726] [2025-03-04 02:29:12,630 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:29:12,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:12,637 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:29:12,646 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:12,646 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:29:12,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:12,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:12,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733131726] [2025-03-04 02:29:12,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733131726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:12,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790486062] [2025-03-04 02:29:12,824 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:29:12,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:12,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:12,828 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:29:12,830 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:29:12,877 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:29:12,899 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:12,899 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:29:12,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:12,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:29:12,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:12,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:13,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790486062] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:13,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:13,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-04 02:29:13,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286554222] [2025-03-04 02:29:13,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:13,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 02:29:13,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:13,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 02:29:13,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:29:13,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:13,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 733 transitions, 10324 flow. Second operand has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 21 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:29:13,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:13,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:13,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:14,926 INFO L124 PetriNetUnfolderBase]: 2535/4954 cut-off events. [2025-03-04 02:29:14,926 INFO L125 PetriNetUnfolderBase]: For 44231/44231 co-relation queries the response was YES. [2025-03-04 02:29:14,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32810 conditions, 4954 events. 2535/4954 cut-off events. For 44231/44231 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 36550 event pairs, 901 based on Foata normal form. 38/4992 useless extension candidates. Maximal degree in co-relation 32717. Up to 3861 conditions per place. [2025-03-04 02:29:14,961 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 660 selfloop transitions, 277 changer transitions 3/941 dead transitions. [2025-03-04 02:29:14,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 941 transitions, 15118 flow [2025-03-04 02:29:14,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 02:29:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-04 02:29:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 284 transitions. [2025-03-04 02:29:14,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3736842105263158 [2025-03-04 02:29:14,963 INFO L175 Difference]: Start difference. First operand has 224 places, 733 transitions, 10324 flow. Second operand 38 states and 284 transitions. [2025-03-04 02:29:14,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 941 transitions, 15118 flow [2025-03-04 02:29:15,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 941 transitions, 14584 flow, removed 239 selfloop flow, removed 3 redundant places. [2025-03-04 02:29:15,228 INFO L231 Difference]: Finished difference. Result has 277 places, 831 transitions, 12213 flow [2025-03-04 02:29:15,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=9884, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=12213, PETRI_PLACES=277, PETRI_TRANSITIONS=831} [2025-03-04 02:29:15,228 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 256 predicate places. [2025-03-04 02:29:15,228 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 831 transitions, 12213 flow [2025-03-04 02:29:15,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 21 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:29:15,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:15,229 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:15,234 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:29:15,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:15,430 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:29:15,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:15,430 INFO L85 PathProgramCache]: Analyzing trace with hash 88120585, now seen corresponding path program 11 times [2025-03-04 02:29:15,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:15,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145857390] [2025-03-04 02:29:15,430 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:29:15,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:15,435 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:29:15,441 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:15,441 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:15,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:15,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145857390] [2025-03-04 02:29:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145857390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388936687] [2025-03-04 02:29:15,529 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:29:15,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:15,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:15,531 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:29:15,533 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:29:15,570 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:29:15,626 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:15,626 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:15,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:15,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:29:15,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:15,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:15,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:15,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388936687] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:15,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:15,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-04 02:29:15,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898545280] [2025-03-04 02:29:15,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:15,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:29:15,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:15,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:29:15,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:29:15,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:15,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 831 transitions, 12213 flow. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 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:29:15,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:15,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:15,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:17,280 INFO L124 PetriNetUnfolderBase]: 2678/5220 cut-off events. [2025-03-04 02:29:17,280 INFO L125 PetriNetUnfolderBase]: For 64416/64416 co-relation queries the response was YES. [2025-03-04 02:29:17,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37275 conditions, 5220 events. 2678/5220 cut-off events. For 64416/64416 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 39068 event pairs, 382 based on Foata normal form. 13/5233 useless extension candidates. Maximal degree in co-relation 37162. Up to 1845 conditions per place. [2025-03-04 02:29:17,319 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 566 selfloop transitions, 492 changer transitions 14/1073 dead transitions. [2025-03-04 02:29:17,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 1073 transitions, 17354 flow [2025-03-04 02:29:17,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 02:29:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-04 02:29:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 260 transitions. [2025-03-04 02:29:17,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2025-03-04 02:29:17,321 INFO L175 Difference]: Start difference. First operand has 277 places, 831 transitions, 12213 flow. Second operand 36 states and 260 transitions. [2025-03-04 02:29:17,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 1073 transitions, 17354 flow [2025-03-04 02:29:17,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 1073 transitions, 16745 flow, removed 239 selfloop flow, removed 6 redundant places. [2025-03-04 02:29:17,723 INFO L231 Difference]: Finished difference. Result has 318 places, 915 transitions, 14344 flow [2025-03-04 02:29:17,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=11629, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=829, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=411, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=14344, PETRI_PLACES=318, PETRI_TRANSITIONS=915} [2025-03-04 02:29:17,724 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 297 predicate places. [2025-03-04 02:29:17,724 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 915 transitions, 14344 flow [2025-03-04 02:29:17,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 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:29:17,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:17,724 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:17,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 02:29:17,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:17,925 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:29:17,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:17,925 INFO L85 PathProgramCache]: Analyzing trace with hash 371226747, now seen corresponding path program 12 times [2025-03-04 02:29:17,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:17,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212913821] [2025-03-04 02:29:17,925 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:29:17,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:17,929 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:29:17,936 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:17,936 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:29:17,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:18,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212913821] [2025-03-04 02:29:18,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212913821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:18,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117223404] [2025-03-04 02:29:18,010 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:29:18,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:18,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:18,012 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:29:18,014 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:29:18,053 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:29:18,068 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:18,068 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:29:18,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:18,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:29:18,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:18,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:18,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117223404] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:18,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:18,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 02:29:18,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801404262] [2025-03-04 02:29:18,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:18,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 02:29:18,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:18,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 02:29:18,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:29:18,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:18,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 915 transitions, 14344 flow. Second operand has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:18,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:18,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:18,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:20,154 INFO L124 PetriNetUnfolderBase]: 2729/5323 cut-off events. [2025-03-04 02:29:20,155 INFO L125 PetriNetUnfolderBase]: For 71675/71675 co-relation queries the response was YES. [2025-03-04 02:29:20,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40393 conditions, 5323 events. 2729/5323 cut-off events. For 71675/71675 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 39879 event pairs, 391 based on Foata normal form. 17/5340 useless extension candidates. Maximal degree in co-relation 40268. Up to 1906 conditions per place. [2025-03-04 02:29:20,206 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 608 selfloop transitions, 497 changer transitions 10/1116 dead transitions. [2025-03-04 02:29:20,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 1116 transitions, 19097 flow [2025-03-04 02:29:20,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-04 02:29:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-04 02:29:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 299 transitions. [2025-03-04 02:29:20,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35595238095238096 [2025-03-04 02:29:20,208 INFO L175 Difference]: Start difference. First operand has 318 places, 915 transitions, 14344 flow. Second operand 42 states and 299 transitions. [2025-03-04 02:29:20,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 1116 transitions, 19097 flow [2025-03-04 02:29:20,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 1116 transitions, 18413 flow, removed 250 selfloop flow, removed 11 redundant places. [2025-03-04 02:29:20,797 INFO L231 Difference]: Finished difference. Result has 357 places, 950 transitions, 15772 flow [2025-03-04 02:29:20,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=13552, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=449, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=15772, PETRI_PLACES=357, PETRI_TRANSITIONS=950} [2025-03-04 02:29:20,798 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 336 predicate places. [2025-03-04 02:29:20,798 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 950 transitions, 15772 flow [2025-03-04 02:29:20,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:20,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:20,798 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:20,804 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:29:20,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:20,999 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:29:20,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:20,999 INFO L85 PathProgramCache]: Analyzing trace with hash -577615429, now seen corresponding path program 13 times [2025-03-04 02:29:20,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:20,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937523216] [2025-03-04 02:29:20,999 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:29:20,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:21,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:29:21,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:21,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:21,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:21,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:21,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937523216] [2025-03-04 02:29:21,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937523216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:21,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318797195] [2025-03-04 02:29:21,119 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:29:21,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:21,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:21,122 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:29:21,124 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:29:21,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:29:21,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:21,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:21,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:21,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:29:21,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:21,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:21,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318797195] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:21,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:21,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-04 02:29:21,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360324950] [2025-03-04 02:29:21,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:21,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:29:21,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:21,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:29:21,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:29:21,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:21,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 950 transitions, 15772 flow. Second operand has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 states have internal predecessors, (90), 0 states have call successors, (0), 0 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:29:21,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:21,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:21,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:23,301 INFO L124 PetriNetUnfolderBase]: 2814/5470 cut-off events. [2025-03-04 02:29:23,301 INFO L125 PetriNetUnfolderBase]: For 88270/88270 co-relation queries the response was YES. [2025-03-04 02:29:23,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44436 conditions, 5470 events. 2814/5470 cut-off events. For 88270/88270 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 40964 event pairs, 953 based on Foata normal form. 12/5482 useless extension candidates. Maximal degree in co-relation 44302. Up to 4198 conditions per place. [2025-03-04 02:29:23,349 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 719 selfloop transitions, 364 changer transitions 0/1084 dead transitions. [2025-03-04 02:29:23,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 1084 transitions, 20191 flow [2025-03-04 02:29:23,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 02:29:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-04 02:29:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 243 transitions. [2025-03-04 02:29:23,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3796875 [2025-03-04 02:29:23,350 INFO L175 Difference]: Start difference. First operand has 357 places, 950 transitions, 15772 flow. Second operand 32 states and 243 transitions. [2025-03-04 02:29:23,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 1084 transitions, 20191 flow [2025-03-04 02:29:23,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 1084 transitions, 19219 flow, removed 254 selfloop flow, removed 19 redundant places. [2025-03-04 02:29:24,009 INFO L231 Difference]: Finished difference. Result has 372 places, 1004 transitions, 16928 flow [2025-03-04 02:29:24,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=14832, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=308, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=16928, PETRI_PLACES=372, PETRI_TRANSITIONS=1004} [2025-03-04 02:29:24,010 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 351 predicate places. [2025-03-04 02:29:24,010 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 1004 transitions, 16928 flow [2025-03-04 02:29:24,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 states have internal predecessors, (90), 0 states have call successors, (0), 0 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:29:24,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:24,010 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:24,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 02:29:24,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:24,211 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:29:24,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:24,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1485688123, now seen corresponding path program 14 times [2025-03-04 02:29:24,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:24,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818886211] [2025-03-04 02:29:24,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:24,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:24,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:29:24,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:24,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:24,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:24,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:24,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818886211] [2025-03-04 02:29:24,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818886211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:24,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445177706] [2025-03-04 02:29:24,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:24,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:24,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:24,342 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:29:24,343 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:29:24,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:29:24,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:24,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:24,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:24,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:29:24,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:24,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:24,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445177706] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:24,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:24,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-04 02:29:24,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754307731] [2025-03-04 02:29:24,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:24,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:29:24,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:24,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:29:24,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:29:24,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:24,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 1004 transitions, 16928 flow. Second operand has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 22 states have internal predecessors, (102), 0 states have call successors, (0), 0 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:29:24,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:24,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:24,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:31,070 INFO L124 PetriNetUnfolderBase]: 3127/6080 cut-off events. [2025-03-04 02:29:31,070 INFO L125 PetriNetUnfolderBase]: For 119460/119460 co-relation queries the response was YES. [2025-03-04 02:29:31,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50307 conditions, 6080 events. 3127/6080 cut-off events. For 119460/119460 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 46704 event pairs, 1126 based on Foata normal form. 50/6130 useless extension candidates. Maximal degree in co-relation 50165. Up to 4951 conditions per place. [2025-03-04 02:29:31,137 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 931 selfloop transitions, 313 changer transitions 6/1251 dead transitions. [2025-03-04 02:29:31,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 1251 transitions, 23893 flow [2025-03-04 02:29:31,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-04 02:29:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-03-04 02:29:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 296 transitions. [2025-03-04 02:29:31,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37948717948717947 [2025-03-04 02:29:31,138 INFO L175 Difference]: Start difference. First operand has 372 places, 1004 transitions, 16928 flow. Second operand 39 states and 296 transitions. [2025-03-04 02:29:31,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 1251 transitions, 23893 flow [2025-03-04 02:29:32,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 1251 transitions, 23482 flow, removed 144 selfloop flow, removed 13 redundant places. [2025-03-04 02:29:32,203 INFO L231 Difference]: Finished difference. Result has 417 places, 1145 transitions, 20589 flow [2025-03-04 02:29:32,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=16529, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1004, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=20589, PETRI_PLACES=417, PETRI_TRANSITIONS=1145} [2025-03-04 02:29:32,204 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 396 predicate places. [2025-03-04 02:29:32,204 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 1145 transitions, 20589 flow [2025-03-04 02:29:32,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 22 states have internal predecessors, (102), 0 states have call successors, (0), 0 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:29:32,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:32,204 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:32,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 02:29:32,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:32,405 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:29:32,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:32,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1517197435, now seen corresponding path program 15 times [2025-03-04 02:29:32,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:32,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192060790] [2025-03-04 02:29:32,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:29:32,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:32,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-04 02:29:32,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:32,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:29:32,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:32,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:32,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192060790] [2025-03-04 02:29:32,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192060790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:32,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328647876] [2025-03-04 02:29:32,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:29:32,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:32,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:32,594 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:29:32,595 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:29:32,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-04 02:29:32,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:32,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:29:32,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:32,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:29:32,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:32,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:32,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328647876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:32,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:32,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2025-03-04 02:29:32,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090231579] [2025-03-04 02:29:32,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:32,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:29:32,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:32,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:29:32,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:29:32,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:32,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 1145 transitions, 20589 flow. Second operand has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:29:32,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:32,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:32,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:36,030 INFO L124 PetriNetUnfolderBase]: 3275/6321 cut-off events. [2025-03-04 02:29:36,030 INFO L125 PetriNetUnfolderBase]: For 190122/190122 co-relation queries the response was YES. [2025-03-04 02:29:36,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57629 conditions, 6321 events. 3275/6321 cut-off events. For 190122/190122 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 48611 event pairs, 1100 based on Foata normal form. 46/6367 useless extension candidates. Maximal degree in co-relation 57466. Up to 4793 conditions per place. [2025-03-04 02:29:36,103 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 915 selfloop transitions, 389 changer transitions 0/1305 dead transitions. [2025-03-04 02:29:36,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 1305 transitions, 26249 flow [2025-03-04 02:29:36,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 02:29:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 02:29:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 193 transitions. [2025-03-04 02:29:36,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3574074074074074 [2025-03-04 02:29:36,104 INFO L175 Difference]: Start difference. First operand has 417 places, 1145 transitions, 20589 flow. Second operand 27 states and 193 transitions. [2025-03-04 02:29:36,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 1305 transitions, 26249 flow [2025-03-04 02:29:37,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 1305 transitions, 25265 flow, removed 383 selfloop flow, removed 15 redundant places. [2025-03-04 02:29:37,666 INFO L231 Difference]: Finished difference. Result has 439 places, 1218 transitions, 22567 flow [2025-03-04 02:29:37,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=19613, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=318, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=778, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=22567, PETRI_PLACES=439, PETRI_TRANSITIONS=1218} [2025-03-04 02:29:37,668 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 418 predicate places. [2025-03-04 02:29:37,668 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 1218 transitions, 22567 flow [2025-03-04 02:29:37,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:29:37,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:37,668 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:37,675 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:29:37,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:37,869 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:29:37,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:37,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2014154663, now seen corresponding path program 16 times [2025-03-04 02:29:37,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:37,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819558673] [2025-03-04 02:29:37,870 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:29:37,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:37,873 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:29:37,877 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:37,877 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:29:37,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:37,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:37,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819558673] [2025-03-04 02:29:37,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819558673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:37,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700544953] [2025-03-04 02:29:37,950 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:29:37,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:37,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:37,952 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:29:37,954 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:29:37,996 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:29:38,009 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:38,010 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:29:38,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:38,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:29:38,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:38,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:38,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700544953] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:38,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:38,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-04 02:29:38,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350286603] [2025-03-04 02:29:38,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:38,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:29:38,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:38,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:29:38,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:29:38,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:38,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 1218 transitions, 22567 flow. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:29:38,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:38,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:38,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:43,961 INFO L124 PetriNetUnfolderBase]: 3538/6907 cut-off events. [2025-03-04 02:29:43,961 INFO L125 PetriNetUnfolderBase]: For 221913/221913 co-relation queries the response was YES. [2025-03-04 02:29:44,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64748 conditions, 6907 events. 3538/6907 cut-off events. For 221913/221913 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 54804 event pairs, 510 based on Foata normal form. 22/6929 useless extension candidates. Maximal degree in co-relation 64574. Up to 2523 conditions per place. [2025-03-04 02:29:44,036 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 852 selfloop transitions, 664 changer transitions 20/1537 dead transitions. [2025-03-04 02:29:44,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 1537 transitions, 30710 flow [2025-03-04 02:29:44,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 02:29:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-04 02:29:44,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 331 transitions. [2025-03-04 02:29:44,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35978260869565215 [2025-03-04 02:29:44,037 INFO L175 Difference]: Start difference. First operand has 439 places, 1218 transitions, 22567 flow. Second operand 46 states and 331 transitions. [2025-03-04 02:29:44,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 1537 transitions, 30710 flow [2025-03-04 02:29:46,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 1537 transitions, 30233 flow, removed 203 selfloop flow, removed 6 redundant places. [2025-03-04 02:29:46,074 INFO L231 Difference]: Finished difference. Result has 497 places, 1337 transitions, 26830 flow [2025-03-04 02:29:46,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=22077, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=555, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=26830, PETRI_PLACES=497, PETRI_TRANSITIONS=1337} [2025-03-04 02:29:46,075 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 476 predicate places. [2025-03-04 02:29:46,076 INFO L471 AbstractCegarLoop]: Abstraction has has 497 places, 1337 transitions, 26830 flow [2025-03-04 02:29:46,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:29:46,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:46,076 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:46,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 02:29:46,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 02:29:46,276 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:29:46,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:46,277 INFO L85 PathProgramCache]: Analyzing trace with hash 979341857, now seen corresponding path program 17 times [2025-03-04 02:29:46,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:46,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411904766] [2025-03-04 02:29:46,277 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:29:46,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:46,282 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-03-04 02:29:46,296 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:46,296 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:29:46,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:46,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:46,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411904766] [2025-03-04 02:29:46,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411904766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:46,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793870478] [2025-03-04 02:29:46,392 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:29:46,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:46,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:46,394 INFO L229 MonitoredProcess]: Starting monitored process 22 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:29:46,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 02:29:46,436 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-03-04 02:29:46,457 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:46,458 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:29:46,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:46,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:29:46,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:46,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:46,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793870478] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:46,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:46,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-04 02:29:46,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180572379] [2025-03-04 02:29:46,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:46,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:29:46,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:46,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:29:46,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:29:46,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:46,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 1337 transitions, 26830 flow. Second operand has 20 states, 20 states have (on average 4.7) internal successors, (94), 20 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:29:46,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:46,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:46,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:50,101 INFO L124 PetriNetUnfolderBase]: 3889/7526 cut-off events. [2025-03-04 02:29:50,102 INFO L125 PetriNetUnfolderBase]: For 300375/300375 co-relation queries the response was YES. [2025-03-04 02:29:50,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77691 conditions, 7526 events. 3889/7526 cut-off events. For 300375/300375 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 60080 event pairs, 1393 based on Foata normal form. 34/7560 useless extension candidates. Maximal degree in co-relation 77499. Up to 6216 conditions per place. [2025-03-04 02:29:50,197 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 1232 selfloop transitions, 394 changer transitions 2/1629 dead transitions. [2025-03-04 02:29:50,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 1629 transitions, 37274 flow [2025-03-04 02:29:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 02:29:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-04 02:29:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 318 transitions. [2025-03-04 02:29:50,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35333333333333333 [2025-03-04 02:29:50,199 INFO L175 Difference]: Start difference. First operand has 497 places, 1337 transitions, 26830 flow. Second operand 45 states and 318 transitions. [2025-03-04 02:29:50,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 1629 transitions, 37274 flow [2025-03-04 02:29:53,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 1629 transitions, 35690 flow, removed 632 selfloop flow, removed 18 redundant places. [2025-03-04 02:29:53,169 INFO L231 Difference]: Finished difference. Result has 543 places, 1521 transitions, 31699 flow [2025-03-04 02:29:53,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=25344, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=31699, PETRI_PLACES=543, PETRI_TRANSITIONS=1521} [2025-03-04 02:29:53,170 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 522 predicate places. [2025-03-04 02:29:53,170 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 1521 transitions, 31699 flow [2025-03-04 02:29:53,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.7) internal successors, (94), 20 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:29:53,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:53,171 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:53,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 02:29:53,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 02:29:53,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:29:53,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:53,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1660271873, now seen corresponding path program 18 times [2025-03-04 02:29:53,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:53,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055520488] [2025-03-04 02:29:53,372 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:29:53,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:53,376 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:29:53,382 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:53,382 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:29:53,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:53,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:53,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:53,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055520488] [2025-03-04 02:29:53,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055520488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:53,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599077692] [2025-03-04 02:29:53,462 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:29:53,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:53,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:53,464 INFO L229 MonitoredProcess]: Starting monitored process 23 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:29:53,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 02:29:53,506 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:29:53,521 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:29:53,522 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:29:53,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:53,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:29:53,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:53,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:53,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599077692] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:53,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:53,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 02:29:53,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232127905] [2025-03-04 02:29:53,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:53,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 02:29:53,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:53,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 02:29:53,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:29:53,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:53,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 1521 transitions, 31699 flow. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 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:29:53,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:53,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:53,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:57,750 INFO L124 PetriNetUnfolderBase]: 3996/7770 cut-off events. [2025-03-04 02:29:57,750 INFO L125 PetriNetUnfolderBase]: For 405977/405977 co-relation queries the response was YES. [2025-03-04 02:29:57,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84206 conditions, 7770 events. 3996/7770 cut-off events. For 405977/405977 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 62934 event pairs, 590 based on Foata normal form. 20/7790 useless extension candidates. Maximal degree in co-relation 83995. Up to 2922 conditions per place. [2025-03-04 02:29:57,854 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 1008 selfloop transitions, 746 changer transitions 19/1774 dead transitions. [2025-03-04 02:29:57,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 1774 transitions, 39835 flow [2025-03-04 02:29:57,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-04 02:29:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-03-04 02:29:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 341 transitions. [2025-03-04 02:29:57,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3627659574468085 [2025-03-04 02:29:57,856 INFO L175 Difference]: Start difference. First operand has 543 places, 1521 transitions, 31699 flow. Second operand 47 states and 341 transitions. [2025-03-04 02:29:57,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 1774 transitions, 39835 flow [2025-03-04 02:30:02,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 1774 transitions, 38008 flow, removed 820 selfloop flow, removed 17 redundant places. [2025-03-04 02:30:02,376 INFO L231 Difference]: Finished difference. Result has 585 places, 1577 transitions, 34598 flow [2025-03-04 02:30:02,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=29758, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=683, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=795, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=34598, PETRI_PLACES=585, PETRI_TRANSITIONS=1577} [2025-03-04 02:30:02,378 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 564 predicate places. [2025-03-04 02:30:02,378 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 1577 transitions, 34598 flow [2025-03-04 02:30:02,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 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:30:02,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:02,379 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:02,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 02:30:02,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 02:30:02,579 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:30:02,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:02,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1717058485, now seen corresponding path program 19 times [2025-03-04 02:30:02,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:02,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78498351] [2025-03-04 02:30:02,580 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:30:02,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:02,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:30:02,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:30:02,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:02,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:02,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:02,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78498351] [2025-03-04 02:30:02,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78498351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:02,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983810131] [2025-03-04 02:30:02,727 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:30:02,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:02,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:02,729 INFO L229 MonitoredProcess]: Starting monitored process 24 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:30:02,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 02:30:02,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:30:02,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:30:02,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:02,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:02,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:30:02,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:02,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:02,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983810131] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:02,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:02,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-04 02:30:02,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460733905] [2025-03-04 02:30:02,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:02,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:30:02,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:02,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:30:02,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:30:02,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:30:02,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 1577 transitions, 34598 flow. Second operand has 19 states, 19 states have (on average 4.631578947368421) internal successors, (88), 19 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:30:02,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:02,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:30:02,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand