./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/chl-array-int-symm.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 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:41:37,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:41:37,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:41:37,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:41:37,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:41:37,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:41:37,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:41:37,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:41:37,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:41:37,668 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:41:37,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:41:37,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:41:37,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:41:37,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:41:37,668 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:41:37,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:41:37,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:41:37,668 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:41:37,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:41:37,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:41:37,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:41:37,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:41:37,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:41:37,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:41:37,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:41:37,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:41:37,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:41:37,670 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 -> 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 [2025-03-13 21:41:37,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:41:37,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:41:37,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:41:37,890 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:41:37,890 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:41:37,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-13 21:41:39,116 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94c345e6/b5be5972276d4008ab64dabf68305826/FLAGea3cc6ed6 [2025-03-13 21:41:39,329 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:41:39,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-13 21:41:39,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94c345e6/b5be5972276d4008ab64dabf68305826/FLAGea3cc6ed6 [2025-03-13 21:41:39,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94c345e6/b5be5972276d4008ab64dabf68305826 [2025-03-13 21:41:39,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:41:39,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:41:39,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:41:39,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:41:39,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:41:39,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:41:39" (1/1) ... [2025-03-13 21:41:39,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42217501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:39, skipping insertion in model container [2025-03-13 21:41:39,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:41:39" (1/1) ... [2025-03-13 21:41:39,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:41:39,523 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/chl-array-int-symm.wvr.c[2508,2521] [2025-03-13 21:41:39,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:41:39,542 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:41:39,560 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/chl-array-int-symm.wvr.c[2508,2521] [2025-03-13 21:41:39,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:41:39,576 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:41:39,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:39 WrapperNode [2025-03-13 21:41:39,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:41:39,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:41:39,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:41:39,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:41:39,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:39" (1/1) ... [2025-03-13 21:41:39,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:39" (1/1) ... [2025-03-13 21:41:39,603 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 181 [2025-03-13 21:41:39,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:41:39,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:41:39,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:41:39,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:41:39,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:39" (1/1) ... [2025-03-13 21:41:39,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:39" (1/1) ... [2025-03-13 21:41:39,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:39" (1/1) ... [2025-03-13 21:41:39,619 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-13 21:41:39,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:39" (1/1) ... [2025-03-13 21:41:39,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:39" (1/1) ... [2025-03-13 21:41:39,623 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:39" (1/1) ... [2025-03-13 21:41:39,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:39" (1/1) ... [2025-03-13 21:41:39,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:39" (1/1) ... [2025-03-13 21:41:39,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:39" (1/1) ... [2025-03-13 21:41:39,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:41:39,627 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:41:39,627 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:41:39,627 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:41:39,628 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:39" (1/1) ... [2025-03-13 21:41:39,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:41:39,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:39,650 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-13 21:41:39,652 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-13 21:41:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:41:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:41:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:41:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:41:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:41:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:41:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:41:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:41:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:41:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:41:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:41:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:41:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:41:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:41:39,669 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:41:39,745 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:41:39,746 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:41:40,024 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:41:40,025 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:41:40,025 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:41:40,261 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:41:40,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:41:40 BoogieIcfgContainer [2025-03-13 21:41:40,261 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:41:40,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:41:40,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:41:40,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:41:40,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:41:39" (1/3) ... [2025-03-13 21:41:40,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:41:40, skipping insertion in model container [2025-03-13 21:41:40,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:39" (2/3) ... [2025-03-13 21:41:40,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:41:40, skipping insertion in model container [2025-03-13 21:41:40,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:41:40" (3/3) ... [2025-03-13 21:41:40,270 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2025-03-13 21:41:40,279 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:41:40,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-symm.wvr.c that has 3 procedures, 23 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-13 21:41:40,281 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:41:40,322 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:41:40,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 70 flow [2025-03-13 21:41:40,362 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-03-13 21:41:40,364 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:41:40,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 6/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-03-13 21:41:40,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 28 transitions, 70 flow [2025-03-13 21:41:40,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 25 transitions, 62 flow [2025-03-13 21:41:40,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:41:40,386 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;@41ca868e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:41:40,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:41:40,392 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:41:40,392 INFO L124 PetriNetUnfolderBase]: 6/24 cut-off events. [2025-03-13 21:41:40,392 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:41:40,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:40,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:40,393 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-13 21:41:40,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:40,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1347315461, now seen corresponding path program 1 times [2025-03-13 21:41:40,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:40,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301818699] [2025-03-13 21:41:40,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:40,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:40,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-13 21:41:40,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:41:40,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:40,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:40,941 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-13 21:41:40,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:40,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301818699] [2025-03-13 21:41:40,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301818699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:40,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:40,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:41:40,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591568858] [2025-03-13 21:41:40,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:40,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:41:40,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:40,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:41:40,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:41:40,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:40,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 62 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-13 21:41:40,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:40,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:40,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:41,244 INFO L124 PetriNetUnfolderBase]: 230/408 cut-off events. [2025-03-13 21:41:41,244 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-13 21:41:41,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 842 conditions, 408 events. 230/408 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1587 event pairs, 64 based on Foata normal form. 1/349 useless extension candidates. Maximal degree in co-relation 418. Up to 146 conditions per place. [2025-03-13 21:41:41,250 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 58 selfloop transitions, 10 changer transitions 1/72 dead transitions. [2025-03-13 21:41:41,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 72 transitions, 324 flow [2025-03-13 21:41:41,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:41:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:41:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2025-03-13 21:41:41,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49107142857142855 [2025-03-13 21:41:41,262 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 62 flow. Second operand 8 states and 110 transitions. [2025-03-13 21:41:41,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 72 transitions, 324 flow [2025-03-13 21:41:41,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 72 transitions, 296 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:41:41,270 INFO L231 Difference]: Finished difference. Result has 33 places, 34 transitions, 123 flow [2025-03-13 21:41:41,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=123, PETRI_PLACES=33, PETRI_TRANSITIONS=34} [2025-03-13 21:41:41,274 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2025-03-13 21:41:41,275 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 34 transitions, 123 flow [2025-03-13 21:41:41,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-13 21:41:41,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:41,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:41,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:41:41,275 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-13 21:41:41,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:41,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2132697743, now seen corresponding path program 1 times [2025-03-13 21:41:41,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:41,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825938502] [2025-03-13 21:41:41,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:41,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:41,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:41:41,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:41:41,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:41,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:41,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:41,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825938502] [2025-03-13 21:41:41,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825938502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:41,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684927834] [2025-03-13 21:41:41,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:41,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:41,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:41,471 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-13 21:41:41,473 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-13 21:41:41,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:41:41,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:41:41,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:41,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:41,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:41:41,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:41,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:41,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:41,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684927834] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:41,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:41:41,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 14 [2025-03-13 21:41:41,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949010972] [2025-03-13 21:41:41,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:41,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:41:41,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:41,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:41:41,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:41:41,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:41,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 34 transitions, 123 flow. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:41,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:41,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:41,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:42,148 INFO L124 PetriNetUnfolderBase]: 495/876 cut-off events. [2025-03-13 21:41:42,148 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-03-13 21:41:42,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1991 conditions, 876 events. 495/876 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4235 event pairs, 218 based on Foata normal form. 1/868 useless extension candidates. Maximal degree in co-relation 1177. Up to 394 conditions per place. [2025-03-13 21:41:42,158 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 83 selfloop transitions, 12 changer transitions 1/99 dead transitions. [2025-03-13 21:41:42,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 99 transitions, 508 flow [2025-03-13 21:41:42,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:41:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:41:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2025-03-13 21:41:42,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-13 21:41:42,160 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 123 flow. Second operand 8 states and 126 transitions. [2025-03-13 21:41:42,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 99 transitions, 508 flow [2025-03-13 21:41:42,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 99 transitions, 504 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-13 21:41:42,162 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 210 flow [2025-03-13 21:41:42,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2025-03-13 21:41:42,163 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2025-03-13 21:41:42,163 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 210 flow [2025-03-13 21:41:42,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:42,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:42,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:42,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:41:42,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:42,365 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-13 21:41:42,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:42,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1394888682, now seen corresponding path program 1 times [2025-03-13 21:41:42,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:42,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168360774] [2025-03-13 21:41:42,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:42,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:42,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:41:42,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:41:42,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:42,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:42,466 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-13 21:41:42,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:42,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168360774] [2025-03-13 21:41:42,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168360774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:42,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:42,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:41:42,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029774119] [2025-03-13 21:41:42,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:42,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:41:42,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:42,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:41:42,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:41:42,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:42,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:42,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:42,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:42,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:42,610 INFO L124 PetriNetUnfolderBase]: 372/703 cut-off events. [2025-03-13 21:41:42,610 INFO L125 PetriNetUnfolderBase]: For 496/496 co-relation queries the response was YES. [2025-03-13 21:41:42,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1813 conditions, 703 events. 372/703 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3428 event pairs, 157 based on Foata normal form. 25/725 useless extension candidates. Maximal degree in co-relation 1257. Up to 425 conditions per place. [2025-03-13 21:41:42,615 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 58 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2025-03-13 21:41:42,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 431 flow [2025-03-13 21:41:42,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:41:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:41:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-03-13 21:41:42,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2025-03-13 21:41:42,617 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 210 flow. Second operand 5 states and 73 transitions. [2025-03-13 21:41:42,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 431 flow [2025-03-13 21:41:42,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 410 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-13 21:41:42,625 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 212 flow [2025-03-13 21:41:42,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-03-13 21:41:42,626 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2025-03-13 21:41:42,626 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 212 flow [2025-03-13 21:41:42,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:42,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:42,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:42,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:41:42,626 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-13 21:41:42,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:42,627 INFO L85 PathProgramCache]: Analyzing trace with hash -208855790, now seen corresponding path program 1 times [2025-03-13 21:41:42,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:42,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827805931] [2025-03-13 21:41:42,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:42,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:42,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:41:42,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:41:42,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:42,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:42,734 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-13 21:41:42,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:42,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827805931] [2025-03-13 21:41:42,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827805931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:42,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:42,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:41:42,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421018125] [2025-03-13 21:41:42,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:42,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:41:42,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:42,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:41:42,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:41:42,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:42,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:42,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:42,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:42,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:42,933 INFO L124 PetriNetUnfolderBase]: 303/578 cut-off events. [2025-03-13 21:41:42,933 INFO L125 PetriNetUnfolderBase]: For 436/436 co-relation queries the response was YES. [2025-03-13 21:41:42,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 578 events. 303/578 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2660 event pairs, 142 based on Foata normal form. 16/592 useless extension candidates. Maximal degree in co-relation 1330. Up to 421 conditions per place. [2025-03-13 21:41:42,936 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 48 selfloop transitions, 6 changer transitions 2/59 dead transitions. [2025-03-13 21:41:42,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 389 flow [2025-03-13 21:41:42,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:41:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:41:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2025-03-13 21:41:42,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2025-03-13 21:41:42,938 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 212 flow. Second operand 6 states and 75 transitions. [2025-03-13 21:41:42,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 389 flow [2025-03-13 21:41:42,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 372 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-13 21:41:42,941 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 222 flow [2025-03-13 21:41:42,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2025-03-13 21:41:42,941 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 24 predicate places. [2025-03-13 21:41:42,942 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 222 flow [2025-03-13 21:41:42,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:42,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:42,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:42,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:41:42,942 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-13 21:41:42,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:42,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1144005200, now seen corresponding path program 1 times [2025-03-13 21:41:42,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:42,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539477773] [2025-03-13 21:41:42,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:42,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:42,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:41:42,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:41:42,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:42,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:43,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:43,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539477773] [2025-03-13 21:41:43,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539477773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:43,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589039825] [2025-03-13 21:41:43,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:43,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:43,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:43,104 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-13 21:41:43,106 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-13 21:41:43,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:41:43,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:41:43,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:43,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:43,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:41:43,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:43,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:43,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589039825] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:43,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:41:43,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-13 21:41:43,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829521503] [2025-03-13 21:41:43,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:43,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:41:43,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:43,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:41:43,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:41:43,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:43,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 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-13 21:41:43,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:43,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:43,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:43,499 INFO L124 PetriNetUnfolderBase]: 286/540 cut-off events. [2025-03-13 21:41:43,499 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2025-03-13 21:41:43,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 540 events. 286/540 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2492 event pairs, 138 based on Foata normal form. 1/537 useless extension candidates. Maximal degree in co-relation 1390. Up to 421 conditions per place. [2025-03-13 21:41:43,502 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 46 selfloop transitions, 5 changer transitions 7/61 dead transitions. [2025-03-13 21:41:43,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 395 flow [2025-03-13 21:41:43,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:41:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:41:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2025-03-13 21:41:43,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42346938775510207 [2025-03-13 21:41:43,504 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 222 flow. Second operand 7 states and 83 transitions. [2025-03-13 21:41:43,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 395 flow [2025-03-13 21:41:43,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 380 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-13 21:41:43,507 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 205 flow [2025-03-13 21:41:43,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2025-03-13 21:41:43,507 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2025-03-13 21:41:43,507 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 205 flow [2025-03-13 21:41:43,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 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-13 21:41:43,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:43,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:43,515 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-13 21:41:43,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:43,712 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-13 21:41:43,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:43,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1132307270, now seen corresponding path program 2 times [2025-03-13 21:41:43,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:43,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637830067] [2025-03-13 21:41:43,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:41:43,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:43,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:41:43,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 18 statements. [2025-03-13 21:41:43,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:41:43,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:43,818 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-13 21:41:43,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:43,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637830067] [2025-03-13 21:41:43,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637830067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:43,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:43,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:41:43,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168739203] [2025-03-13 21:41:43,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:43,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:41:43,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:43,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:41:43,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:41:43,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:43,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-13 21:41:43,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:43,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:43,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:43,955 INFO L124 PetriNetUnfolderBase]: 275/511 cut-off events. [2025-03-13 21:41:43,955 INFO L125 PetriNetUnfolderBase]: For 359/359 co-relation queries the response was YES. [2025-03-13 21:41:43,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1344 conditions, 511 events. 275/511 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2246 event pairs, 62 based on Foata normal form. 1/510 useless extension candidates. Maximal degree in co-relation 1314. Up to 406 conditions per place. [2025-03-13 21:41:43,959 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 31 selfloop transitions, 5 changer transitions 20/59 dead transitions. [2025-03-13 21:41:43,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 59 transitions, 370 flow [2025-03-13 21:41:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:41:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:41:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2025-03-13 21:41:43,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39732142857142855 [2025-03-13 21:41:43,960 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 205 flow. Second operand 8 states and 89 transitions. [2025-03-13 21:41:43,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 59 transitions, 370 flow [2025-03-13 21:41:43,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 357 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-13 21:41:43,962 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 173 flow [2025-03-13 21:41:43,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=173, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2025-03-13 21:41:43,963 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2025-03-13 21:41:43,963 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 173 flow [2025-03-13 21:41:43,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-13 21:41:43,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:43,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:43,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:41:43,963 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-13 21:41:43,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:43,965 INFO L85 PathProgramCache]: Analyzing trace with hash -612047067, now seen corresponding path program 2 times [2025-03-13 21:41:43,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:43,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264712033] [2025-03-13 21:41:43,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:41:43,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:43,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:41:43,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 18 statements. [2025-03-13 21:41:43,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:41:43,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:44,087 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-13 21:41:44,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:44,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264712033] [2025-03-13 21:41:44,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264712033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:44,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:44,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:41:44,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977352801] [2025-03-13 21:41:44,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:44,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:41:44,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:44,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:41:44,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:41:44,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:44,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 173 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 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-13 21:41:44,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:44,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:44,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:44,309 INFO L124 PetriNetUnfolderBase]: 272/498 cut-off events. [2025-03-13 21:41:44,309 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2025-03-13 21:41:44,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 498 events. 272/498 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2138 event pairs, 34 based on Foata normal form. 1/498 useless extension candidates. Maximal degree in co-relation 1272. Up to 145 conditions per place. [2025-03-13 21:41:44,311 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 59 selfloop transitions, 15 changer transitions 1/78 dead transitions. [2025-03-13 21:41:44,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 461 flow [2025-03-13 21:41:44,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:41:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:41:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2025-03-13 21:41:44,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2025-03-13 21:41:44,312 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 173 flow. Second operand 9 states and 118 transitions. [2025-03-13 21:41:44,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 461 flow [2025-03-13 21:41:44,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 78 transitions, 415 flow, removed 17 selfloop flow, removed 9 redundant places. [2025-03-13 21:41:44,314 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 235 flow [2025-03-13 21:41:44,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2025-03-13 21:41:44,315 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2025-03-13 21:41:44,315 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 235 flow [2025-03-13 21:41:44,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 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-13 21:41:44,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:44,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:44,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:41:44,315 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-13 21:41:44,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:44,316 INFO L85 PathProgramCache]: Analyzing trace with hash -751695230, now seen corresponding path program 1 times [2025-03-13 21:41:44,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:44,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433945375] [2025-03-13 21:41:44,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:44,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:44,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:41:44,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:41:44,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:44,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:44,397 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-13 21:41:44,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:44,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433945375] [2025-03-13 21:41:44,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433945375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:44,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:44,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:41:44,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774555793] [2025-03-13 21:41:44,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:44,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:41:44,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:44,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:41:44,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:41:44,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:44,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-13 21:41:44,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:44,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:44,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:44,488 INFO L124 PetriNetUnfolderBase]: 172/339 cut-off events. [2025-03-13 21:41:44,488 INFO L125 PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES. [2025-03-13 21:41:44,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 339 events. 172/339 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1398 event pairs, 68 based on Foata normal form. 21/358 useless extension candidates. Maximal degree in co-relation 880. Up to 156 conditions per place. [2025-03-13 21:41:44,490 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 45 selfloop transitions, 6 changer transitions 0/54 dead transitions. [2025-03-13 21:41:44,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 342 flow [2025-03-13 21:41:44,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:41:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:41:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-03-13 21:41:44,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2025-03-13 21:41:44,492 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 235 flow. Second operand 5 states and 71 transitions. [2025-03-13 21:41:44,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 342 flow [2025-03-13 21:41:44,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 323 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-13 21:41:44,494 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 197 flow [2025-03-13 21:41:44,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2025-03-13 21:41:44,494 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2025-03-13 21:41:44,494 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 197 flow [2025-03-13 21:41:44,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-13 21:41:44,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:44,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:44,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:41:44,495 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:41:44,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:44,495 INFO L85 PathProgramCache]: Analyzing trace with hash -885353914, now seen corresponding path program 1 times [2025-03-13 21:41:44,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:44,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207078670] [2025-03-13 21:41:44,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:44,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:44,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:41:44,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:41:44,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:44,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:44,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:44,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207078670] [2025-03-13 21:41:44,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207078670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:44,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972080866] [2025-03-13 21:41:44,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:44,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:44,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:44,593 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-13 21:41:44,594 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-13 21:41:44,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:41:44,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:41:44,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:44,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:44,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:41:44,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:44,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:44,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972080866] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:44,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:41:44,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-03-13 21:41:44,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436400841] [2025-03-13 21:41:44,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:44,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:41:44,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:44,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:41:44,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:41:44,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-13 21:41:44,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 197 flow. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-13 21:41:44,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:44,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-13 21:41:44,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:44,879 INFO L124 PetriNetUnfolderBase]: 265/473 cut-off events. [2025-03-13 21:41:44,880 INFO L125 PetriNetUnfolderBase]: For 478/478 co-relation queries the response was YES. [2025-03-13 21:41:44,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1257 conditions, 473 events. 265/473 cut-off events. For 478/478 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1883 event pairs, 126 based on Foata normal form. 11/482 useless extension candidates. Maximal degree in co-relation 1229. Up to 204 conditions per place. [2025-03-13 21:41:44,882 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 50 selfloop transitions, 9 changer transitions 0/61 dead transitions. [2025-03-13 21:41:44,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 385 flow [2025-03-13 21:41:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:41:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:41:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2025-03-13 21:41:44,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.413265306122449 [2025-03-13 21:41:44,883 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 197 flow. Second operand 7 states and 81 transitions. [2025-03-13 21:41:44,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 385 flow [2025-03-13 21:41:44,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 376 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:41:44,885 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 223 flow [2025-03-13 21:41:44,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2025-03-13 21:41:44,886 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2025-03-13 21:41:44,886 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 223 flow [2025-03-13 21:41:44,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-13 21:41:44,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:44,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:44,893 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-13 21:41:45,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:45,092 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-13 21:41:45,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:45,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2068450322, now seen corresponding path program 1 times [2025-03-13 21:41:45,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:45,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135709937] [2025-03-13 21:41:45,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:45,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:45,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:41:45,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:41:45,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:45,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:45,157 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-13 21:41:45,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:45,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135709937] [2025-03-13 21:41:45,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135709937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:45,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:45,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:41:45,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41595079] [2025-03-13 21:41:45,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:45,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:41:45,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:45,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:41:45,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:41:45,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:45,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-13 21:41:45,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:45,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:45,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:45,229 INFO L124 PetriNetUnfolderBase]: 166/327 cut-off events. [2025-03-13 21:41:45,229 INFO L125 PetriNetUnfolderBase]: For 370/371 co-relation queries the response was YES. [2025-03-13 21:41:45,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 946 conditions, 327 events. 166/327 cut-off events. For 370/371 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1306 event pairs, 90 based on Foata normal form. 12/337 useless extension candidates. Maximal degree in co-relation 914. Up to 233 conditions per place. [2025-03-13 21:41:45,230 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 25 selfloop transitions, 2 changer transitions 17/47 dead transitions. [2025-03-13 21:41:45,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 308 flow [2025-03-13 21:41:45,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:41:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:41:45,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-03-13 21:41:45,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-13 21:41:45,231 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 223 flow. Second operand 5 states and 65 transitions. [2025-03-13 21:41:45,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 308 flow [2025-03-13 21:41:45,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 47 transitions, 289 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-13 21:41:45,233 INFO L231 Difference]: Finished difference. Result has 51 places, 30 transitions, 136 flow [2025-03-13 21:41:45,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=51, PETRI_TRANSITIONS=30} [2025-03-13 21:41:45,235 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 25 predicate places. [2025-03-13 21:41:45,236 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 30 transitions, 136 flow [2025-03-13 21:41:45,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-13 21:41:45,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:45,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:45,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:41:45,236 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-13 21:41:45,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:45,236 INFO L85 PathProgramCache]: Analyzing trace with hash -738742195, now seen corresponding path program 1 times [2025-03-13 21:41:45,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:45,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34775728] [2025-03-13 21:41:45,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:45,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:45,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:41:45,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:41:45,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:45,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:45,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:45,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34775728] [2025-03-13 21:41:45,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34775728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:45,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305056938] [2025-03-13 21:41:45,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:45,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:45,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:45,328 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-13 21:41:45,329 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-13 21:41:45,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:41:45,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:41:45,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:45,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:45,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:41:45,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:45,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:45,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305056938] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:45,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:41:45,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-03-13 21:41:45,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865160428] [2025-03-13 21:41:45,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:45,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:41:45,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:45,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:41:45,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:41:45,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-13 21:41:45,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 30 transitions, 136 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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-13 21:41:45,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:45,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-13 21:41:45,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:45,591 INFO L124 PetriNetUnfolderBase]: 201/374 cut-off events. [2025-03-13 21:41:45,591 INFO L125 PetriNetUnfolderBase]: For 327/329 co-relation queries the response was YES. [2025-03-13 21:41:45,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 374 events. 201/374 cut-off events. For 327/329 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1351 event pairs, 100 based on Foata normal form. 16/387 useless extension candidates. Maximal degree in co-relation 1011. Up to 190 conditions per place. [2025-03-13 21:41:45,593 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 34 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2025-03-13 21:41:45,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 276 flow [2025-03-13 21:41:45,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:41:45,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:41:45,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2025-03-13 21:41:45,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34183673469387754 [2025-03-13 21:41:45,594 INFO L175 Difference]: Start difference. First operand has 51 places, 30 transitions, 136 flow. Second operand 7 states and 67 transitions. [2025-03-13 21:41:45,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 276 flow [2025-03-13 21:41:45,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 251 flow, removed 9 selfloop flow, removed 7 redundant places. [2025-03-13 21:41:45,597 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 150 flow [2025-03-13 21:41:45,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=150, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2025-03-13 21:41:45,598 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2025-03-13 21:41:45,598 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 150 flow [2025-03-13 21:41:45,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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-13 21:41:45,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:45,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:45,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:41:45,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:45,799 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-13 21:41:45,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:45,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1496546592, now seen corresponding path program 1 times [2025-03-13 21:41:45,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:45,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896823804] [2025-03-13 21:41:45,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:45,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:45,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:41:45,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:41:45,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:45,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:46,184 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-13 21:41:46,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:46,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896823804] [2025-03-13 21:41:46,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896823804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:46,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908589375] [2025-03-13 21:41:46,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:46,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:46,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:46,187 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-13 21:41:46,188 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-13 21:41:46,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:41:46,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:41:46,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:46,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:46,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-13 21:41:46,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:46,461 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-13 21:41:46,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 24 [2025-03-13 21:41:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:46,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:41:46,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908589375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:46,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:41:46,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2025-03-13 21:41:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29853112] [2025-03-13 21:41:46,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:46,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:41:46,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:46,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:41:46,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:41:46,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:46,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 150 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:46,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:46,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:46,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:46,717 INFO L124 PetriNetUnfolderBase]: 274/515 cut-off events. [2025-03-13 21:41:46,717 INFO L125 PetriNetUnfolderBase]: For 532/551 co-relation queries the response was YES. [2025-03-13 21:41:46,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 515 events. 274/515 cut-off events. For 532/551 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2232 event pairs, 101 based on Foata normal form. 1/513 useless extension candidates. Maximal degree in co-relation 1458. Up to 279 conditions per place. [2025-03-13 21:41:46,720 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 59 selfloop transitions, 7 changer transitions 6/75 dead transitions. [2025-03-13 21:41:46,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 456 flow [2025-03-13 21:41:46,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:41:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:41:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-03-13 21:41:46,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-03-13 21:41:46,721 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 150 flow. Second operand 7 states and 100 transitions. [2025-03-13 21:41:46,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 456 flow [2025-03-13 21:41:46,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 75 transitions, 444 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:41:46,723 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 198 flow [2025-03-13 21:41:46,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=198, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2025-03-13 21:41:46,723 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 22 predicate places. [2025-03-13 21:41:46,723 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 198 flow [2025-03-13 21:41:46,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:46,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:46,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:46,731 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-13 21:41:46,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-13 21:41:46,924 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-13 21:41:46,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:46,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1773613190, now seen corresponding path program 2 times [2025-03-13 21:41:46,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:46,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966173993] [2025-03-13 21:41:46,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:41:46,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:46,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:41:46,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-13 21:41:46,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:41:46,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:47,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:47,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:47,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966173993] [2025-03-13 21:41:47,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966173993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:47,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:47,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:41:47,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127693985] [2025-03-13 21:41:47,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:47,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:41:47,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:47,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:41:47,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:41:47,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:47,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 198 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:47,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:47,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:47,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:47,479 INFO L124 PetriNetUnfolderBase]: 329/605 cut-off events. [2025-03-13 21:41:47,479 INFO L125 PetriNetUnfolderBase]: For 1088/1114 co-relation queries the response was YES. [2025-03-13 21:41:47,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2014 conditions, 605 events. 329/605 cut-off events. For 1088/1114 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2711 event pairs, 115 based on Foata normal form. 1/601 useless extension candidates. Maximal degree in co-relation 1983. Up to 284 conditions per place. [2025-03-13 21:41:47,482 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 52 selfloop transitions, 14 changer transitions 6/75 dead transitions. [2025-03-13 21:41:47,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 520 flow [2025-03-13 21:41:47,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:41:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:41:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2025-03-13 21:41:47,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2025-03-13 21:41:47,483 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 198 flow. Second operand 9 states and 110 transitions. [2025-03-13 21:41:47,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 520 flow [2025-03-13 21:41:47,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 489 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-13 21:41:47,485 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 286 flow [2025-03-13 21:41:47,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=286, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2025-03-13 21:41:47,486 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 31 predicate places. [2025-03-13 21:41:47,486 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 286 flow [2025-03-13 21:41:47,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:47,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:47,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:47,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:41:47,487 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-13 21:41:47,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:47,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1201577342, now seen corresponding path program 3 times [2025-03-13 21:41:47,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:47,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220465631] [2025-03-13 21:41:47,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:41:47,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:47,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:41:47,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-13 21:41:47,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:41:47,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:47,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:47,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220465631] [2025-03-13 21:41:47,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220465631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:47,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:47,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:41:47,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491819445] [2025-03-13 21:41:47,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:47,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:41:47,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:47,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:41:47,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:41:47,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:47,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 286 flow. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:47,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:47,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:47,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:47,937 INFO L124 PetriNetUnfolderBase]: 325/605 cut-off events. [2025-03-13 21:41:47,937 INFO L125 PetriNetUnfolderBase]: For 1557/1580 co-relation queries the response was YES. [2025-03-13 21:41:47,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2155 conditions, 605 events. 325/605 cut-off events. For 1557/1580 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2731 event pairs, 61 based on Foata normal form. 1/604 useless extension candidates. Maximal degree in co-relation 2120. Up to 279 conditions per place. [2025-03-13 21:41:47,940 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 54 selfloop transitions, 15 changer transitions 6/78 dead transitions. [2025-03-13 21:41:47,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 575 flow [2025-03-13 21:41:47,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:41:47,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:41:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2025-03-13 21:41:47,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-13 21:41:47,942 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 286 flow. Second operand 9 states and 112 transitions. [2025-03-13 21:41:47,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 575 flow [2025-03-13 21:41:47,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 549 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-13 21:41:47,945 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 337 flow [2025-03-13 21:41:47,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=337, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2025-03-13 21:41:47,946 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 37 predicate places. [2025-03-13 21:41:47,946 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 337 flow [2025-03-13 21:41:47,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:47,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:47,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:47,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:41:47,947 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-13 21:41:47,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:47,947 INFO L85 PathProgramCache]: Analyzing trace with hash -547107398, now seen corresponding path program 4 times [2025-03-13 21:41:47,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:47,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298571471] [2025-03-13 21:41:47,947 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:41:47,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:47,953 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:41:47,962 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:41:47,963 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:41:47,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:48,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:48,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298571471] [2025-03-13 21:41:48,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298571471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:48,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:48,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:41:48,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114503426] [2025-03-13 21:41:48,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:48,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:41:48,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:48,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:41:48,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:41:48,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:48,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 337 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 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-13 21:41:48,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:48,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:48,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:48,231 INFO L124 PetriNetUnfolderBase]: 315/582 cut-off events. [2025-03-13 21:41:48,231 INFO L125 PetriNetUnfolderBase]: For 1726/1749 co-relation queries the response was YES. [2025-03-13 21:41:48,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2144 conditions, 582 events. 315/582 cut-off events. For 1726/1749 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2562 event pairs, 66 based on Foata normal form. 1/581 useless extension candidates. Maximal degree in co-relation 2107. Up to 280 conditions per place. [2025-03-13 21:41:48,234 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 48 selfloop transitions, 15 changer transitions 6/72 dead transitions. [2025-03-13 21:41:48,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 72 transitions, 575 flow [2025-03-13 21:41:48,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:41:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:41:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-03-13 21:41:48,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45982142857142855 [2025-03-13 21:41:48,236 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 337 flow. Second operand 8 states and 103 transitions. [2025-03-13 21:41:48,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 72 transitions, 575 flow [2025-03-13 21:41:48,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 544 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-13 21:41:48,239 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 347 flow [2025-03-13 21:41:48,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=347, PETRI_PLACES=65, PETRI_TRANSITIONS=44} [2025-03-13 21:41:48,240 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2025-03-13 21:41:48,240 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 347 flow [2025-03-13 21:41:48,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 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-13 21:41:48,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:48,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:48,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:41:48,240 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-13 21:41:48,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:48,241 INFO L85 PathProgramCache]: Analyzing trace with hash -73075014, now seen corresponding path program 5 times [2025-03-13 21:41:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:48,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853777814] [2025-03-13 21:41:48,241 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:41:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:48,248 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:41:48,259 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:41:48,260 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:41:48,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:48,532 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-13 21:41:48,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:48,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853777814] [2025-03-13 21:41:48,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853777814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:48,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832201155] [2025-03-13 21:41:48,533 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:41:48,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:48,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:48,535 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-13 21:41:48,536 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-13 21:41:48,578 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:41:48,595 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:41:48,595 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:41:48,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:48,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-13 21:41:48,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:48,727 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 21:41:48,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-13 21:41:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:48,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:41:48,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832201155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:48,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:41:48,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 15 [2025-03-13 21:41:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840441660] [2025-03-13 21:41:48,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:48,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:41:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:48,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:41:48,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:41:48,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:48,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 44 transitions, 347 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:48,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:48,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:48,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:48,988 INFO L124 PetriNetUnfolderBase]: 422/777 cut-off events. [2025-03-13 21:41:48,988 INFO L125 PetriNetUnfolderBase]: For 2175/2202 co-relation queries the response was YES. [2025-03-13 21:41:48,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2840 conditions, 777 events. 422/777 cut-off events. For 2175/2202 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3654 event pairs, 157 based on Foata normal form. 1/773 useless extension candidates. Maximal degree in co-relation 2803. Up to 404 conditions per place. [2025-03-13 21:41:48,991 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 67 selfloop transitions, 15 changer transitions 6/91 dead transitions. [2025-03-13 21:41:48,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 821 flow [2025-03-13 21:41:48,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:41:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:41:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2025-03-13 21:41:48,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-13 21:41:48,992 INFO L175 Difference]: Start difference. First operand has 65 places, 44 transitions, 347 flow. Second operand 9 states and 105 transitions. [2025-03-13 21:41:48,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 821 flow [2025-03-13 21:41:48,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 91 transitions, 765 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-03-13 21:41:48,996 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 398 flow [2025-03-13 21:41:48,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=398, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2025-03-13 21:41:48,997 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 42 predicate places. [2025-03-13 21:41:48,997 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 398 flow [2025-03-13 21:41:48,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:48,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:48,997 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:49,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-13 21:41:49,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-13 21:41:49,198 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-13 21:41:49,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:49,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1014674192, now seen corresponding path program 6 times [2025-03-13 21:41:49,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:49,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816919722] [2025-03-13 21:41:49,198 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:41:49,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:49,207 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:41:49,223 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-13 21:41:49,224 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:41:49,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:49,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:49,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816919722] [2025-03-13 21:41:49,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816919722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:49,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:49,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:41:49,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028792747] [2025-03-13 21:41:49,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:49,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:41:49,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:49,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:41:49,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:41:49,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:49,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 398 flow. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:49,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:49,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:49,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:49,634 INFO L124 PetriNetUnfolderBase]: 418/773 cut-off events. [2025-03-13 21:41:49,634 INFO L125 PetriNetUnfolderBase]: For 2516/2543 co-relation queries the response was YES. [2025-03-13 21:41:49,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3025 conditions, 773 events. 418/773 cut-off events. For 2516/2543 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3645 event pairs, 89 based on Foata normal form. 1/770 useless extension candidates. Maximal degree in co-relation 2987. Up to 399 conditions per place. [2025-03-13 21:41:49,638 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 57 selfloop transitions, 18 changer transitions 6/84 dead transitions. [2025-03-13 21:41:49,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 84 transitions, 738 flow [2025-03-13 21:41:49,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:41:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:41:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2025-03-13 21:41:49,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-13 21:41:49,639 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 398 flow. Second operand 9 states and 108 transitions. [2025-03-13 21:41:49,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 84 transitions, 738 flow [2025-03-13 21:41:49,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 84 transitions, 697 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-13 21:41:49,643 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 488 flow [2025-03-13 21:41:49,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=488, PETRI_PLACES=74, PETRI_TRANSITIONS=53} [2025-03-13 21:41:49,644 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 48 predicate places. [2025-03-13 21:41:49,644 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 488 flow [2025-03-13 21:41:49,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:49,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:49,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:49,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 21:41:49,645 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-13 21:41:49,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:49,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1469488570, now seen corresponding path program 7 times [2025-03-13 21:41:49,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:49,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006323115] [2025-03-13 21:41:49,645 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:41:49,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:49,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:41:49,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:41:49,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:49,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:49,941 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-13 21:41:49,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006323115] [2025-03-13 21:41:49,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006323115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335939996] [2025-03-13 21:41:49,941 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:41:49,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:49,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:49,943 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-13 21:41:49,945 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-13 21:41:49,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:41:50,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:41:50,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:50,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:50,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-13 21:41:50,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:50,090 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-13 21:41:50,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 24 [2025-03-13 21:41:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:50,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:41:50,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335939996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:50,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:41:50,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2025-03-13 21:41:50,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160100726] [2025-03-13 21:41:50,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:50,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:41:50,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:50,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:41:50,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:41:50,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:50,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 488 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:50,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:50,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:50,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:50,327 INFO L124 PetriNetUnfolderBase]: 442/813 cut-off events. [2025-03-13 21:41:50,329 INFO L125 PetriNetUnfolderBase]: For 3522/3549 co-relation queries the response was YES. [2025-03-13 21:41:50,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3358 conditions, 813 events. 442/813 cut-off events. For 3522/3549 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3881 event pairs, 170 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 3318. Up to 420 conditions per place. [2025-03-13 21:41:50,333 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 66 selfloop transitions, 19 changer transitions 6/94 dead transitions. [2025-03-13 21:41:50,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 94 transitions, 954 flow [2025-03-13 21:41:50,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:41:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:41:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2025-03-13 21:41:50,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2025-03-13 21:41:50,334 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 488 flow. Second operand 7 states and 96 transitions. [2025-03-13 21:41:50,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 94 transitions, 954 flow [2025-03-13 21:41:50,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 94 transitions, 916 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-03-13 21:41:50,339 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 610 flow [2025-03-13 21:41:50,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=610, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2025-03-13 21:41:50,339 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 53 predicate places. [2025-03-13 21:41:50,340 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 610 flow [2025-03-13 21:41:50,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:50,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:50,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:50,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-13 21:41:50,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:50,544 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-13 21:41:50,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:50,544 INFO L85 PathProgramCache]: Analyzing trace with hash -499522596, now seen corresponding path program 8 times [2025-03-13 21:41:50,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:50,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388453061] [2025-03-13 21:41:50,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:41:50,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:50,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:41:50,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-13 21:41:50,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:41:50,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:50,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:50,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388453061] [2025-03-13 21:41:50,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388453061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:50,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:50,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:41:50,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732414086] [2025-03-13 21:41:50,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:50,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:41:50,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:50,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:41:50,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:41:50,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:50,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 610 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:50,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:50,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:50,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:51,250 INFO L124 PetriNetUnfolderBase]: 450/829 cut-off events. [2025-03-13 21:41:51,250 INFO L125 PetriNetUnfolderBase]: For 3890/3917 co-relation queries the response was YES. [2025-03-13 21:41:51,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3653 conditions, 829 events. 450/829 cut-off events. For 3890/3917 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3976 event pairs, 174 based on Foata normal form. 1/824 useless extension candidates. Maximal degree in co-relation 3611. Up to 413 conditions per place. [2025-03-13 21:41:51,254 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 59 selfloop transitions, 27 changer transitions 6/95 dead transitions. [2025-03-13 21:41:51,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 95 transitions, 1001 flow [2025-03-13 21:41:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:41:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:41:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2025-03-13 21:41:51,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43253968253968256 [2025-03-13 21:41:51,255 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 610 flow. Second operand 9 states and 109 transitions. [2025-03-13 21:41:51,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 95 transitions, 1001 flow [2025-03-13 21:41:51,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 95 transitions, 948 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-13 21:41:51,262 INFO L231 Difference]: Finished difference. Result has 86 places, 64 transitions, 723 flow [2025-03-13 21:41:51,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=723, PETRI_PLACES=86, PETRI_TRANSITIONS=64} [2025-03-13 21:41:51,262 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 60 predicate places. [2025-03-13 21:41:51,262 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 64 transitions, 723 flow [2025-03-13 21:41:51,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:51,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:51,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:51,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 21:41:51,263 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-13 21:41:51,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:51,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1388089514, now seen corresponding path program 9 times [2025-03-13 21:41:51,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:51,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843239968] [2025-03-13 21:41:51,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:41:51,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:51,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:41:51,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-13 21:41:51,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:41:51,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:51,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:51,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843239968] [2025-03-13 21:41:51,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843239968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:51,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:51,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:41:51,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485452958] [2025-03-13 21:41:51,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:51,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:41:51,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:51,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:41:51,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:41:51,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:51,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 64 transitions, 723 flow. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:51,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:51,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:51,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:51,726 INFO L124 PetriNetUnfolderBase]: 441/808 cut-off events. [2025-03-13 21:41:51,726 INFO L125 PetriNetUnfolderBase]: For 4177/4204 co-relation queries the response was YES. [2025-03-13 21:41:51,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3665 conditions, 808 events. 441/808 cut-off events. For 4177/4204 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3818 event pairs, 96 based on Foata normal form. 1/805 useless extension candidates. Maximal degree in co-relation 3619. Up to 408 conditions per place. [2025-03-13 21:41:51,731 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 55 selfloop transitions, 27 changer transitions 6/91 dead transitions. [2025-03-13 21:41:51,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 1007 flow [2025-03-13 21:41:51,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:41:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:41:51,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2025-03-13 21:41:51,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2025-03-13 21:41:51,732 INFO L175 Difference]: Start difference. First operand has 86 places, 64 transitions, 723 flow. Second operand 9 states and 106 transitions. [2025-03-13 21:41:51,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 1007 flow [2025-03-13 21:41:51,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 91 transitions, 957 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-13 21:41:51,739 INFO L231 Difference]: Finished difference. Result has 90 places, 64 transitions, 739 flow [2025-03-13 21:41:51,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=739, PETRI_PLACES=90, PETRI_TRANSITIONS=64} [2025-03-13 21:41:51,740 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 64 predicate places. [2025-03-13 21:41:51,740 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 64 transitions, 739 flow [2025-03-13 21:41:51,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:51,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:51,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:51,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 21:41:51,740 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-13 21:41:51,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2135768919, now seen corresponding path program 1 times [2025-03-13 21:41:51,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:51,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654957645] [2025-03-13 21:41:51,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:51,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:51,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:41:51,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:41:51,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:51,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:51,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:51,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654957645] [2025-03-13 21:41:51,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654957645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:51,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440998591] [2025-03-13 21:41:51,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:51,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:51,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:51,922 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-13 21:41:51,923 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-13 21:41:51,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:41:51,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:41:51,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:51,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:51,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-13 21:41:51,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:52,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:41:52,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2025-03-13 21:41:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:52,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:52,132 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-13 21:41:52,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-13 21:41:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:52,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440998591] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:52,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:41:52,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 18 [2025-03-13 21:41:52,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371312267] [2025-03-13 21:41:52,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:52,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:41:52,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:52,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:41:52,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-13 21:41:52,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:52,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 64 transitions, 739 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:52,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:52,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:52,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:52,417 INFO L124 PetriNetUnfolderBase]: 498/912 cut-off events. [2025-03-13 21:41:52,417 INFO L125 PetriNetUnfolderBase]: For 4765/4800 co-relation queries the response was YES. [2025-03-13 21:41:52,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4136 conditions, 912 events. 498/912 cut-off events. For 4765/4800 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4525 event pairs, 149 based on Foata normal form. 10/920 useless extension candidates. Maximal degree in co-relation 4089. Up to 433 conditions per place. [2025-03-13 21:41:52,421 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 84 selfloop transitions, 30 changer transitions 0/117 dead transitions. [2025-03-13 21:41:52,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 117 transitions, 1360 flow [2025-03-13 21:41:52,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:41:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:41:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2025-03-13 21:41:52,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-03-13 21:41:52,423 INFO L175 Difference]: Start difference. First operand has 90 places, 64 transitions, 739 flow. Second operand 7 states and 105 transitions. [2025-03-13 21:41:52,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 117 transitions, 1360 flow [2025-03-13 21:41:52,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 117 transitions, 1275 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-03-13 21:41:52,431 INFO L231 Difference]: Finished difference. Result has 90 places, 73 transitions, 899 flow [2025-03-13 21:41:52,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=899, PETRI_PLACES=90, PETRI_TRANSITIONS=73} [2025-03-13 21:41:52,432 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 64 predicate places. [2025-03-13 21:41:52,432 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 73 transitions, 899 flow [2025-03-13 21:41:52,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:52,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:52,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:52,439 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-13 21:41:52,637 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,SelfDestructingSolverStorable20 [2025-03-13 21:41:52,637 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-13 21:41:52,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:52,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1360628359, now seen corresponding path program 2 times [2025-03-13 21:41:52,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:52,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257501416] [2025-03-13 21:41:52,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:41:52,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:52,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:41:52,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:41:52,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:41:52,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:52,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:52,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257501416] [2025-03-13 21:41:52,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257501416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:52,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461635621] [2025-03-13 21:41:52,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:41:52,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:52,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:52,811 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-13 21:41:52,812 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-13 21:41:52,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:41:52,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:41:52,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:41:52,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:52,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-13 21:41:52,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:52,943 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:41:52,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-13 21:41:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:52,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:53,013 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-13 21:41:53,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-13 21:41:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:53,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461635621] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:41:53,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:41:53,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 16 [2025-03-13 21:41:53,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320335302] [2025-03-13 21:41:53,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:41:53,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:41:53,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:53,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:41:53,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:41:53,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:53,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 73 transitions, 899 flow. Second operand has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-13 21:41:53,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:53,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:53,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:53,354 INFO L124 PetriNetUnfolderBase]: 578/1074 cut-off events. [2025-03-13 21:41:53,354 INFO L125 PetriNetUnfolderBase]: For 5808/5834 co-relation queries the response was YES. [2025-03-13 21:41:53,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4970 conditions, 1074 events. 578/1074 cut-off events. For 5808/5834 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5579 event pairs, 202 based on Foata normal form. 10/1080 useless extension candidates. Maximal degree in co-relation 4922. Up to 446 conditions per place. [2025-03-13 21:41:53,367 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 73 selfloop transitions, 39 changer transitions 0/115 dead transitions. [2025-03-13 21:41:53,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 115 transitions, 1360 flow [2025-03-13 21:41:53,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:41:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:41:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2025-03-13 21:41:53,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2025-03-13 21:41:53,368 INFO L175 Difference]: Start difference. First operand has 90 places, 73 transitions, 899 flow. Second operand 10 states and 123 transitions. [2025-03-13 21:41:53,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 115 transitions, 1360 flow [2025-03-13 21:41:53,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 115 transitions, 1324 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 21:41:53,378 INFO L231 Difference]: Finished difference. Result has 100 places, 78 transitions, 1033 flow [2025-03-13 21:41:53,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1033, PETRI_PLACES=100, PETRI_TRANSITIONS=78} [2025-03-13 21:41:53,378 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 74 predicate places. [2025-03-13 21:41:53,378 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 78 transitions, 1033 flow [2025-03-13 21:41:53,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-13 21:41:53,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:53,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:53,385 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-13 21:41:53,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:53,579 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-13 21:41:53,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:53,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1630671351, now seen corresponding path program 3 times [2025-03-13 21:41:53,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:53,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466033577] [2025-03-13 21:41:53,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:41:53,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:53,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:41:53,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:41:53,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:41:53,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:53,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:53,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466033577] [2025-03-13 21:41:53,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466033577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:53,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:53,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:41:53,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204752929] [2025-03-13 21:41:53,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:53,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:41:53,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:53,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:41:53,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:41:53,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:53,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 78 transitions, 1033 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:53,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:53,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:53,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:53,991 INFO L124 PetriNetUnfolderBase]: 573/1062 cut-off events. [2025-03-13 21:41:53,991 INFO L125 PetriNetUnfolderBase]: For 6641/6672 co-relation queries the response was YES. [2025-03-13 21:41:53,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5091 conditions, 1062 events. 573/1062 cut-off events. For 6641/6672 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5592 event pairs, 174 based on Foata normal form. 5/1066 useless extension candidates. Maximal degree in co-relation 5038. Up to 446 conditions per place. [2025-03-13 21:41:53,996 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 76 selfloop transitions, 32 changer transitions 10/121 dead transitions. [2025-03-13 21:41:53,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 121 transitions, 1535 flow [2025-03-13 21:41:53,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:41:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:41:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2025-03-13 21:41:53,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2025-03-13 21:41:53,998 INFO L175 Difference]: Start difference. First operand has 100 places, 78 transitions, 1033 flow. Second operand 9 states and 106 transitions. [2025-03-13 21:41:53,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 121 transitions, 1535 flow [2025-03-13 21:41:54,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 121 transitions, 1468 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-13 21:41:54,011 INFO L231 Difference]: Finished difference. Result has 104 places, 76 transitions, 988 flow [2025-03-13 21:41:54,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=988, PETRI_PLACES=104, PETRI_TRANSITIONS=76} [2025-03-13 21:41:54,011 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 78 predicate places. [2025-03-13 21:41:54,011 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 76 transitions, 988 flow [2025-03-13 21:41:54,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:54,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:54,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:54,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 21:41:54,012 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-13 21:41:54,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:54,012 INFO L85 PathProgramCache]: Analyzing trace with hash 237278107, now seen corresponding path program 4 times [2025-03-13 21:41:54,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:54,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179209690] [2025-03-13 21:41:54,012 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:41:54,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:54,016 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:41:54,020 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:41:54,020 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:41:54,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:54,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:54,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179209690] [2025-03-13 21:41:54,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179209690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:54,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:54,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:41:54,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901273140] [2025-03-13 21:41:54,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:54,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:41:54,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:54,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:41:54,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:41:54,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:54,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 76 transitions, 988 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:54,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:54,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:54,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:54,271 INFO L124 PetriNetUnfolderBase]: 585/1077 cut-off events. [2025-03-13 21:41:54,271 INFO L125 PetriNetUnfolderBase]: For 7237/7267 co-relation queries the response was YES. [2025-03-13 21:41:54,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5248 conditions, 1077 events. 585/1077 cut-off events. For 7237/7267 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5560 event pairs, 242 based on Foata normal form. 10/1080 useless extension candidates. Maximal degree in co-relation 5195. Up to 467 conditions per place. [2025-03-13 21:41:54,277 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 67 selfloop transitions, 39 changer transitions 0/109 dead transitions. [2025-03-13 21:41:54,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 109 transitions, 1428 flow [2025-03-13 21:41:54,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:41:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:41:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-03-13 21:41:54,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-03-13 21:41:54,278 INFO L175 Difference]: Start difference. First operand has 104 places, 76 transitions, 988 flow. Second operand 7 states and 100 transitions. [2025-03-13 21:41:54,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 109 transitions, 1428 flow [2025-03-13 21:41:54,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 109 transitions, 1343 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-03-13 21:41:54,289 INFO L231 Difference]: Finished difference. Result has 103 places, 82 transitions, 1117 flow [2025-03-13 21:41:54,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1117, PETRI_PLACES=103, PETRI_TRANSITIONS=82} [2025-03-13 21:41:54,289 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 77 predicate places. [2025-03-13 21:41:54,289 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 82 transitions, 1117 flow [2025-03-13 21:41:54,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:54,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:54,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:54,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 21:41:54,289 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-13 21:41:54,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:54,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1169446033, now seen corresponding path program 1 times [2025-03-13 21:41:54,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:54,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830653182] [2025-03-13 21:41:54,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:54,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:54,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:41:54,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:41:54,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:54,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:54,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:54,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:54,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830653182] [2025-03-13 21:41:54,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830653182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:54,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034690169] [2025-03-13 21:41:54,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:54,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:54,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:54,449 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-13 21:41:54,451 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-13 21:41:54,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:41:54,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:41:54,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:54,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:54,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-13 21:41:54,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:54,659 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-13 21:41:54,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-13 21:41:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:54,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:54,808 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-13 21:41:54,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-13 21:41:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:54,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034690169] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:41:54,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:41:54,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2025-03-13 21:41:54,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23818251] [2025-03-13 21:41:54,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:41:54,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-13 21:41:54,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:54,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-13 21:41:54,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-13 21:41:54,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:54,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 82 transitions, 1117 flow. Second operand has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 17 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-13 21:41:54,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:54,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:54,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:55,205 INFO L124 PetriNetUnfolderBase]: 619/1146 cut-off events. [2025-03-13 21:41:55,206 INFO L125 PetriNetUnfolderBase]: For 6878/6904 co-relation queries the response was YES. [2025-03-13 21:41:55,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5598 conditions, 1146 events. 619/1146 cut-off events. For 6878/6904 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6107 event pairs, 114 based on Foata normal form. 12/1157 useless extension candidates. Maximal degree in co-relation 5545. Up to 424 conditions per place. [2025-03-13 21:41:55,212 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 91 selfloop transitions, 40 changer transitions 0/134 dead transitions. [2025-03-13 21:41:55,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 134 transitions, 1730 flow [2025-03-13 21:41:55,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:41:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:41:55,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2025-03-13 21:41:55,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-03-13 21:41:55,213 INFO L175 Difference]: Start difference. First operand has 103 places, 82 transitions, 1117 flow. Second operand 10 states and 119 transitions. [2025-03-13 21:41:55,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 134 transitions, 1730 flow [2025-03-13 21:41:55,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 134 transitions, 1653 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-13 21:41:55,226 INFO L231 Difference]: Finished difference. Result has 111 places, 84 transitions, 1157 flow [2025-03-13 21:41:55,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1157, PETRI_PLACES=111, PETRI_TRANSITIONS=84} [2025-03-13 21:41:55,227 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 85 predicate places. [2025-03-13 21:41:55,227 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 84 transitions, 1157 flow [2025-03-13 21:41:55,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 17 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-13 21:41:55,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:55,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:55,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-13 21:41:55,427 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,SelfDestructingSolverStorable24 [2025-03-13 21:41:55,428 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-13 21:41:55,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:55,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1943206035, now seen corresponding path program 5 times [2025-03-13 21:41:55,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:55,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088954613] [2025-03-13 21:41:55,428 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:41:55,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:55,432 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:41:55,438 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:41:55,439 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:41:55,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:55,610 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-13 21:41:55,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:55,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088954613] [2025-03-13 21:41:55,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088954613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:55,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695784857] [2025-03-13 21:41:55,611 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:41:55,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:55,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:55,613 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-13 21:41:55,615 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-13 21:41:55,658 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:41:55,675 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:41:55,675 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:41:55,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:55,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-13 21:41:55,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:55,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:41:55,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2025-03-13 21:41:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:55,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:55,780 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-13 21:41:55,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-13 21:41:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:55,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695784857] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:55,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:41:55,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2025-03-13 21:41:55,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388997946] [2025-03-13 21:41:55,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:55,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:41:55,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:55,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:41:55,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:41:55,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:55,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 84 transitions, 1157 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:55,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:55,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:55,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:56,039 INFO L124 PetriNetUnfolderBase]: 639/1195 cut-off events. [2025-03-13 21:41:56,040 INFO L125 PetriNetUnfolderBase]: For 7762/7795 co-relation queries the response was YES. [2025-03-13 21:41:56,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5851 conditions, 1195 events. 639/1195 cut-off events. For 7762/7795 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6505 event pairs, 227 based on Foata normal form. 10/1198 useless extension candidates. Maximal degree in co-relation 5794. Up to 523 conditions per place. [2025-03-13 21:41:56,046 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 81 selfloop transitions, 39 changer transitions 0/123 dead transitions. [2025-03-13 21:41:56,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 123 transitions, 1638 flow [2025-03-13 21:41:56,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:41:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:41:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2025-03-13 21:41:56,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5561224489795918 [2025-03-13 21:41:56,046 INFO L175 Difference]: Start difference. First operand has 111 places, 84 transitions, 1157 flow. Second operand 7 states and 109 transitions. [2025-03-13 21:41:56,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 123 transitions, 1638 flow [2025-03-13 21:41:56,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 123 transitions, 1540 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-13 21:41:56,059 INFO L231 Difference]: Finished difference. Result has 114 places, 89 transitions, 1274 flow [2025-03-13 21:41:56,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1274, PETRI_PLACES=114, PETRI_TRANSITIONS=89} [2025-03-13 21:41:56,059 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 88 predicate places. [2025-03-13 21:41:56,060 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 89 transitions, 1274 flow [2025-03-13 21:41:56,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:56,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:56,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:56,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-13 21:41:56,263 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,SelfDestructingSolverStorable25 [2025-03-13 21:41:56,263 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-13 21:41:56,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:56,264 INFO L85 PathProgramCache]: Analyzing trace with hash 262668121, now seen corresponding path program 2 times [2025-03-13 21:41:56,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:56,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611722464] [2025-03-13 21:41:56,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:41:56,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:56,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:41:56,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-13 21:41:56,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:41:56,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:56,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:56,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611722464] [2025-03-13 21:41:56,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611722464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:56,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:56,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:41:56,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614521190] [2025-03-13 21:41:56,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:56,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:41:56,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:56,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:41:56,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:41:56,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:56,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 89 transitions, 1274 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:56,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:56,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:56,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:56,701 INFO L124 PetriNetUnfolderBase]: 724/1362 cut-off events. [2025-03-13 21:41:56,702 INFO L125 PetriNetUnfolderBase]: For 7870/7901 co-relation queries the response was YES. [2025-03-13 21:41:56,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6581 conditions, 1362 events. 724/1362 cut-off events. For 7870/7901 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7732 event pairs, 249 based on Foata normal form. 12/1370 useless extension candidates. Maximal degree in co-relation 6523. Up to 532 conditions per place. [2025-03-13 21:41:56,708 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 91 selfloop transitions, 43 changer transitions 0/137 dead transitions. [2025-03-13 21:41:56,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 137 transitions, 1849 flow [2025-03-13 21:41:56,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:41:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:41:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2025-03-13 21:41:56,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-13 21:41:56,709 INFO L175 Difference]: Start difference. First operand has 114 places, 89 transitions, 1274 flow. Second operand 9 states and 117 transitions. [2025-03-13 21:41:56,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 137 transitions, 1849 flow [2025-03-13 21:41:56,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 137 transitions, 1756 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-03-13 21:41:56,722 INFO L231 Difference]: Finished difference. Result has 120 places, 93 transitions, 1337 flow [2025-03-13 21:41:56,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1337, PETRI_PLACES=120, PETRI_TRANSITIONS=93} [2025-03-13 21:41:56,722 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 94 predicate places. [2025-03-13 21:41:56,723 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 93 transitions, 1337 flow [2025-03-13 21:41:56,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:56,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:56,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:56,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-13 21:41:56,724 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:41:56,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:56,724 INFO L85 PathProgramCache]: Analyzing trace with hash -738099883, now seen corresponding path program 3 times [2025-03-13 21:41:56,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:56,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586345190] [2025-03-13 21:41:56,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:41:56,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:56,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:41:56,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-13 21:41:56,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:41:56,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:56,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:56,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586345190] [2025-03-13 21:41:56,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586345190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:56,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:56,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:41:56,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225573034] [2025-03-13 21:41:56,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:56,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:41:56,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:56,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:41:56,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:41:56,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:56,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 93 transitions, 1337 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:56,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:56,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:56,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:57,114 INFO L124 PetriNetUnfolderBase]: 720/1351 cut-off events. [2025-03-13 21:41:57,114 INFO L125 PetriNetUnfolderBase]: For 7951/7988 co-relation queries the response was YES. [2025-03-13 21:41:57,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6633 conditions, 1351 events. 720/1351 cut-off events. For 7951/7988 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7615 event pairs, 307 based on Foata normal form. 4/1351 useless extension candidates. Maximal degree in co-relation 6573. Up to 661 conditions per place. [2025-03-13 21:41:57,122 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 76 selfloop transitions, 41 changer transitions 3/123 dead transitions. [2025-03-13 21:41:57,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 123 transitions, 1760 flow [2025-03-13 21:41:57,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:41:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:41:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2025-03-13 21:41:57,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-03-13 21:41:57,123 INFO L175 Difference]: Start difference. First operand has 120 places, 93 transitions, 1337 flow. Second operand 9 states and 102 transitions. [2025-03-13 21:41:57,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 123 transitions, 1760 flow [2025-03-13 21:41:57,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 123 transitions, 1691 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-03-13 21:41:57,139 INFO L231 Difference]: Finished difference. Result has 125 places, 93 transitions, 1343 flow [2025-03-13 21:41:57,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1343, PETRI_PLACES=125, PETRI_TRANSITIONS=93} [2025-03-13 21:41:57,139 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 99 predicate places. [2025-03-13 21:41:57,139 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 93 transitions, 1343 flow [2025-03-13 21:41:57,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:57,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:57,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:57,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-13 21:41:57,140 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:41:57,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:57,140 INFO L85 PathProgramCache]: Analyzing trace with hash 160477153, now seen corresponding path program 4 times [2025-03-13 21:41:57,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:57,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116980115] [2025-03-13 21:41:57,140 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:41:57,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:57,145 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:41:57,148 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:41:57,148 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:41:57,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:57,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:57,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116980115] [2025-03-13 21:41:57,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116980115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:57,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:57,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:41:57,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038889139] [2025-03-13 21:41:57,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:57,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:41:57,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:57,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:41:57,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:41:57,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:57,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 93 transitions, 1343 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:57,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:57,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:57,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:57,428 INFO L124 PetriNetUnfolderBase]: 684/1282 cut-off events. [2025-03-13 21:41:57,428 INFO L125 PetriNetUnfolderBase]: For 7650/7683 co-relation queries the response was YES. [2025-03-13 21:41:57,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6402 conditions, 1282 events. 684/1282 cut-off events. For 7650/7683 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7120 event pairs, 269 based on Foata normal form. 12/1291 useless extension candidates. Maximal degree in co-relation 6341. Up to 587 conditions per place. [2025-03-13 21:41:57,434 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 83 selfloop transitions, 40 changer transitions 0/126 dead transitions. [2025-03-13 21:41:57,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 126 transitions, 1782 flow [2025-03-13 21:41:57,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:41:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:41:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2025-03-13 21:41:57,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2025-03-13 21:41:57,436 INFO L175 Difference]: Start difference. First operand has 125 places, 93 transitions, 1343 flow. Second operand 7 states and 96 transitions. [2025-03-13 21:41:57,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 126 transitions, 1782 flow [2025-03-13 21:41:57,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 126 transitions, 1688 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-13 21:41:57,450 INFO L231 Difference]: Finished difference. Result has 125 places, 93 transitions, 1333 flow [2025-03-13 21:41:57,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1249, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1333, PETRI_PLACES=125, PETRI_TRANSITIONS=93} [2025-03-13 21:41:57,450 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 99 predicate places. [2025-03-13 21:41:57,450 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 93 transitions, 1333 flow [2025-03-13 21:41:57,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:57,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:57,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:57,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-13 21:41:57,451 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:41:57,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:57,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1436471035, now seen corresponding path program 6 times [2025-03-13 21:41:57,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:57,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422425591] [2025-03-13 21:41:57,451 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:41:57,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:57,456 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:41:57,459 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-13 21:41:57,460 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:41:57,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:57,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:57,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422425591] [2025-03-13 21:41:57,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422425591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:57,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:57,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:41:57,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815536109] [2025-03-13 21:41:57,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:57,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:41:57,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:57,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:41:57,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:41:57,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:57,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 93 transitions, 1333 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:57,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:57,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:57,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:57,820 INFO L124 PetriNetUnfolderBase]: 684/1284 cut-off events. [2025-03-13 21:41:57,820 INFO L125 PetriNetUnfolderBase]: For 7208/7243 co-relation queries the response was YES. [2025-03-13 21:41:57,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6411 conditions, 1284 events. 684/1284 cut-off events. For 7208/7243 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7220 event pairs, 257 based on Foata normal form. 5/1284 useless extension candidates. Maximal degree in co-relation 6350. Up to 599 conditions per place. [2025-03-13 21:41:57,827 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 76 selfloop transitions, 40 changer transitions 4/123 dead transitions. [2025-03-13 21:41:57,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 123 transitions, 1748 flow [2025-03-13 21:41:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:41:57,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:41:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2025-03-13 21:41:57,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-03-13 21:41:57,828 INFO L175 Difference]: Start difference. First operand has 125 places, 93 transitions, 1333 flow. Second operand 9 states and 102 transitions. [2025-03-13 21:41:57,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 123 transitions, 1748 flow [2025-03-13 21:41:57,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 123 transitions, 1670 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:41:57,843 INFO L231 Difference]: Finished difference. Result has 129 places, 92 transitions, 1326 flow [2025-03-13 21:41:57,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1326, PETRI_PLACES=129, PETRI_TRANSITIONS=92} [2025-03-13 21:41:57,843 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 103 predicate places. [2025-03-13 21:41:57,843 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 92 transitions, 1326 flow [2025-03-13 21:41:57,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:57,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:57,843 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:57,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-13 21:41:57,844 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:41:57,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:57,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1402871807, now seen corresponding path program 7 times [2025-03-13 21:41:57,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:57,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956439237] [2025-03-13 21:41:57,844 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:41:57,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:57,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:41:57,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:41:57,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:57,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:41:58,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:58,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956439237] [2025-03-13 21:41:58,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956439237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:58,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:58,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:41:58,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745821606] [2025-03-13 21:41:58,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:58,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:41:58,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:58,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:41:58,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:41:58,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:41:58,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 92 transitions, 1326 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:58,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:58,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:41:58,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:58,339 INFO L124 PetriNetUnfolderBase]: 652/1214 cut-off events. [2025-03-13 21:41:58,339 INFO L125 PetriNetUnfolderBase]: For 7210/7241 co-relation queries the response was YES. [2025-03-13 21:41:58,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6154 conditions, 1214 events. 652/1214 cut-off events. For 7210/7241 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6624 event pairs, 259 based on Foata normal form. 5/1214 useless extension candidates. Maximal degree in co-relation 6105. Up to 599 conditions per place. [2025-03-13 21:41:58,346 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 74 selfloop transitions, 38 changer transitions 8/123 dead transitions. [2025-03-13 21:41:58,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 123 transitions, 1720 flow [2025-03-13 21:41:58,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:41:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:41:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2025-03-13 21:41:58,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4087301587301587 [2025-03-13 21:41:58,347 INFO L175 Difference]: Start difference. First operand has 129 places, 92 transitions, 1326 flow. Second operand 9 states and 103 transitions. [2025-03-13 21:41:58,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 123 transitions, 1720 flow [2025-03-13 21:41:58,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 123 transitions, 1636 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 21:41:58,367 INFO L231 Difference]: Finished difference. Result has 128 places, 89 transitions, 1265 flow [2025-03-13 21:41:58,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1265, PETRI_PLACES=128, PETRI_TRANSITIONS=89} [2025-03-13 21:41:58,367 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 102 predicate places. [2025-03-13 21:41:58,367 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 89 transitions, 1265 flow [2025-03-13 21:41:58,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:58,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:58,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:58,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-13 21:41:58,368 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:41:58,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:58,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1427274783, now seen corresponding path program 5 times [2025-03-13 21:41:58,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:58,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968774654] [2025-03-13 21:41:58,368 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:41:58,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:58,375 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:41:58,382 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:41:58,382 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:41:58,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:58,524 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-13 21:41:58,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:58,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968774654] [2025-03-13 21:41:58,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968774654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:58,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804434272] [2025-03-13 21:41:58,524 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:41:58,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:58,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:58,526 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-13 21:41:58,528 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-13 21:41:58,575 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:41:58,595 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:41:58,595 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:41:58,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:58,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-13 21:41:58,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:58,765 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-13 21:41:58,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2025-03-13 21:41:58,787 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-13 21:41:58,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:58,886 INFO L349 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-03-13 21:41:58,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 77 [2025-03-13 21:41:59,066 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-13 21:41:59,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804434272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:41:59,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:41:59,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 27 [2025-03-13 21:41:59,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154413721] [2025-03-13 21:41:59,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:41:59,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-13 21:41:59,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:59,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-13 21:41:59,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2025-03-13 21:41:59,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-13 21:41:59,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 89 transitions, 1265 flow. Second operand has 27 states, 27 states have (on average 6.185185185185185) internal successors, (167), 27 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-13 21:41:59,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:59,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-13 21:41:59,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:00,823 INFO L124 PetriNetUnfolderBase]: 2911/5237 cut-off events. [2025-03-13 21:42:00,823 INFO L125 PetriNetUnfolderBase]: For 27758/27839 co-relation queries the response was YES. [2025-03-13 21:42:00,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24783 conditions, 5237 events. 2911/5237 cut-off events. For 27758/27839 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 36685 event pairs, 429 based on Foata normal form. 122/5345 useless extension candidates. Maximal degree in co-relation 24734. Up to 939 conditions per place. [2025-03-13 21:42:00,848 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 311 selfloop transitions, 229 changer transitions 13/555 dead transitions. [2025-03-13 21:42:00,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 555 transitions, 6731 flow [2025-03-13 21:42:00,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-13 21:42:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-13 21:42:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 529 transitions. [2025-03-13 21:42:00,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44982993197278914 [2025-03-13 21:42:00,849 INFO L175 Difference]: Start difference. First operand has 128 places, 89 transitions, 1265 flow. Second operand 42 states and 529 transitions. [2025-03-13 21:42:00,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 555 transitions, 6731 flow [2025-03-13 21:42:00,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 555 transitions, 6469 flow, removed 3 selfloop flow, removed 9 redundant places. [2025-03-13 21:42:00,908 INFO L231 Difference]: Finished difference. Result has 184 places, 300 transitions, 4744 flow [2025-03-13 21:42:00,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=4744, PETRI_PLACES=184, PETRI_TRANSITIONS=300} [2025-03-13 21:42:00,909 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 158 predicate places. [2025-03-13 21:42:00,909 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 300 transitions, 4744 flow [2025-03-13 21:42:00,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.185185185185185) internal successors, (167), 27 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-13 21:42:00,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:00,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:00,914 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-13 21:42:01,109 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,SelfDestructingSolverStorable31 [2025-03-13 21:42:01,109 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:01,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:01,110 INFO L85 PathProgramCache]: Analyzing trace with hash -42411219, now seen corresponding path program 8 times [2025-03-13 21:42:01,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:01,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133215435] [2025-03-13 21:42:01,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:01,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:01,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:01,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-13 21:42:01,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:42:01,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:01,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:01,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:01,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133215435] [2025-03-13 21:42:01,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133215435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:01,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:01,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:42:01,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497250308] [2025-03-13 21:42:01,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:01,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:01,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:01,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:01,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:01,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:01,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 300 transitions, 4744 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:01,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:01,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:01,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:01,934 INFO L124 PetriNetUnfolderBase]: 2573/4691 cut-off events. [2025-03-13 21:42:01,934 INFO L125 PetriNetUnfolderBase]: For 56039/56234 co-relation queries the response was YES. [2025-03-13 21:42:01,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28793 conditions, 4691 events. 2573/4691 cut-off events. For 56039/56234 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 32807 event pairs, 1139 based on Foata normal form. 33/4668 useless extension candidates. Maximal degree in co-relation 28720. Up to 3018 conditions per place. [2025-03-13 21:42:01,965 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 207 selfloop transitions, 106 changer transitions 6/324 dead transitions. [2025-03-13 21:42:01,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 324 transitions, 5510 flow [2025-03-13 21:42:01,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2025-03-13 21:42:01,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2025-03-13 21:42:01,966 INFO L175 Difference]: Start difference. First operand has 184 places, 300 transitions, 4744 flow. Second operand 9 states and 107 transitions. [2025-03-13 21:42:01,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 324 transitions, 5510 flow [2025-03-13 21:42:02,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 324 transitions, 5350 flow, removed 77 selfloop flow, removed 2 redundant places. [2025-03-13 21:42:02,116 INFO L231 Difference]: Finished difference. Result has 190 places, 294 transitions, 4678 flow [2025-03-13 21:42:02,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4516, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4678, PETRI_PLACES=190, PETRI_TRANSITIONS=294} [2025-03-13 21:42:02,117 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 164 predicate places. [2025-03-13 21:42:02,117 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 294 transitions, 4678 flow [2025-03-13 21:42:02,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:02,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:02,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:02,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-13 21:42:02,117 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:02,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:02,118 INFO L85 PathProgramCache]: Analyzing trace with hash 432425735, now seen corresponding path program 9 times [2025-03-13 21:42:02,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:02,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538970929] [2025-03-13 21:42:02,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:42:02,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:02,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:02,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:02,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:42:02,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:02,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:02,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538970929] [2025-03-13 21:42:02,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538970929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:02,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:02,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:42:02,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132652436] [2025-03-13 21:42:02,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:02,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:02,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:02,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:02,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:02,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:02,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 294 transitions, 4678 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:02,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:02,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:02,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:02,835 INFO L124 PetriNetUnfolderBase]: 2567/4685 cut-off events. [2025-03-13 21:42:02,835 INFO L125 PetriNetUnfolderBase]: For 56662/56839 co-relation queries the response was YES. [2025-03-13 21:42:02,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28684 conditions, 4685 events. 2567/4685 cut-off events. For 56662/56839 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 32745 event pairs, 1133 based on Foata normal form. 33/4664 useless extension candidates. Maximal degree in co-relation 28610. Up to 3018 conditions per place. [2025-03-13 21:42:02,870 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 200 selfloop transitions, 109 changer transitions 4/318 dead transitions. [2025-03-13 21:42:02,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 318 transitions, 5457 flow [2025-03-13 21:42:02,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2025-03-13 21:42:02,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-13 21:42:02,871 INFO L175 Difference]: Start difference. First operand has 190 places, 294 transitions, 4678 flow. Second operand 9 states and 105 transitions. [2025-03-13 21:42:02,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 318 transitions, 5457 flow [2025-03-13 21:42:03,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 318 transitions, 5239 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-03-13 21:42:03,064 INFO L231 Difference]: Finished difference. Result has 190 places, 294 transitions, 4688 flow [2025-03-13 21:42:03,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4462, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4688, PETRI_PLACES=190, PETRI_TRANSITIONS=294} [2025-03-13 21:42:03,064 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 164 predicate places. [2025-03-13 21:42:03,065 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 294 transitions, 4688 flow [2025-03-13 21:42:03,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:03,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:03,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:03,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-13 21:42:03,065 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:03,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:03,065 INFO L85 PathProgramCache]: Analyzing trace with hash 839851105, now seen corresponding path program 6 times [2025-03-13 21:42:03,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:03,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056483170] [2025-03-13 21:42:03,065 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:42:03,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:03,069 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:03,072 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-13 21:42:03,072 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:42:03,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:03,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:03,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:03,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056483170] [2025-03-13 21:42:03,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056483170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:03,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:03,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:42:03,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783124547] [2025-03-13 21:42:03,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:03,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:03,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:03,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:03,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:03,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:03,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 294 transitions, 4688 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:03,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:03,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:03,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:03,985 INFO L124 PetriNetUnfolderBase]: 2552/4663 cut-off events. [2025-03-13 21:42:03,986 INFO L125 PetriNetUnfolderBase]: For 55127/55310 co-relation queries the response was YES. [2025-03-13 21:42:04,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28434 conditions, 4663 events. 2552/4663 cut-off events. For 55127/55310 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 32678 event pairs, 1103 based on Foata normal form. 30/4641 useless extension candidates. Maximal degree in co-relation 28360. Up to 3018 conditions per place. [2025-03-13 21:42:04,030 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 198 selfloop transitions, 110 changer transitions 6/319 dead transitions. [2025-03-13 21:42:04,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 319 transitions, 5515 flow [2025-03-13 21:42:04,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2025-03-13 21:42:04,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2025-03-13 21:42:04,031 INFO L175 Difference]: Start difference. First operand has 190 places, 294 transitions, 4688 flow. Second operand 9 states and 106 transitions. [2025-03-13 21:42:04,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 319 transitions, 5515 flow [2025-03-13 21:42:04,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 319 transitions, 5282 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-13 21:42:04,191 INFO L231 Difference]: Finished difference. Result has 190 places, 293 transitions, 4657 flow [2025-03-13 21:42:04,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4461, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4657, PETRI_PLACES=190, PETRI_TRANSITIONS=293} [2025-03-13 21:42:04,192 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 164 predicate places. [2025-03-13 21:42:04,192 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 293 transitions, 4657 flow [2025-03-13 21:42:04,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:04,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:04,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:04,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-13 21:42:04,192 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:04,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:04,194 INFO L85 PathProgramCache]: Analyzing trace with hash 970281313, now seen corresponding path program 10 times [2025-03-13 21:42:04,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:04,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191236235] [2025-03-13 21:42:04,194 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:42:04,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:04,199 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:04,204 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:04,204 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:42:04,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:04,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:04,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191236235] [2025-03-13 21:42:04,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191236235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:04,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:04,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:42:04,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757861337] [2025-03-13 21:42:04,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:04,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:42:04,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:04,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:42:04,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:42:04,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:04,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 293 transitions, 4657 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:04,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:04,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:04,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:04,842 INFO L124 PetriNetUnfolderBase]: 2450/4435 cut-off events. [2025-03-13 21:42:04,842 INFO L125 PetriNetUnfolderBase]: For 52937/53117 co-relation queries the response was YES. [2025-03-13 21:42:04,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27296 conditions, 4435 events. 2450/4435 cut-off events. For 52937/53117 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 30410 event pairs, 1067 based on Foata normal form. 33/4422 useless extension candidates. Maximal degree in co-relation 27222. Up to 3031 conditions per place. [2025-03-13 21:42:04,871 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 200 selfloop transitions, 100 changer transitions 6/311 dead transitions. [2025-03-13 21:42:04,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 311 transitions, 5318 flow [2025-03-13 21:42:04,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:42:04,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:42:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2025-03-13 21:42:04,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4744897959183674 [2025-03-13 21:42:04,872 INFO L175 Difference]: Start difference. First operand has 190 places, 293 transitions, 4657 flow. Second operand 7 states and 93 transitions. [2025-03-13 21:42:04,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 311 transitions, 5318 flow [2025-03-13 21:42:05,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 311 transitions, 5036 flow, removed 11 selfloop flow, removed 11 redundant places. [2025-03-13 21:42:05,016 INFO L231 Difference]: Finished difference. Result has 184 places, 287 transitions, 4457 flow [2025-03-13 21:42:05,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4292, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4457, PETRI_PLACES=184, PETRI_TRANSITIONS=287} [2025-03-13 21:42:05,016 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 158 predicate places. [2025-03-13 21:42:05,017 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 287 transitions, 4457 flow [2025-03-13 21:42:05,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:05,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:05,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:05,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-13 21:42:05,017 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:05,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:05,018 INFO L85 PathProgramCache]: Analyzing trace with hash -488846315, now seen corresponding path program 7 times [2025-03-13 21:42:05,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:05,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2977959] [2025-03-13 21:42:05,018 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:42:05,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:05,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:42:05,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:05,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:05,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:05,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:05,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:05,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2977959] [2025-03-13 21:42:05,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2977959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:05,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:05,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:42:05,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723168877] [2025-03-13 21:42:05,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:05,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:05,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:05,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:05,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:05,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:05,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 287 transitions, 4457 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:05,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:05,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:05,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:05,873 INFO L124 PetriNetUnfolderBase]: 2432/4402 cut-off events. [2025-03-13 21:42:05,873 INFO L125 PetriNetUnfolderBase]: For 51818/51998 co-relation queries the response was YES. [2025-03-13 21:42:05,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26934 conditions, 4402 events. 2432/4402 cut-off events. For 51818/51998 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 30131 event pairs, 1073 based on Foata normal form. 30/4386 useless extension candidates. Maximal degree in co-relation 26863. Up to 3006 conditions per place. [2025-03-13 21:42:05,910 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 197 selfloop transitions, 98 changer transitions 3/303 dead transitions. [2025-03-13 21:42:05,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 303 transitions, 5107 flow [2025-03-13 21:42:05,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:05,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2025-03-13 21:42:05,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-13 21:42:05,911 INFO L175 Difference]: Start difference. First operand has 184 places, 287 transitions, 4457 flow. Second operand 9 states and 99 transitions. [2025-03-13 21:42:05,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 303 transitions, 5107 flow [2025-03-13 21:42:06,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 303 transitions, 4906 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-13 21:42:06,074 INFO L231 Difference]: Finished difference. Result has 184 places, 283 transitions, 4365 flow [2025-03-13 21:42:06,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4183, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4365, PETRI_PLACES=184, PETRI_TRANSITIONS=283} [2025-03-13 21:42:06,075 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 158 predicate places. [2025-03-13 21:42:06,075 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 283 transitions, 4365 flow [2025-03-13 21:42:06,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:06,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:06,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:06,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-13 21:42:06,075 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:06,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:06,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2007885113, now seen corresponding path program 8 times [2025-03-13 21:42:06,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:06,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921644709] [2025-03-13 21:42:06,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:06,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:06,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:06,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:06,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:06,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:06,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:06,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921644709] [2025-03-13 21:42:06,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921644709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:06,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:06,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:42:06,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100469145] [2025-03-13 21:42:06,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:06,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:06,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:06,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:06,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:06,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:06,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 283 transitions, 4365 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:06,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:06,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:06,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:06,922 INFO L124 PetriNetUnfolderBase]: 2427/4405 cut-off events. [2025-03-13 21:42:06,923 INFO L125 PetriNetUnfolderBase]: For 51064/51225 co-relation queries the response was YES. [2025-03-13 21:42:06,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26802 conditions, 4405 events. 2427/4405 cut-off events. For 51064/51225 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 30150 event pairs, 1082 based on Foata normal form. 30/4389 useless extension candidates. Maximal degree in co-relation 26732. Up to 3017 conditions per place. [2025-03-13 21:42:06,947 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 195 selfloop transitions, 91 changer transitions 8/299 dead transitions. [2025-03-13 21:42:06,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 299 transitions, 5013 flow [2025-03-13 21:42:06,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2025-03-13 21:42:06,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38492063492063494 [2025-03-13 21:42:06,948 INFO L175 Difference]: Start difference. First operand has 184 places, 283 transitions, 4365 flow. Second operand 9 states and 97 transitions. [2025-03-13 21:42:06,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 299 transitions, 5013 flow [2025-03-13 21:42:07,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 299 transitions, 4819 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-03-13 21:42:07,070 INFO L231 Difference]: Finished difference. Result has 184 places, 276 transitions, 4217 flow [2025-03-13 21:42:07,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4104, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4217, PETRI_PLACES=184, PETRI_TRANSITIONS=276} [2025-03-13 21:42:07,070 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 158 predicate places. [2025-03-13 21:42:07,070 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 276 transitions, 4217 flow [2025-03-13 21:42:07,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:07,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:07,070 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:07,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-13 21:42:07,070 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:07,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:07,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1284943717, now seen corresponding path program 11 times [2025-03-13 21:42:07,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:07,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035843196] [2025-03-13 21:42:07,071 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:42:07,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:07,076 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:07,080 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:07,081 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:07,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:07,300 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-13 21:42:07,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:07,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035843196] [2025-03-13 21:42:07,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035843196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:07,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031048797] [2025-03-13 21:42:07,300 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:42:07,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:07,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:07,304 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-13 21:42:07,305 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-13 21:42:07,355 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:07,374 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:07,374 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:07,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:07,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-13 21:42:07,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:07,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:42:07,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2025-03-13 21:42:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:07,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:07,503 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-13 21:42:07,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-13 21:42:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:07,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031048797] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:07,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:42:07,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2025-03-13 21:42:07,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425987019] [2025-03-13 21:42:07,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:07,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:42:07,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:07,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:42:07,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:42:07,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:07,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 276 transitions, 4217 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:07,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:07,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:07,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:08,073 INFO L124 PetriNetUnfolderBase]: 2579/4724 cut-off events. [2025-03-13 21:42:08,073 INFO L125 PetriNetUnfolderBase]: For 54359/54481 co-relation queries the response was YES. [2025-03-13 21:42:08,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28475 conditions, 4724 events. 2579/4724 cut-off events. For 54359/54481 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 32937 event pairs, 975 based on Foata normal form. 40/4738 useless extension candidates. Maximal degree in co-relation 28405. Up to 2508 conditions per place. [2025-03-13 21:42:08,104 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 214 selfloop transitions, 120 changer transitions 0/339 dead transitions. [2025-03-13 21:42:08,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 339 transitions, 5520 flow [2025-03-13 21:42:08,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:42:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:42:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2025-03-13 21:42:08,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2025-03-13 21:42:08,105 INFO L175 Difference]: Start difference. First operand has 184 places, 276 transitions, 4217 flow. Second operand 7 states and 103 transitions. [2025-03-13 21:42:08,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 339 transitions, 5520 flow [2025-03-13 21:42:08,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 339 transitions, 5280 flow, removed 3 selfloop flow, removed 9 redundant places. [2025-03-13 21:42:08,261 INFO L231 Difference]: Finished difference. Result has 181 places, 289 transitions, 4528 flow [2025-03-13 21:42:08,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3989, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4528, PETRI_PLACES=181, PETRI_TRANSITIONS=289} [2025-03-13 21:42:08,262 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 155 predicate places. [2025-03-13 21:42:08,262 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 289 transitions, 4528 flow [2025-03-13 21:42:08,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:08,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:08,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:08,267 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-13 21:42:08,462 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,SelfDestructingSolverStorable38 [2025-03-13 21:42:08,463 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:08,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:08,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1174285997, now seen corresponding path program 12 times [2025-03-13 21:42:08,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:08,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238162707] [2025-03-13 21:42:08,463 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:42:08,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:08,467 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:08,472 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:08,472 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:42:08,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:08,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:08,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238162707] [2025-03-13 21:42:08,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238162707] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:08,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317170934] [2025-03-13 21:42:08,619 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:42:08,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:08,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:08,622 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-13 21:42:08,622 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-13 21:42:08,673 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:08,687 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:08,687 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:42:08,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:08,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-13 21:42:08,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:08,746 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:42:08,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-13 21:42:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:08,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:08,814 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-13 21:42:08,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-13 21:42:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:08,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317170934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:08,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:08,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 16 [2025-03-13 21:42:08,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641750863] [2025-03-13 21:42:08,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:08,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:42:08,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:08,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:42:08,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:42:08,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:08,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 289 transitions, 4528 flow. Second operand has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-13 21:42:08,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:08,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:08,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:09,519 INFO L124 PetriNetUnfolderBase]: 2818/5165 cut-off events. [2025-03-13 21:42:09,519 INFO L125 PetriNetUnfolderBase]: For 63383/63538 co-relation queries the response was YES. [2025-03-13 21:42:09,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31977 conditions, 5165 events. 2818/5165 cut-off events. For 63383/63538 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 36822 event pairs, 1027 based on Foata normal form. 48/5187 useless extension candidates. Maximal degree in co-relation 31905. Up to 2527 conditions per place. [2025-03-13 21:42:09,559 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 215 selfloop transitions, 135 changer transitions 0/355 dead transitions. [2025-03-13 21:42:09,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 355 transitions, 5945 flow [2025-03-13 21:42:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:42:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:42:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2025-03-13 21:42:09,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2025-03-13 21:42:09,560 INFO L175 Difference]: Start difference. First operand has 181 places, 289 transitions, 4528 flow. Second operand 10 states and 123 transitions. [2025-03-13 21:42:09,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 355 transitions, 5945 flow [2025-03-13 21:42:09,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 355 transitions, 5718 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-03-13 21:42:09,756 INFO L231 Difference]: Finished difference. Result has 191 places, 300 transitions, 4884 flow [2025-03-13 21:42:09,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4310, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4884, PETRI_PLACES=191, PETRI_TRANSITIONS=300} [2025-03-13 21:42:09,757 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 165 predicate places. [2025-03-13 21:42:09,757 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 300 transitions, 4884 flow [2025-03-13 21:42:09,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-13 21:42:09,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:09,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:09,763 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-13 21:42:09,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:09,958 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:09,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:09,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1349084739, now seen corresponding path program 13 times [2025-03-13 21:42:09,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:09,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090376663] [2025-03-13 21:42:09,958 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:42:09,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:09,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:42:09,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:09,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:09,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:10,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:10,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090376663] [2025-03-13 21:42:10,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090376663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:10,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:10,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:42:10,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021432518] [2025-03-13 21:42:10,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:10,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:10,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:10,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:10,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:10,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:10,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 300 transitions, 4884 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:10,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:10,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:10,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:10,880 INFO L124 PetriNetUnfolderBase]: 3058/5587 cut-off events. [2025-03-13 21:42:10,881 INFO L125 PetriNetUnfolderBase]: For 71614/71793 co-relation queries the response was YES. [2025-03-13 21:42:10,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35229 conditions, 5587 events. 3058/5587 cut-off events. For 71614/71793 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 40526 event pairs, 1188 based on Foata normal form. 58/5615 useless extension candidates. Maximal degree in co-relation 35154. Up to 3172 conditions per place. [2025-03-13 21:42:10,929 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 260 selfloop transitions, 119 changer transitions 0/384 dead transitions. [2025-03-13 21:42:10,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 384 transitions, 6485 flow [2025-03-13 21:42:10,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2025-03-13 21:42:10,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-03-13 21:42:10,930 INFO L175 Difference]: Start difference. First operand has 191 places, 300 transitions, 4884 flow. Second operand 9 states and 114 transitions. [2025-03-13 21:42:10,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 384 transitions, 6485 flow [2025-03-13 21:42:11,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 384 transitions, 6328 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-03-13 21:42:11,182 INFO L231 Difference]: Finished difference. Result has 197 places, 307 transitions, 5131 flow [2025-03-13 21:42:11,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4727, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5131, PETRI_PLACES=197, PETRI_TRANSITIONS=307} [2025-03-13 21:42:11,184 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 171 predicate places. [2025-03-13 21:42:11,184 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 307 transitions, 5131 flow [2025-03-13 21:42:11,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:11,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:11,184 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:11,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-13 21:42:11,185 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:11,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:11,185 INFO L85 PathProgramCache]: Analyzing trace with hash -971351909, now seen corresponding path program 14 times [2025-03-13 21:42:11,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:11,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570965164] [2025-03-13 21:42:11,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:11,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:11,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:11,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:11,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:11,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:11,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:11,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570965164] [2025-03-13 21:42:11,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570965164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:11,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636134499] [2025-03-13 21:42:11,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:11,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:11,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:11,364 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-13 21:42:11,366 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-13 21:42:11,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:11,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:11,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:11,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:11,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-13 21:42:11,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:11,518 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:42:11,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-13 21:42:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:11,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:11,635 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-13 21:42:11,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-13 21:42:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:11,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636134499] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:11,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:11,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 16 [2025-03-13 21:42:11,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348368289] [2025-03-13 21:42:11,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:11,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:42:11,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:11,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:42:11,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:42:11,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:11,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 307 transitions, 5131 flow. Second operand has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-13 21:42:11,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:11,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:11,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:12,531 INFO L124 PetriNetUnfolderBase]: 2953/5414 cut-off events. [2025-03-13 21:42:12,531 INFO L125 PetriNetUnfolderBase]: For 70720/70875 co-relation queries the response was YES. [2025-03-13 21:42:12,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34875 conditions, 5414 events. 2953/5414 cut-off events. For 70720/70875 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 39120 event pairs, 464 based on Foata normal form. 58/5460 useless extension candidates. Maximal degree in co-relation 34798. Up to 2946 conditions per place. [2025-03-13 21:42:12,583 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 272 selfloop transitions, 114 changer transitions 2/393 dead transitions. [2025-03-13 21:42:12,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 393 transitions, 6743 flow [2025-03-13 21:42:12,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:42:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:42:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2025-03-13 21:42:12,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4035714285714286 [2025-03-13 21:42:12,584 INFO L175 Difference]: Start difference. First operand has 197 places, 307 transitions, 5131 flow. Second operand 10 states and 113 transitions. [2025-03-13 21:42:12,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 393 transitions, 6743 flow [2025-03-13 21:42:12,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 393 transitions, 6566 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-13 21:42:12,848 INFO L231 Difference]: Finished difference. Result has 203 places, 311 transitions, 5291 flow [2025-03-13 21:42:12,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4954, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5291, PETRI_PLACES=203, PETRI_TRANSITIONS=311} [2025-03-13 21:42:12,848 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 177 predicate places. [2025-03-13 21:42:12,848 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 311 transitions, 5291 flow [2025-03-13 21:42:12,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-13 21:42:12,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:12,848 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:12,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-13 21:42:13,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:13,049 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:13,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:13,049 INFO L85 PathProgramCache]: Analyzing trace with hash -503163111, now seen corresponding path program 9 times [2025-03-13 21:42:13,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:13,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523779000] [2025-03-13 21:42:13,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:42:13,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:13,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:13,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:13,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:42:13,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:13,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:13,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523779000] [2025-03-13 21:42:13,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523779000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:13,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623673639] [2025-03-13 21:42:13,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:42:13,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:13,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:13,197 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-13 21:42:13,197 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-13 21:42:13,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:13,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:13,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:42:13,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:13,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-13 21:42:13,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:13,326 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:42:13,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-13 21:42:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:13,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:13,381 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-13 21:42:13,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-13 21:42:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:13,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623673639] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:13,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:13,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 16 [2025-03-13 21:42:13,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450364010] [2025-03-13 21:42:13,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:13,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:42:13,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:13,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:42:13,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:42:13,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:13,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 311 transitions, 5291 flow. Second operand has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-13 21:42:13,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:13,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:13,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:14,193 INFO L124 PetriNetUnfolderBase]: 3052/5564 cut-off events. [2025-03-13 21:42:14,194 INFO L125 PetriNetUnfolderBase]: For 77562/77701 co-relation queries the response was YES. [2025-03-13 21:42:14,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36593 conditions, 5564 events. 3052/5564 cut-off events. For 77562/77701 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 40127 event pairs, 1203 based on Foata normal form. 46/5567 useless extension candidates. Maximal degree in co-relation 36514. Up to 3429 conditions per place. [2025-03-13 21:42:14,237 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 246 selfloop transitions, 141 changer transitions 0/392 dead transitions. [2025-03-13 21:42:14,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 392 transitions, 6932 flow [2025-03-13 21:42:14,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:42:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:42:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2025-03-13 21:42:14,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43214285714285716 [2025-03-13 21:42:14,238 INFO L175 Difference]: Start difference. First operand has 203 places, 311 transitions, 5291 flow. Second operand 10 states and 121 transitions. [2025-03-13 21:42:14,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 392 transitions, 6932 flow [2025-03-13 21:42:14,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 392 transitions, 6585 flow, removed 25 selfloop flow, removed 7 redundant places. [2025-03-13 21:42:14,491 INFO L231 Difference]: Finished difference. Result has 207 places, 327 transitions, 5641 flow [2025-03-13 21:42:14,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4984, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5641, PETRI_PLACES=207, PETRI_TRANSITIONS=327} [2025-03-13 21:42:14,492 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 181 predicate places. [2025-03-13 21:42:14,492 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 327 transitions, 5641 flow [2025-03-13 21:42:14,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-13 21:42:14,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:14,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:14,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-13 21:42:14,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:14,697 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:14,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:14,698 INFO L85 PathProgramCache]: Analyzing trace with hash -665309925, now seen corresponding path program 15 times [2025-03-13 21:42:14,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:14,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856115762] [2025-03-13 21:42:14,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:42:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:14,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:14,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-13 21:42:14,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:42:14,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:14,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:14,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856115762] [2025-03-13 21:42:14,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856115762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:14,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:14,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:42:14,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872195480] [2025-03-13 21:42:14,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:14,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:14,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:14,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:14,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:14,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:14,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 327 transitions, 5641 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:14,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:14,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:14,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:15,804 INFO L124 PetriNetUnfolderBase]: 3022/5536 cut-off events. [2025-03-13 21:42:15,804 INFO L125 PetriNetUnfolderBase]: For 71642/71779 co-relation queries the response was YES. [2025-03-13 21:42:15,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35869 conditions, 5536 events. 3022/5536 cut-off events. For 71642/71779 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 40167 event pairs, 1152 based on Foata normal form. 40/5533 useless extension candidates. Maximal degree in co-relation 35789. Up to 3348 conditions per place. [2025-03-13 21:42:15,856 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 252 selfloop transitions, 135 changer transitions 0/392 dead transitions. [2025-03-13 21:42:15,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 392 transitions, 6995 flow [2025-03-13 21:42:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2025-03-13 21:42:15,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-13 21:42:15,857 INFO L175 Difference]: Start difference. First operand has 207 places, 327 transitions, 5641 flow. Second operand 9 states and 105 transitions. [2025-03-13 21:42:15,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 392 transitions, 6995 flow [2025-03-13 21:42:16,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 392 transitions, 6606 flow, removed 47 selfloop flow, removed 7 redundant places. [2025-03-13 21:42:16,119 INFO L231 Difference]: Finished difference. Result has 211 places, 331 transitions, 5637 flow [2025-03-13 21:42:16,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5262, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5637, PETRI_PLACES=211, PETRI_TRANSITIONS=331} [2025-03-13 21:42:16,119 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 185 predicate places. [2025-03-13 21:42:16,119 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 331 transitions, 5637 flow [2025-03-13 21:42:16,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:16,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:16,119 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:16,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-13 21:42:16,120 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:16,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:16,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1580391413, now seen corresponding path program 16 times [2025-03-13 21:42:16,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:16,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340798962] [2025-03-13 21:42:16,120 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:42:16,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:16,126 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:16,129 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:16,129 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:42:16,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:16,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:16,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340798962] [2025-03-13 21:42:16,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340798962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:16,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:16,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:42:16,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022300547] [2025-03-13 21:42:16,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:16,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:42:16,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:16,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:42:16,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:42:16,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:16,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 331 transitions, 5637 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:16,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:16,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:16,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:16,915 INFO L124 PetriNetUnfolderBase]: 2992/5511 cut-off events. [2025-03-13 21:42:16,915 INFO L125 PetriNetUnfolderBase]: For 67262/67393 co-relation queries the response was YES. [2025-03-13 21:42:16,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35213 conditions, 5511 events. 2992/5511 cut-off events. For 67262/67393 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 40255 event pairs, 1236 based on Foata normal form. 40/5507 useless extension candidates. Maximal degree in co-relation 35130. Up to 3331 conditions per place. [2025-03-13 21:42:16,961 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 229 selfloop transitions, 140 changer transitions 2/376 dead transitions. [2025-03-13 21:42:16,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 376 transitions, 6780 flow [2025-03-13 21:42:16,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:42:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:42:16,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-03-13 21:42:16,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-03-13 21:42:16,962 INFO L175 Difference]: Start difference. First operand has 211 places, 331 transitions, 5637 flow. Second operand 7 states and 100 transitions. [2025-03-13 21:42:16,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 376 transitions, 6780 flow [2025-03-13 21:42:17,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 376 transitions, 6588 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-13 21:42:17,250 INFO L231 Difference]: Finished difference. Result has 214 places, 333 transitions, 5774 flow [2025-03-13 21:42:17,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5446, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5774, PETRI_PLACES=214, PETRI_TRANSITIONS=333} [2025-03-13 21:42:17,250 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 188 predicate places. [2025-03-13 21:42:17,250 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 333 transitions, 5774 flow [2025-03-13 21:42:17,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:17,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:17,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:17,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-13 21:42:17,251 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:17,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:17,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1532457057, now seen corresponding path program 10 times [2025-03-13 21:42:17,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:17,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082406158] [2025-03-13 21:42:17,251 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:42:17,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:17,255 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:17,258 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:17,258 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:42:17,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:17,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:17,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:17,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082406158] [2025-03-13 21:42:17,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082406158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:17,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275608366] [2025-03-13 21:42:17,325 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:42:17,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:17,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:17,327 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-13 21:42:17,328 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-13 21:42:17,381 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:17,395 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:17,396 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:42:17,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:17,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-13 21:42:17,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:17,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:42:17,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2025-03-13 21:42:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:17,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:17,518 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-13 21:42:17,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-13 21:42:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:17,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275608366] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:17,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:42:17,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 8] total 17 [2025-03-13 21:42:17,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497278883] [2025-03-13 21:42:17,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:17,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:42:17,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:17,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:42:17,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-13 21:42:17,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:17,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 333 transitions, 5774 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:17,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:17,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:17,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:18,256 INFO L124 PetriNetUnfolderBase]: 3130/5807 cut-off events. [2025-03-13 21:42:18,256 INFO L125 PetriNetUnfolderBase]: For 71915/72046 co-relation queries the response was YES. [2025-03-13 21:42:18,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36856 conditions, 5807 events. 3130/5807 cut-off events. For 71915/72046 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 43244 event pairs, 1227 based on Foata normal form. 46/5808 useless extension candidates. Maximal degree in co-relation 36771. Up to 3384 conditions per place. [2025-03-13 21:42:18,305 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 246 selfloop transitions, 145 changer transitions 0/396 dead transitions. [2025-03-13 21:42:18,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 396 transitions, 7186 flow [2025-03-13 21:42:18,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:42:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:42:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2025-03-13 21:42:18,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2025-03-13 21:42:18,305 INFO L175 Difference]: Start difference. First operand has 214 places, 333 transitions, 5774 flow. Second operand 7 states and 106 transitions. [2025-03-13 21:42:18,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 396 transitions, 7186 flow [2025-03-13 21:42:18,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 396 transitions, 6712 flow, removed 30 selfloop flow, removed 14 redundant places. [2025-03-13 21:42:18,536 INFO L231 Difference]: Finished difference. Result has 208 places, 344 transitions, 5892 flow [2025-03-13 21:42:18,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5325, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5892, PETRI_PLACES=208, PETRI_TRANSITIONS=344} [2025-03-13 21:42:18,537 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 182 predicate places. [2025-03-13 21:42:18,537 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 344 transitions, 5892 flow [2025-03-13 21:42:18,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:18,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:18,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:18,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-13 21:42:18,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:18,738 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:18,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash -239139503, now seen corresponding path program 11 times [2025-03-13 21:42:18,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:18,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829698534] [2025-03-13 21:42:18,738 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:42:18,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:18,743 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:18,748 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:18,749 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:18,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:18,896 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-13 21:42:18,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:18,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829698534] [2025-03-13 21:42:18,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829698534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:18,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616407761] [2025-03-13 21:42:18,897 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:42:18,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:18,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:18,898 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-13 21:42:18,899 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-13 21:42:18,957 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:18,972 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:18,972 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:18,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:18,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-13 21:42:18,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:19,102 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-13 21:42:19,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2025-03-13 21:42:19,117 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-13 21:42:19,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:19,207 INFO L349 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-03-13 21:42:19,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 77 [2025-03-13 21:42:19,323 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-13 21:42:19,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616407761] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:19,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:19,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 27 [2025-03-13 21:42:19,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533996671] [2025-03-13 21:42:19,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:19,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-13 21:42:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:19,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-13 21:42:19,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2025-03-13 21:42:19,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-13 21:42:19,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 344 transitions, 5892 flow. Second operand has 27 states, 27 states have (on average 6.074074074074074) internal successors, (164), 27 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-13 21:42:19,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:19,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-13 21:42:19,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:21,038 INFO L124 PetriNetUnfolderBase]: 3496/6369 cut-off events. [2025-03-13 21:42:21,039 INFO L125 PetriNetUnfolderBase]: For 72863/72911 co-relation queries the response was YES. [2025-03-13 21:42:21,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39139 conditions, 6369 events. 3496/6369 cut-off events. For 72863/72911 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 46760 event pairs, 788 based on Foata normal form. 51/6404 useless extension candidates. Maximal degree in co-relation 39062. Up to 1104 conditions per place. [2025-03-13 21:42:21,095 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 394 selfloop transitions, 251 changer transitions 3/652 dead transitions. [2025-03-13 21:42:21,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 652 transitions, 10344 flow [2025-03-13 21:42:21,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-13 21:42:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-13 21:42:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 451 transitions. [2025-03-13 21:42:21,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3835034013605442 [2025-03-13 21:42:21,097 INFO L175 Difference]: Start difference. First operand has 208 places, 344 transitions, 5892 flow. Second operand 42 states and 451 transitions. [2025-03-13 21:42:21,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 652 transitions, 10344 flow [2025-03-13 21:42:21,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 652 transitions, 10127 flow, removed 18 selfloop flow, removed 2 redundant places. [2025-03-13 21:42:21,383 INFO L231 Difference]: Finished difference. Result has 253 places, 423 transitions, 7788 flow [2025-03-13 21:42:21,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5715, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=7788, PETRI_PLACES=253, PETRI_TRANSITIONS=423} [2025-03-13 21:42:21,384 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 227 predicate places. [2025-03-13 21:42:21,384 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 423 transitions, 7788 flow [2025-03-13 21:42:21,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.074074074074074) internal successors, (164), 27 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-13 21:42:21,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:21,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:21,390 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-13 21:42:21,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:21,584 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:21,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:21,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1072002133, now seen corresponding path program 12 times [2025-03-13 21:42:21,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:21,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889588603] [2025-03-13 21:42:21,585 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:42:21,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:21,589 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:21,596 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:21,597 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:42:21,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:21,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:21,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889588603] [2025-03-13 21:42:21,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889588603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:21,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:21,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:42:21,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21043620] [2025-03-13 21:42:21,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:21,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:21,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:21,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:21,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:21,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:21,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 423 transitions, 7788 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:21,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:21,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:21,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:22,653 INFO L124 PetriNetUnfolderBase]: 3184/5931 cut-off events. [2025-03-13 21:42:22,653 INFO L125 PetriNetUnfolderBase]: For 75788/75923 co-relation queries the response was YES. [2025-03-13 21:42:22,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38107 conditions, 5931 events. 3184/5931 cut-off events. For 75788/75923 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 44791 event pairs, 1124 based on Foata normal form. 22/5908 useless extension candidates. Maximal degree in co-relation 38024. Up to 3402 conditions per place. [2025-03-13 21:42:22,706 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 282 selfloop transitions, 187 changer transitions 10/484 dead transitions. [2025-03-13 21:42:22,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 484 transitions, 9163 flow [2025-03-13 21:42:22,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2025-03-13 21:42:22,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2025-03-13 21:42:22,707 INFO L175 Difference]: Start difference. First operand has 253 places, 423 transitions, 7788 flow. Second operand 9 states and 100 transitions. [2025-03-13 21:42:22,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 484 transitions, 9163 flow [2025-03-13 21:42:23,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 484 transitions, 8597 flow, removed 113 selfloop flow, removed 10 redundant places. [2025-03-13 21:42:23,044 INFO L231 Difference]: Finished difference. Result has 252 places, 415 transitions, 7401 flow [2025-03-13 21:42:23,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=7136, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7401, PETRI_PLACES=252, PETRI_TRANSITIONS=415} [2025-03-13 21:42:23,045 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 226 predicate places. [2025-03-13 21:42:23,045 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 415 transitions, 7401 flow [2025-03-13 21:42:23,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:23,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:23,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:23,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-13 21:42:23,046 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:23,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:23,046 INFO L85 PathProgramCache]: Analyzing trace with hash -116617391, now seen corresponding path program 13 times [2025-03-13 21:42:23,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:23,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376593113] [2025-03-13 21:42:23,046 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:42:23,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:23,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:42:23,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:23,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:23,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:23,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:23,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376593113] [2025-03-13 21:42:23,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376593113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:23,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:23,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:42:23,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408023032] [2025-03-13 21:42:23,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:23,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:23,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:23,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:23,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:23,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:23,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 415 transitions, 7401 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:23,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:23,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:23,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:24,037 INFO L124 PetriNetUnfolderBase]: 3146/5868 cut-off events. [2025-03-13 21:42:24,038 INFO L125 PetriNetUnfolderBase]: For 65644/65781 co-relation queries the response was YES. [2025-03-13 21:42:24,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37146 conditions, 5868 events. 3146/5868 cut-off events. For 65644/65781 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 44052 event pairs, 1152 based on Foata normal form. 22/5850 useless extension candidates. Maximal degree in co-relation 37061. Up to 3402 conditions per place. [2025-03-13 21:42:24,091 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 257 selfloop transitions, 193 changer transitions 7/462 dead transitions. [2025-03-13 21:42:24,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 462 transitions, 8596 flow [2025-03-13 21:42:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2025-03-13 21:42:24,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-03-13 21:42:24,092 INFO L175 Difference]: Start difference. First operand has 252 places, 415 transitions, 7401 flow. Second operand 9 states and 102 transitions. [2025-03-13 21:42:24,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 462 transitions, 8596 flow [2025-03-13 21:42:24,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 462 transitions, 8217 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-03-13 21:42:24,351 INFO L231 Difference]: Finished difference. Result has 250 places, 407 transitions, 7229 flow [2025-03-13 21:42:24,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6942, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7229, PETRI_PLACES=250, PETRI_TRANSITIONS=407} [2025-03-13 21:42:24,351 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 224 predicate places. [2025-03-13 21:42:24,351 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 407 transitions, 7229 flow [2025-03-13 21:42:24,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:24,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:24,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:24,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-13 21:42:24,352 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:24,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:24,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1076995717, now seen corresponding path program 14 times [2025-03-13 21:42:24,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:24,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577992973] [2025-03-13 21:42:24,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:24,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:24,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:24,360 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-13 21:42:24,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:42:24,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:24,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:24,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577992973] [2025-03-13 21:42:24,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577992973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:24,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:24,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:42:24,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609357417] [2025-03-13 21:42:24,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:24,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:24,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:24,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:24,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:24,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:24,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 407 transitions, 7229 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:24,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:24,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:24,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:25,806 INFO L124 PetriNetUnfolderBase]: 3082/5744 cut-off events. [2025-03-13 21:42:25,806 INFO L125 PetriNetUnfolderBase]: For 64787/64918 co-relation queries the response was YES. [2025-03-13 21:42:25,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36510 conditions, 5744 events. 3082/5744 cut-off events. For 64787/64918 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 42866 event pairs, 1144 based on Foata normal form. 22/5726 useless extension candidates. Maximal degree in co-relation 36427. Up to 3402 conditions per place. [2025-03-13 21:42:25,847 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 248 selfloop transitions, 193 changer transitions 5/451 dead transitions. [2025-03-13 21:42:25,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 451 transitions, 8369 flow [2025-03-13 21:42:25,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2025-03-13 21:42:25,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2025-03-13 21:42:25,847 INFO L175 Difference]: Start difference. First operand has 250 places, 407 transitions, 7229 flow. Second operand 9 states and 100 transitions. [2025-03-13 21:42:25,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 451 transitions, 8369 flow [2025-03-13 21:42:26,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 451 transitions, 7948 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-03-13 21:42:26,072 INFO L231 Difference]: Finished difference. Result has 246 places, 399 transitions, 7034 flow [2025-03-13 21:42:26,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6705, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7034, PETRI_PLACES=246, PETRI_TRANSITIONS=399} [2025-03-13 21:42:26,073 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 220 predicate places. [2025-03-13 21:42:26,073 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 399 transitions, 7034 flow [2025-03-13 21:42:26,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:26,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:26,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:26,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-13 21:42:26,073 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:26,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:26,074 INFO L85 PathProgramCache]: Analyzing trace with hash -53954839, now seen corresponding path program 17 times [2025-03-13 21:42:26,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:26,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046611586] [2025-03-13 21:42:26,074 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:42:26,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:26,079 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:26,084 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:26,085 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:26,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:26,228 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-13 21:42:26,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:26,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046611586] [2025-03-13 21:42:26,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046611586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:26,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407802415] [2025-03-13 21:42:26,229 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:42:26,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:26,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:26,231 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-13 21:42:26,232 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-13 21:42:26,287 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:26,300 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:26,301 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:26,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:26,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-13 21:42:26,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:26,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:42:26,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-13 21:42:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:26,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:42:26,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407802415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:26,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:42:26,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2025-03-13 21:42:26,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371558714] [2025-03-13 21:42:26,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:26,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:26,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:26,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:26,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:42:26,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:26,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 399 transitions, 7034 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:26,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:26,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:26,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:27,247 INFO L124 PetriNetUnfolderBase]: 2986/5529 cut-off events. [2025-03-13 21:42:27,248 INFO L125 PetriNetUnfolderBase]: For 60222/60353 co-relation queries the response was YES. [2025-03-13 21:42:27,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35171 conditions, 5529 events. 2986/5529 cut-off events. For 60222/60353 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 40741 event pairs, 1078 based on Foata normal form. 25/5515 useless extension candidates. Maximal degree in co-relation 35091. Up to 3225 conditions per place. [2025-03-13 21:42:27,283 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 246 selfloop transitions, 187 changer transitions 6/444 dead transitions. [2025-03-13 21:42:27,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 444 transitions, 8186 flow [2025-03-13 21:42:27,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:27,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2025-03-13 21:42:27,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-13 21:42:27,284 INFO L175 Difference]: Start difference. First operand has 246 places, 399 transitions, 7034 flow. Second operand 9 states and 98 transitions. [2025-03-13 21:42:27,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 444 transitions, 8186 flow [2025-03-13 21:42:27,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 444 transitions, 7751 flow, removed 9 selfloop flow, removed 8 redundant places. [2025-03-13 21:42:27,481 INFO L231 Difference]: Finished difference. Result has 241 places, 393 transitions, 6848 flow [2025-03-13 21:42:27,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6526, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6848, PETRI_PLACES=241, PETRI_TRANSITIONS=393} [2025-03-13 21:42:27,482 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 215 predicate places. [2025-03-13 21:42:27,482 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 393 transitions, 6848 flow [2025-03-13 21:42:27,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:27,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:27,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:27,487 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-13 21:42:27,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:27,683 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:27,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:27,683 INFO L85 PathProgramCache]: Analyzing trace with hash -876537755, now seen corresponding path program 15 times [2025-03-13 21:42:27,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:27,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457303926] [2025-03-13 21:42:27,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:42:27,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:27,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:27,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-13 21:42:27,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:42:27,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:28,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:28,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457303926] [2025-03-13 21:42:28,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457303926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:28,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:28,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:42:28,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201017471] [2025-03-13 21:42:28,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:28,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:28,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:28,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:28,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:28,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:28,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 393 transitions, 6848 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:28,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:28,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:28,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:28,877 INFO L124 PetriNetUnfolderBase]: 2968/5488 cut-off events. [2025-03-13 21:42:28,877 INFO L125 PetriNetUnfolderBase]: For 59965/60104 co-relation queries the response was YES. [2025-03-13 21:42:28,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34810 conditions, 5488 events. 2968/5488 cut-off events. For 59965/60104 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 40336 event pairs, 1193 based on Foata normal form. 22/5471 useless extension candidates. Maximal degree in co-relation 34731. Up to 3225 conditions per place. [2025-03-13 21:42:28,914 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 248 selfloop transitions, 165 changer transitions 5/423 dead transitions. [2025-03-13 21:42:28,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 423 transitions, 7805 flow [2025-03-13 21:42:28,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:28,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2025-03-13 21:42:28,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-13 21:42:28,915 INFO L175 Difference]: Start difference. First operand has 241 places, 393 transitions, 6848 flow. Second operand 9 states and 105 transitions. [2025-03-13 21:42:28,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 423 transitions, 7805 flow [2025-03-13 21:42:29,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 423 transitions, 7416 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 21:42:29,113 INFO L231 Difference]: Finished difference. Result has 240 places, 387 transitions, 6659 flow [2025-03-13 21:42:29,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6377, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6659, PETRI_PLACES=240, PETRI_TRANSITIONS=387} [2025-03-13 21:42:29,114 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 214 predicate places. [2025-03-13 21:42:29,114 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 387 transitions, 6659 flow [2025-03-13 21:42:29,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:29,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:29,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:29,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-13 21:42:29,114 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:29,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:29,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1986799719, now seen corresponding path program 16 times [2025-03-13 21:42:29,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:29,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993157104] [2025-03-13 21:42:29,115 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:42:29,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:29,123 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:29,126 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:29,126 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:42:29,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:29,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:29,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993157104] [2025-03-13 21:42:29,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993157104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:29,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:29,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:42:29,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203135155] [2025-03-13 21:42:29,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:29,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:42:29,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:29,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:42:29,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:42:29,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:29,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 387 transitions, 6659 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:29,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:29,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:29,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:30,180 INFO L124 PetriNetUnfolderBase]: 2871/5270 cut-off events. [2025-03-13 21:42:30,180 INFO L125 PetriNetUnfolderBase]: For 57689/57819 co-relation queries the response was YES. [2025-03-13 21:42:30,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33695 conditions, 5270 events. 2871/5270 cut-off events. For 57689/57819 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 38012 event pairs, 1150 based on Foata normal form. 22/5258 useless extension candidates. Maximal degree in co-relation 33616. Up to 3238 conditions per place. [2025-03-13 21:42:30,228 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 254 selfloop transitions, 151 changer transitions 7/417 dead transitions. [2025-03-13 21:42:30,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 417 transitions, 7604 flow [2025-03-13 21:42:30,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:42:30,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:42:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2025-03-13 21:42:30,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4744897959183674 [2025-03-13 21:42:30,230 INFO L175 Difference]: Start difference. First operand has 240 places, 387 transitions, 6659 flow. Second operand 7 states and 93 transitions. [2025-03-13 21:42:30,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 417 transitions, 7604 flow [2025-03-13 21:42:30,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 417 transitions, 7258 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-13 21:42:30,445 INFO L231 Difference]: Finished difference. Result has 238 places, 379 transitions, 6436 flow [2025-03-13 21:42:30,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6231, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6436, PETRI_PLACES=238, PETRI_TRANSITIONS=379} [2025-03-13 21:42:30,446 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 212 predicate places. [2025-03-13 21:42:30,446 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 379 transitions, 6436 flow [2025-03-13 21:42:30,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:30,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:30,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:30,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-13 21:42:30,446 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:30,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1707293375, now seen corresponding path program 17 times [2025-03-13 21:42:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:30,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004907302] [2025-03-13 21:42:30,447 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:42:30,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:30,453 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:30,460 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:30,460 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:30,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:30,639 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-13 21:42:30,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:30,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004907302] [2025-03-13 21:42:30,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004907302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:30,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040227875] [2025-03-13 21:42:30,640 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:42:30,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:30,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:30,642 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-13 21:42:30,643 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-13 21:42:30,702 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:30,721 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:30,721 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:30,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:30,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-13 21:42:30,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:30,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:42:30,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-13 21:42:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:30,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:42:30,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040227875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:30,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:42:30,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2025-03-13 21:42:30,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629577789] [2025-03-13 21:42:30,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:30,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:30,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:30,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:30,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:42:30,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:30,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 379 transitions, 6436 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:30,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:30,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:30,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:31,726 INFO L124 PetriNetUnfolderBase]: 2806/5120 cut-off events. [2025-03-13 21:42:31,727 INFO L125 PetriNetUnfolderBase]: For 57041/57172 co-relation queries the response was YES. [2025-03-13 21:42:31,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32909 conditions, 5120 events. 2806/5120 cut-off events. For 57041/57172 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 36588 event pairs, 1139 based on Foata normal form. 22/5103 useless extension candidates. Maximal degree in co-relation 32830. Up to 3225 conditions per place. [2025-03-13 21:42:31,775 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 239 selfloop transitions, 158 changer transitions 5/407 dead transitions. [2025-03-13 21:42:31,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 407 transitions, 7378 flow [2025-03-13 21:42:31,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:31,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:31,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2025-03-13 21:42:31,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-13 21:42:31,776 INFO L175 Difference]: Start difference. First operand has 238 places, 379 transitions, 6436 flow. Second operand 9 states and 99 transitions. [2025-03-13 21:42:31,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 407 transitions, 7378 flow [2025-03-13 21:42:31,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 407 transitions, 7053 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-13 21:42:31,994 INFO L231 Difference]: Finished difference. Result has 237 places, 375 transitions, 6356 flow [2025-03-13 21:42:31,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6025, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6356, PETRI_PLACES=237, PETRI_TRANSITIONS=375} [2025-03-13 21:42:31,994 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 211 predicate places. [2025-03-13 21:42:31,994 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 375 transitions, 6356 flow [2025-03-13 21:42:31,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:31,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:31,994 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:32,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-13 21:42:32,199 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,SelfDestructingSolverStorable53 [2025-03-13 21:42:32,199 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:32,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:32,199 INFO L85 PathProgramCache]: Analyzing trace with hash 53949903, now seen corresponding path program 18 times [2025-03-13 21:42:32,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:32,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698071128] [2025-03-13 21:42:32,199 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:42:32,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:32,203 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:32,207 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-13 21:42:32,208 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:42:32,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:32,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:32,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698071128] [2025-03-13 21:42:32,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698071128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:32,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:32,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:42:32,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087424066] [2025-03-13 21:42:32,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:32,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:32,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:32,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:32,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:32,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:32,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 375 transitions, 6356 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:32,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:32,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:32,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:33,023 INFO L124 PetriNetUnfolderBase]: 2710/4914 cut-off events. [2025-03-13 21:42:33,023 INFO L125 PetriNetUnfolderBase]: For 54878/55005 co-relation queries the response was YES. [2025-03-13 21:42:33,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31895 conditions, 4914 events. 2710/4914 cut-off events. For 54878/55005 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 34540 event pairs, 1067 based on Foata normal form. 25/4906 useless extension candidates. Maximal degree in co-relation 31817. Up to 3048 conditions per place. [2025-03-13 21:42:33,112 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 244 selfloop transitions, 150 changer transitions 5/404 dead transitions. [2025-03-13 21:42:33,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 404 transitions, 7273 flow [2025-03-13 21:42:33,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2025-03-13 21:42:33,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4087301587301587 [2025-03-13 21:42:33,113 INFO L175 Difference]: Start difference. First operand has 237 places, 375 transitions, 6356 flow. Second operand 9 states and 103 transitions. [2025-03-13 21:42:33,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 404 transitions, 7273 flow [2025-03-13 21:42:33,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 404 transitions, 6943 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-03-13 21:42:33,268 INFO L231 Difference]: Finished difference. Result has 233 places, 370 transitions, 6224 flow [2025-03-13 21:42:33,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5960, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6224, PETRI_PLACES=233, PETRI_TRANSITIONS=370} [2025-03-13 21:42:33,269 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 207 predicate places. [2025-03-13 21:42:33,269 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 370 transitions, 6224 flow [2025-03-13 21:42:33,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:33,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:33,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:33,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-13 21:42:33,269 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:33,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1888993589, now seen corresponding path program 19 times [2025-03-13 21:42:33,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:33,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088079570] [2025-03-13 21:42:33,270 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:42:33,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:33,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:42:33,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:42:33,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:33,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:33,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:33,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088079570] [2025-03-13 21:42:33,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088079570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:33,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:33,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:42:33,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531426441] [2025-03-13 21:42:33,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:33,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:33,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:33,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:33,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:33,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:33,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 370 transitions, 6224 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:33,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:33,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:33,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:34,195 INFO L124 PetriNetUnfolderBase]: 2699/4905 cut-off events. [2025-03-13 21:42:34,195 INFO L125 PetriNetUnfolderBase]: For 54598/54723 co-relation queries the response was YES. [2025-03-13 21:42:34,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31707 conditions, 4905 events. 2699/4905 cut-off events. For 54598/54723 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 34480 event pairs, 1067 based on Foata normal form. 25/4902 useless extension candidates. Maximal degree in co-relation 31631. Up to 3043 conditions per place. [2025-03-13 21:42:34,240 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 239 selfloop transitions, 147 changer transitions 8/399 dead transitions. [2025-03-13 21:42:34,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 399 transitions, 7171 flow [2025-03-13 21:42:34,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2025-03-13 21:42:34,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-13 21:42:34,241 INFO L175 Difference]: Start difference. First operand has 233 places, 370 transitions, 6224 flow. Second operand 9 states and 98 transitions. [2025-03-13 21:42:34,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 399 transitions, 7171 flow [2025-03-13 21:42:34,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 399 transitions, 6863 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-13 21:42:34,447 INFO L231 Difference]: Finished difference. Result has 232 places, 364 transitions, 6115 flow [2025-03-13 21:42:34,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5897, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6115, PETRI_PLACES=232, PETRI_TRANSITIONS=364} [2025-03-13 21:42:34,448 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 206 predicate places. [2025-03-13 21:42:34,448 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 364 transitions, 6115 flow [2025-03-13 21:42:34,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:34,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:34,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:34,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-13 21:42:34,449 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:34,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:34,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1564633043, now seen corresponding path program 20 times [2025-03-13 21:42:34,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:34,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827691251] [2025-03-13 21:42:34,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:34,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:34,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:42:34,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-13 21:42:34,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:42:34,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:34,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:34,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827691251] [2025-03-13 21:42:34,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827691251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:34,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:34,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:42:34,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129908552] [2025-03-13 21:42:34,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:34,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:34,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:34,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:34,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:34,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:34,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 364 transitions, 6115 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:34,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:34,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:34,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:35,434 INFO L124 PetriNetUnfolderBase]: 2588/4665 cut-off events. [2025-03-13 21:42:35,435 INFO L125 PetriNetUnfolderBase]: For 49986/50108 co-relation queries the response was YES. [2025-03-13 21:42:35,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30301 conditions, 4665 events. 2588/4665 cut-off events. For 49986/50108 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 32196 event pairs, 1001 based on Foata normal form. 25/4668 useless extension candidates. Maximal degree in co-relation 30226. Up to 2866 conditions per place. [2025-03-13 21:42:35,483 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 234 selfloop transitions, 145 changer transitions 5/389 dead transitions. [2025-03-13 21:42:35,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 389 transitions, 6993 flow [2025-03-13 21:42:35,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2025-03-13 21:42:35,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2025-03-13 21:42:35,484 INFO L175 Difference]: Start difference. First operand has 232 places, 364 transitions, 6115 flow. Second operand 9 states and 96 transitions. [2025-03-13 21:42:35,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 389 transitions, 6993 flow [2025-03-13 21:42:35,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 389 transitions, 6631 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-03-13 21:42:35,695 INFO L231 Difference]: Finished difference. Result has 228 places, 359 transitions, 5954 flow [2025-03-13 21:42:35,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5690, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5954, PETRI_PLACES=228, PETRI_TRANSITIONS=359} [2025-03-13 21:42:35,696 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 202 predicate places. [2025-03-13 21:42:35,696 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 359 transitions, 5954 flow [2025-03-13 21:42:35,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:35,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:35,696 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:35,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-13 21:42:35,696 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:35,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:35,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2086445909, now seen corresponding path program 18 times [2025-03-13 21:42:35,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:35,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958108288] [2025-03-13 21:42:35,697 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:42:35,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:35,704 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:42:35,710 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-03-13 21:42:35,710 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:42:35,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:42:35,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:35,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958108288] [2025-03-13 21:42:35,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958108288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:35,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:35,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:42:35,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671205885] [2025-03-13 21:42:35,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:35,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:35,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:35,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:35,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:35,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:35,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 359 transitions, 5954 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:35,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:35,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:35,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:36,681 INFO L124 PetriNetUnfolderBase]: 2615/4684 cut-off events. [2025-03-13 21:42:36,681 INFO L125 PetriNetUnfolderBase]: For 51770/51916 co-relation queries the response was YES. [2025-03-13 21:42:36,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30627 conditions, 4684 events. 2615/4684 cut-off events. For 51770/51916 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 32278 event pairs, 1065 based on Foata normal form. 34/4678 useless extension candidates. Maximal degree in co-relation 30555. Up to 3379 conditions per place. [2025-03-13 21:42:36,720 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 272 selfloop transitions, 107 changer transitions 0/384 dead transitions. [2025-03-13 21:42:36,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 384 transitions, 6983 flow [2025-03-13 21:42:36,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2025-03-13 21:42:36,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38492063492063494 [2025-03-13 21:42:36,721 INFO L175 Difference]: Start difference. First operand has 228 places, 359 transitions, 5954 flow. Second operand 9 states and 97 transitions. [2025-03-13 21:42:36,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 384 transitions, 6983 flow [2025-03-13 21:42:36,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 384 transitions, 6607 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 21:42:36,916 INFO L231 Difference]: Finished difference. Result has 223 places, 363 transitions, 5907 flow [2025-03-13 21:42:36,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5586, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5907, PETRI_PLACES=223, PETRI_TRANSITIONS=363} [2025-03-13 21:42:36,916 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 197 predicate places. [2025-03-13 21:42:36,916 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 363 transitions, 5907 flow [2025-03-13 21:42:36,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:36,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:36,917 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:36,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-13 21:42:36,917 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:36,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:36,917 INFO L85 PathProgramCache]: Analyzing trace with hash -783725745, now seen corresponding path program 19 times [2025-03-13 21:42:36,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:36,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926901294] [2025-03-13 21:42:36,918 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:42:36,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:36,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:42:36,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:42:36,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:36,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:42:37,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:37,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926901294] [2025-03-13 21:42:37,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926901294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:37,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629563539] [2025-03-13 21:42:37,091 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:42:37,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:37,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:37,093 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-13 21:42:37,094 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-13 21:42:37,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:42:37,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:42:37,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:37,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:37,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-13 21:42:37,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:37,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:42:37,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2025-03-13 21:42:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:42:37,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:37,736 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-13 21:42:37,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-13 21:42:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:42:37,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629563539] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:37,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:42:37,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 18 [2025-03-13 21:42:37,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222769086] [2025-03-13 21:42:37,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:37,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:42:37,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:37,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:42:37,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-13 21:42:37,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:37,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 363 transitions, 5907 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:37,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:37,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:37,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:38,384 INFO L124 PetriNetUnfolderBase]: 2547/4556 cut-off events. [2025-03-13 21:42:38,384 INFO L125 PetriNetUnfolderBase]: For 48047/48185 co-relation queries the response was YES. [2025-03-13 21:42:38,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29652 conditions, 4556 events. 2547/4556 cut-off events. For 48047/48185 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 31171 event pairs, 1005 based on Foata normal form. 34/4550 useless extension candidates. Maximal degree in co-relation 29579. Up to 3268 conditions per place. [2025-03-13 21:42:38,428 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 273 selfloop transitions, 106 changer transitions 0/384 dead transitions. [2025-03-13 21:42:38,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 384 transitions, 6840 flow [2025-03-13 21:42:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:42:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:42:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2025-03-13 21:42:38,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2025-03-13 21:42:38,429 INFO L175 Difference]: Start difference. First operand has 223 places, 363 transitions, 5907 flow. Second operand 7 states and 86 transitions. [2025-03-13 21:42:38,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 384 transitions, 6840 flow [2025-03-13 21:42:38,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 384 transitions, 6601 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-03-13 21:42:38,577 INFO L231 Difference]: Finished difference. Result has 222 places, 363 transitions, 5891 flow [2025-03-13 21:42:38,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5668, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5891, PETRI_PLACES=222, PETRI_TRANSITIONS=363} [2025-03-13 21:42:38,578 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 196 predicate places. [2025-03-13 21:42:38,578 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 363 transitions, 5891 flow [2025-03-13 21:42:38,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:38,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:38,578 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:38,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-13 21:42:38,778 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,SelfDestructingSolverStorable58 [2025-03-13 21:42:38,779 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:38,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:38,779 INFO L85 PathProgramCache]: Analyzing trace with hash 324619719, now seen corresponding path program 20 times [2025-03-13 21:42:38,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:38,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796953628] [2025-03-13 21:42:38,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:38,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:42:38,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-03-13 21:42:38,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:42:38,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:42:38,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:38,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796953628] [2025-03-13 21:42:38,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796953628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:38,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:38,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:42:38,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164738857] [2025-03-13 21:42:38,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:38,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:38,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:38,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:38,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:38,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:38,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 363 transitions, 5891 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:38,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:38,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:38,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:39,543 INFO L124 PetriNetUnfolderBase]: 2523/4519 cut-off events. [2025-03-13 21:42:39,543 INFO L125 PetriNetUnfolderBase]: For 46400/46507 co-relation queries the response was YES. [2025-03-13 21:42:39,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29445 conditions, 4519 events. 2523/4519 cut-off events. For 46400/46507 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 30909 event pairs, 921 based on Foata normal form. 34/4526 useless extension candidates. Maximal degree in co-relation 29371. Up to 2922 conditions per place. [2025-03-13 21:42:39,581 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 242 selfloop transitions, 154 changer transitions 3/404 dead transitions. [2025-03-13 21:42:39,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 404 transitions, 7044 flow [2025-03-13 21:42:39,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2025-03-13 21:42:39,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38492063492063494 [2025-03-13 21:42:39,582 INFO L175 Difference]: Start difference. First operand has 222 places, 363 transitions, 5891 flow. Second operand 9 states and 97 transitions. [2025-03-13 21:42:39,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 404 transitions, 7044 flow [2025-03-13 21:42:39,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 404 transitions, 6811 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-03-13 21:42:39,739 INFO L231 Difference]: Finished difference. Result has 225 places, 366 transitions, 5999 flow [2025-03-13 21:42:39,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5658, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5999, PETRI_PLACES=225, PETRI_TRANSITIONS=366} [2025-03-13 21:42:39,739 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 199 predicate places. [2025-03-13 21:42:39,739 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 366 transitions, 5999 flow [2025-03-13 21:42:39,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:39,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:39,739 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:39,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-13 21:42:39,740 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:39,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash -494724444, now seen corresponding path program 1 times [2025-03-13 21:42:39,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:39,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142433454] [2025-03-13 21:42:39,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:39,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:42:39,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:42:39,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:39,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:39,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:39,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142433454] [2025-03-13 21:42:39,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142433454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:39,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83309037] [2025-03-13 21:42:39,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:39,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:39,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:39,831 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-13 21:42:39,831 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-13 21:42:39,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:42:39,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:42:39,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:39,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:39,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-13 21:42:39,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:40,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:40,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83309037] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:40,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:40,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-13 21:42:40,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626061366] [2025-03-13 21:42:40,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:40,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-13 21:42:40,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:40,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-13 21:42:40,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2025-03-13 21:42:40,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:40,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 366 transitions, 5999 flow. Second operand has 21 states, 21 states have (on average 7.285714285714286) internal successors, (153), 21 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-13 21:42:40,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:40,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:40,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:41,156 INFO L124 PetriNetUnfolderBase]: 3868/6953 cut-off events. [2025-03-13 21:42:41,156 INFO L125 PetriNetUnfolderBase]: For 68179/68321 co-relation queries the response was YES. [2025-03-13 21:42:41,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45514 conditions, 6953 events. 3868/6953 cut-off events. For 68179/68321 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 51182 event pairs, 1779 based on Foata normal form. 11/6943 useless extension candidates. Maximal degree in co-relation 45440. Up to 4250 conditions per place. [2025-03-13 21:42:41,208 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 565 selfloop transitions, 18 changer transitions 1/589 dead transitions. [2025-03-13 21:42:41,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 589 transitions, 10567 flow [2025-03-13 21:42:41,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:42:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:42:41,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2025-03-13 21:42:41,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-13 21:42:41,209 INFO L175 Difference]: Start difference. First operand has 225 places, 366 transitions, 5999 flow. Second operand 11 states and 143 transitions. [2025-03-13 21:42:41,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 589 transitions, 10567 flow [2025-03-13 21:42:41,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 589 transitions, 10020 flow, removed 4 selfloop flow, removed 17 redundant places. [2025-03-13 21:42:41,457 INFO L231 Difference]: Finished difference. Result has 220 places, 378 transitions, 5960 flow [2025-03-13 21:42:41,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5650, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5960, PETRI_PLACES=220, PETRI_TRANSITIONS=378} [2025-03-13 21:42:41,457 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 194 predicate places. [2025-03-13 21:42:41,458 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 378 transitions, 5960 flow [2025-03-13 21:42:41,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.285714285714286) internal successors, (153), 21 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-13 21:42:41,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:41,458 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:41,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-13 21:42:41,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:41,658 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:41,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:41,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1045282210, now seen corresponding path program 2 times [2025-03-13 21:42:41,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:41,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429810224] [2025-03-13 21:42:41,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:41,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:41,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:42:41,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 24 statements. [2025-03-13 21:42:41,665 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:42:41,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:41,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:41,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429810224] [2025-03-13 21:42:41,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429810224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:41,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:41,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:42:41,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698136144] [2025-03-13 21:42:41,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:41,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:42:41,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:41,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:42:41,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:42:41,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:41,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 378 transitions, 5960 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:41,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:41,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:41,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:42,523 INFO L124 PetriNetUnfolderBase]: 4146/7414 cut-off events. [2025-03-13 21:42:42,524 INFO L125 PetriNetUnfolderBase]: For 77599/77777 co-relation queries the response was YES. [2025-03-13 21:42:42,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47204 conditions, 7414 events. 4146/7414 cut-off events. For 77599/77777 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 54844 event pairs, 459 based on Foata normal form. 14/7410 useless extension candidates. Maximal degree in co-relation 47136. Up to 3476 conditions per place. [2025-03-13 21:42:42,599 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 427 selfloop transitions, 53 changer transitions 3/488 dead transitions. [2025-03-13 21:42:42,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 488 transitions, 8239 flow [2025-03-13 21:42:42,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:42:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:42:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-03-13 21:42:42,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2025-03-13 21:42:42,600 INFO L175 Difference]: Start difference. First operand has 220 places, 378 transitions, 5960 flow. Second operand 5 states and 74 transitions. [2025-03-13 21:42:42,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 488 transitions, 8239 flow [2025-03-13 21:42:42,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 488 transitions, 8168 flow, removed 25 selfloop flow, removed 6 redundant places. [2025-03-13 21:42:42,950 INFO L231 Difference]: Finished difference. Result has 220 places, 388 transitions, 6269 flow [2025-03-13 21:42:42,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5893, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6269, PETRI_PLACES=220, PETRI_TRANSITIONS=388} [2025-03-13 21:42:42,950 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 194 predicate places. [2025-03-13 21:42:42,950 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 388 transitions, 6269 flow [2025-03-13 21:42:42,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:42,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:42,951 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:42,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-13 21:42:42,951 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:42,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:42,951 INFO L85 PathProgramCache]: Analyzing trace with hash 575149163, now seen corresponding path program 1 times [2025-03-13 21:42:42,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:42,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637373969] [2025-03-13 21:42:42,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:42,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:42,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:42:42,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:42:42,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:42,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:42,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:42,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637373969] [2025-03-13 21:42:42,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637373969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:42,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604482870] [2025-03-13 21:42:42,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:42,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:42,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:43,001 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-13 21:42:43,001 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-13 21:42:43,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:42:43,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:42:43,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:43,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:43,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:42:43,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:43,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:43,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604482870] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:43,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:43,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-13 21:42:43,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709569773] [2025-03-13 21:42:43,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:43,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:42:43,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:43,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:42:43,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:42:43,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:43,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 388 transitions, 6269 flow. Second operand has 16 states, 16 states have (on average 7.625) internal successors, (122), 16 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:43,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:43,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:43,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:43,914 INFO L124 PetriNetUnfolderBase]: 2499/4692 cut-off events. [2025-03-13 21:42:43,914 INFO L125 PetriNetUnfolderBase]: For 55614/55738 co-relation queries the response was YES. [2025-03-13 21:42:43,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31349 conditions, 4692 events. 2499/4692 cut-off events. For 55614/55738 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 34290 event pairs, 673 based on Foata normal form. 220/4905 useless extension candidates. Maximal degree in co-relation 31279. Up to 1187 conditions per place. [2025-03-13 21:42:43,955 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 357 selfloop transitions, 111 changer transitions 0/472 dead transitions. [2025-03-13 21:42:43,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 472 transitions, 8397 flow [2025-03-13 21:42:43,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-13 21:42:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-13 21:42:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 217 transitions. [2025-03-13 21:42:43,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2025-03-13 21:42:43,956 INFO L175 Difference]: Start difference. First operand has 220 places, 388 transitions, 6269 flow. Second operand 17 states and 217 transitions. [2025-03-13 21:42:43,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 472 transitions, 8397 flow [2025-03-13 21:42:44,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 472 transitions, 7980 flow, removed 182 selfloop flow, removed 12 redundant places. [2025-03-13 21:42:44,170 INFO L231 Difference]: Finished difference. Result has 212 places, 302 transitions, 5348 flow [2025-03-13 21:42:44,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4188, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5348, PETRI_PLACES=212, PETRI_TRANSITIONS=302} [2025-03-13 21:42:44,170 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 186 predicate places. [2025-03-13 21:42:44,170 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 302 transitions, 5348 flow [2025-03-13 21:42:44,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.625) internal successors, (122), 16 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:44,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:44,170 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:44,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-13 21:42:44,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:44,375 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:44,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:44,375 INFO L85 PathProgramCache]: Analyzing trace with hash 262990697, now seen corresponding path program 1 times [2025-03-13 21:42:44,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:44,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466039612] [2025-03-13 21:42:44,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:44,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:44,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:42:44,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:42:44,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:44,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:44,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:44,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466039612] [2025-03-13 21:42:44,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466039612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:44,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323650778] [2025-03-13 21:42:44,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:44,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:44,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:44,420 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:42:44,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-13 21:42:44,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:42:44,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:42:44,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:44,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:44,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:42:44,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:44,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:44,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323650778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:44,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:44,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-13 21:42:44,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792611161] [2025-03-13 21:42:44,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:44,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:42:44,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:44,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:42:44,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:42:44,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:44,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 302 transitions, 5348 flow. Second operand has 16 states, 16 states have (on average 8.0) internal successors, (128), 16 states have internal predecessors, (128), 0 states have call successors, (0), 0 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-13 21:42:44,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:44,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:44,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:45,149 INFO L124 PetriNetUnfolderBase]: 1611/3293 cut-off events. [2025-03-13 21:42:45,149 INFO L125 PetriNetUnfolderBase]: For 29555/29633 co-relation queries the response was YES. [2025-03-13 21:42:45,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20901 conditions, 3293 events. 1611/3293 cut-off events. For 29555/29633 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 24767 event pairs, 522 based on Foata normal form. 180/3465 useless extension candidates. Maximal degree in co-relation 20837. Up to 1187 conditions per place. [2025-03-13 21:42:45,172 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 154 selfloop transitions, 35 changer transitions 232/424 dead transitions. [2025-03-13 21:42:45,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 424 transitions, 7631 flow [2025-03-13 21:42:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-13 21:42:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-13 21:42:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 200 transitions. [2025-03-13 21:42:45,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42016806722689076 [2025-03-13 21:42:45,173 INFO L175 Difference]: Start difference. First operand has 212 places, 302 transitions, 5348 flow. Second operand 17 states and 200 transitions. [2025-03-13 21:42:45,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 424 transitions, 7631 flow [2025-03-13 21:42:45,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 424 transitions, 7564 flow, removed 9 selfloop flow, removed 9 redundant places. [2025-03-13 21:42:45,271 INFO L231 Difference]: Finished difference. Result has 225 places, 165 transitions, 2873 flow [2025-03-13 21:42:45,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5087, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2873, PETRI_PLACES=225, PETRI_TRANSITIONS=165} [2025-03-13 21:42:45,273 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 199 predicate places. [2025-03-13 21:42:45,273 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 165 transitions, 2873 flow [2025-03-13 21:42:45,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.0) internal successors, (128), 16 states have internal predecessors, (128), 0 states have call successors, (0), 0 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-13 21:42:45,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:45,273 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:45,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-13 21:42:45,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:45,474 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:45,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:45,474 INFO L85 PathProgramCache]: Analyzing trace with hash -976398347, now seen corresponding path program 3 times [2025-03-13 21:42:45,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:45,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361257164] [2025-03-13 21:42:45,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:42:45,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:45,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:42:45,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 24 statements. [2025-03-13 21:42:45,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:42:45,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-13 21:42:45,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:45,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361257164] [2025-03-13 21:42:45,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361257164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:45,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:45,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:42:45,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697179014] [2025-03-13 21:42:45,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:45,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:42:45,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:45,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:42:45,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:42:45,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:45,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 165 transitions, 2873 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:45,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:45,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:45,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:45,714 INFO L124 PetriNetUnfolderBase]: 937/1799 cut-off events. [2025-03-13 21:42:45,714 INFO L125 PetriNetUnfolderBase]: For 18565/18586 co-relation queries the response was YES. [2025-03-13 21:42:45,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11899 conditions, 1799 events. 937/1799 cut-off events. For 18565/18586 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 11093 event pairs, 103 based on Foata normal form. 3/1800 useless extension candidates. Maximal degree in co-relation 11827. Up to 747 conditions per place. [2025-03-13 21:42:45,727 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 130 selfloop transitions, 14 changer transitions 63/210 dead transitions. [2025-03-13 21:42:45,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 210 transitions, 3822 flow [2025-03-13 21:42:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:42:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:42:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-03-13 21:42:45,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-03-13 21:42:45,728 INFO L175 Difference]: Start difference. First operand has 225 places, 165 transitions, 2873 flow. Second operand 5 states and 76 transitions. [2025-03-13 21:42:45,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 210 transitions, 3822 flow [2025-03-13 21:42:45,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 210 transitions, 3451 flow, removed 112 selfloop flow, removed 26 redundant places. [2025-03-13 21:42:45,774 INFO L231 Difference]: Finished difference. Result has 172 places, 106 transitions, 1521 flow [2025-03-13 21:42:45,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2584, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1521, PETRI_PLACES=172, PETRI_TRANSITIONS=106} [2025-03-13 21:42:45,775 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 146 predicate places. [2025-03-13 21:42:45,775 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 106 transitions, 1521 flow [2025-03-13 21:42:45,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:45,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:45,775 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:45,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-13 21:42:45,775 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:45,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:45,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1712345616, now seen corresponding path program 2 times [2025-03-13 21:42:45,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:45,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772932675] [2025-03-13 21:42:45,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:45,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:45,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:42:45,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:42:45,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:45,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:45,859 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-13 21:42:45,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:45,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772932675] [2025-03-13 21:42:45,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772932675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:45,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590531601] [2025-03-13 21:42:45,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:45,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:45,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:45,861 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:42:45,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-13 21:42:45,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:42:45,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:42:45,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:45,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:45,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-13 21:42:45,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:45,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:46,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590531601] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:46,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:46,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2025-03-13 21:42:46,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206368515] [2025-03-13 21:42:46,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:46,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-13 21:42:46,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:46,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-13 21:42:46,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-13 21:42:46,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-13 21:42:46,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 106 transitions, 1521 flow. Second operand has 21 states, 21 states have (on average 6.142857142857143) internal successors, (129), 21 states have internal predecessors, (129), 0 states have call successors, (0), 0 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-13 21:42:46,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:46,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-13 21:42:46,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:46,485 INFO L124 PetriNetUnfolderBase]: 1238/2153 cut-off events. [2025-03-13 21:42:46,485 INFO L125 PetriNetUnfolderBase]: For 15649/15692 co-relation queries the response was YES. [2025-03-13 21:42:46,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13002 conditions, 2153 events. 1238/2153 cut-off events. For 15649/15692 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 12315 event pairs, 287 based on Foata normal form. 5/2158 useless extension candidates. Maximal degree in co-relation 12943. Up to 873 conditions per place. [2025-03-13 21:42:46,506 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 141 selfloop transitions, 33 changer transitions 13/189 dead transitions. [2025-03-13 21:42:46,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 189 transitions, 2791 flow [2025-03-13 21:42:46,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:42:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:42:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2025-03-13 21:42:46,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38311688311688313 [2025-03-13 21:42:46,509 INFO L175 Difference]: Start difference. First operand has 172 places, 106 transitions, 1521 flow. Second operand 11 states and 118 transitions. [2025-03-13 21:42:46,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 189 transitions, 2791 flow [2025-03-13 21:42:46,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 189 transitions, 2575 flow, removed 76 selfloop flow, removed 13 redundant places. [2025-03-13 21:42:46,538 INFO L231 Difference]: Finished difference. Result has 154 places, 110 transitions, 1534 flow [2025-03-13 21:42:46,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1534, PETRI_PLACES=154, PETRI_TRANSITIONS=110} [2025-03-13 21:42:46,539 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 128 predicate places. [2025-03-13 21:42:46,539 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 110 transitions, 1534 flow [2025-03-13 21:42:46,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.142857142857143) internal successors, (129), 21 states have internal predecessors, (129), 0 states have call successors, (0), 0 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-13 21:42:46,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:46,539 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:46,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-13 21:42:46,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2025-03-13 21:42:46,740 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:46,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:46,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1497121210, now seen corresponding path program 2 times [2025-03-13 21:42:46,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:46,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837128175] [2025-03-13 21:42:46,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:46,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:46,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:42:46,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:42:46,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:46,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:46,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:46,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837128175] [2025-03-13 21:42:46,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837128175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:46,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772693569] [2025-03-13 21:42:46,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:46,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:46,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:46,845 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:42:46,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-13 21:42:46,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:42:46,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:42:46,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:46,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:46,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-13 21:42:46,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:47,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:47,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772693569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:47,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:47,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-03-13 21:42:47,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186079404] [2025-03-13 21:42:47,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:47,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-13 21:42:47,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:47,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-13 21:42:47,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-03-13 21:42:47,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-13 21:42:47,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 110 transitions, 1534 flow. Second operand has 24 states, 24 states have (on average 6.25) internal successors, (150), 24 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-13 21:42:47,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:47,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-13 21:42:47,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:47,880 INFO L124 PetriNetUnfolderBase]: 3159/5493 cut-off events. [2025-03-13 21:42:47,881 INFO L125 PetriNetUnfolderBase]: For 34511/34609 co-relation queries the response was YES. [2025-03-13 21:42:47,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31102 conditions, 5493 events. 3159/5493 cut-off events. For 34511/34609 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 36249 event pairs, 621 based on Foata normal form. 138/5611 useless extension candidates. Maximal degree in co-relation 31049. Up to 1535 conditions per place. [2025-03-13 21:42:47,919 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 294 selfloop transitions, 75 changer transitions 0/372 dead transitions. [2025-03-13 21:42:47,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 372 transitions, 5593 flow [2025-03-13 21:42:47,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 21:42:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 21:42:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 208 transitions. [2025-03-13 21:42:47,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35374149659863946 [2025-03-13 21:42:47,920 INFO L175 Difference]: Start difference. First operand has 154 places, 110 transitions, 1534 flow. Second operand 21 states and 208 transitions. [2025-03-13 21:42:47,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 372 transitions, 5593 flow [2025-03-13 21:42:47,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 372 transitions, 5436 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-13 21:42:47,982 INFO L231 Difference]: Finished difference. Result has 169 places, 151 transitions, 2336 flow [2025-03-13 21:42:47,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2336, PETRI_PLACES=169, PETRI_TRANSITIONS=151} [2025-03-13 21:42:47,983 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 143 predicate places. [2025-03-13 21:42:47,983 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 151 transitions, 2336 flow [2025-03-13 21:42:47,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.25) internal successors, (150), 24 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-13 21:42:47,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:47,983 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:47,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-13 21:42:48,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-03-13 21:42:48,184 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:48,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash 988667838, now seen corresponding path program 3 times [2025-03-13 21:42:48,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:48,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513350428] [2025-03-13 21:42:48,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:42:48,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:48,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:42:48,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:42:48,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:42:48,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:48,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:48,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513350428] [2025-03-13 21:42:48,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513350428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:48,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758084346] [2025-03-13 21:42:48,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:42:48,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:48,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:48,276 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:42:48,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-13 21:42:48,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:42:48,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:42:48,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:42:48,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:48,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-13 21:42:48,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:48,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:48,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758084346] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:48,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:42:48,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 21 [2025-03-13 21:42:48,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917997007] [2025-03-13 21:42:48,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:48,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:48,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:48,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:48,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-03-13 21:42:48,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-13 21:42:48,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 151 transitions, 2336 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-13 21:42:48,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:48,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-13 21:42:48,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:49,186 INFO L124 PetriNetUnfolderBase]: 3641/6403 cut-off events. [2025-03-13 21:42:49,187 INFO L125 PetriNetUnfolderBase]: For 43655/43669 co-relation queries the response was YES. [2025-03-13 21:42:49,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37377 conditions, 6403 events. 3641/6403 cut-off events. For 43655/43669 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 43788 event pairs, 1095 based on Foata normal form. 20/6421 useless extension candidates. Maximal degree in co-relation 37321. Up to 2227 conditions per place. [2025-03-13 21:42:49,234 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 216 selfloop transitions, 41 changer transitions 12/271 dead transitions. [2025-03-13 21:42:49,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 271 transitions, 4280 flow [2025-03-13 21:42:49,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:42:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:42:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2025-03-13 21:42:49,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42207792207792205 [2025-03-13 21:42:49,235 INFO L175 Difference]: Start difference. First operand has 169 places, 151 transitions, 2336 flow. Second operand 11 states and 130 transitions. [2025-03-13 21:42:49,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 271 transitions, 4280 flow [2025-03-13 21:42:49,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 271 transitions, 4188 flow, removed 38 selfloop flow, removed 6 redundant places. [2025-03-13 21:42:49,316 INFO L231 Difference]: Finished difference. Result has 177 places, 157 transitions, 2562 flow [2025-03-13 21:42:49,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2292, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2562, PETRI_PLACES=177, PETRI_TRANSITIONS=157} [2025-03-13 21:42:49,317 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 151 predicate places. [2025-03-13 21:42:49,317 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 157 transitions, 2562 flow [2025-03-13 21:42:49,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-13 21:42:49,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:49,317 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:49,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-13 21:42:49,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2025-03-13 21:42:49,518 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:49,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:49,518 INFO L85 PathProgramCache]: Analyzing trace with hash 90673136, now seen corresponding path program 4 times [2025-03-13 21:42:49,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:49,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472729869] [2025-03-13 21:42:49,518 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:42:49,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:49,524 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:42:49,525 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 26 statements. [2025-03-13 21:42:49,525 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:42:49,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:49,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:49,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472729869] [2025-03-13 21:42:49,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472729869] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:49,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288887026] [2025-03-13 21:42:49,553 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:42:49,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:49,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:49,555 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:42:49,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-13 21:42:49,617 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:42:49,624 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 26 statements. [2025-03-13 21:42:49,624 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:42:49,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:49,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-13 21:42:49,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:49,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:49,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288887026] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:49,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:49,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-13 21:42:49,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977730412] [2025-03-13 21:42:49,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:49,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:42:49,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:49,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:42:49,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:42:49,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-13 21:42:49,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 157 transitions, 2562 flow. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:49,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:49,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-13 21:42:49,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:50,911 INFO L124 PetriNetUnfolderBase]: 4769/8359 cut-off events. [2025-03-13 21:42:50,911 INFO L125 PetriNetUnfolderBase]: For 61413/61413 co-relation queries the response was YES. [2025-03-13 21:42:50,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47090 conditions, 8359 events. 4769/8359 cut-off events. For 61413/61413 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 59126 event pairs, 560 based on Foata normal form. 96/8455 useless extension candidates. Maximal degree in co-relation 47030. Up to 2095 conditions per place. [2025-03-13 21:42:50,965 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 350 selfloop transitions, 130 changer transitions 6/487 dead transitions. [2025-03-13 21:42:50,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 487 transitions, 7211 flow [2025-03-13 21:42:50,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-13 21:42:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-13 21:42:50,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 292 transitions. [2025-03-13 21:42:50,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2025-03-13 21:42:50,969 INFO L175 Difference]: Start difference. First operand has 177 places, 157 transitions, 2562 flow. Second operand 24 states and 292 transitions. [2025-03-13 21:42:50,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 487 transitions, 7211 flow [2025-03-13 21:42:51,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 487 transitions, 7040 flow, removed 53 selfloop flow, removed 7 redundant places. [2025-03-13 21:42:51,121 INFO L231 Difference]: Finished difference. Result has 205 places, 229 transitions, 4101 flow [2025-03-13 21:42:51,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2502, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4101, PETRI_PLACES=205, PETRI_TRANSITIONS=229} [2025-03-13 21:42:51,122 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 179 predicate places. [2025-03-13 21:42:51,122 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 229 transitions, 4101 flow [2025-03-13 21:42:51,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:51,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:51,122 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:51,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-13 21:42:51,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:51,323 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:51,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:51,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1812987746, now seen corresponding path program 5 times [2025-03-13 21:42:51,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:51,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909272983] [2025-03-13 21:42:51,324 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:42:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:51,333 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:42:51,336 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:42:51,336 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:51,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:51,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:51,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909272983] [2025-03-13 21:42:51,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909272983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:51,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195207195] [2025-03-13 21:42:51,408 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:42:51,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:51,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:51,410 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:42:51,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-13 21:42:51,475 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:42:51,493 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:42:51,494 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:51,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:51,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-13 21:42:51,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:51,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:51,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195207195] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:51,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:51,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-13 21:42:51,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763299892] [2025-03-13 21:42:51,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:51,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-13 21:42:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:51,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-13 21:42:51,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-03-13 21:42:51,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-13 21:42:51,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 229 transitions, 4101 flow. Second operand has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-13 21:42:51,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:51,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-13 21:42:51,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:52,819 INFO L124 PetriNetUnfolderBase]: 4645/8113 cut-off events. [2025-03-13 21:42:52,819 INFO L125 PetriNetUnfolderBase]: For 76167/76167 co-relation queries the response was YES. [2025-03-13 21:42:52,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50071 conditions, 8113 events. 4645/8113 cut-off events. For 76167/76167 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 56402 event pairs, 1000 based on Foata normal form. 140/8253 useless extension candidates. Maximal degree in co-relation 49999. Up to 2160 conditions per place. [2025-03-13 21:42:52,898 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 272 selfloop transitions, 122 changer transitions 0/395 dead transitions. [2025-03-13 21:42:52,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 395 transitions, 7003 flow [2025-03-13 21:42:52,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-13 21:42:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-13 21:42:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 161 transitions. [2025-03-13 21:42:52,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.359375 [2025-03-13 21:42:52,898 INFO L175 Difference]: Start difference. First operand has 205 places, 229 transitions, 4101 flow. Second operand 16 states and 161 transitions. [2025-03-13 21:42:52,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 395 transitions, 7003 flow [2025-03-13 21:42:53,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 395 transitions, 6627 flow, removed 84 selfloop flow, removed 13 redundant places. [2025-03-13 21:42:53,199 INFO L231 Difference]: Finished difference. Result has 206 places, 245 transitions, 4362 flow [2025-03-13 21:42:53,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3752, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4362, PETRI_PLACES=206, PETRI_TRANSITIONS=245} [2025-03-13 21:42:53,200 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 180 predicate places. [2025-03-13 21:42:53,200 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 245 transitions, 4362 flow [2025-03-13 21:42:53,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-13 21:42:53,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:53,200 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:53,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-13 21:42:53,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2025-03-13 21:42:53,401 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:53,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:53,402 INFO L85 PathProgramCache]: Analyzing trace with hash -238089059, now seen corresponding path program 1 times [2025-03-13 21:42:53,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:53,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142281101] [2025-03-13 21:42:53,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:53,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:53,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:42:53,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:42:53,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:53,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:53,691 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-13 21:42:53,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:53,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142281101] [2025-03-13 21:42:53,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142281101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:53,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912828957] [2025-03-13 21:42:53,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:53,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:53,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:53,693 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:42:53,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-13 21:42:53,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:42:53,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:42:53,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:53,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:53,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-13 21:42:53,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:53,856 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-13 21:42:53,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 24 [2025-03-13 21:42:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:53,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:54,055 INFO L349 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-03-13 21:42:54,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 70 [2025-03-13 21:42:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:54,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912828957] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:54,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:54,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 25 [2025-03-13 21:42:54,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156075889] [2025-03-13 21:42:54,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:54,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-13 21:42:54,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:54,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-13 21:42:54,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-03-13 21:42:54,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:54,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 245 transitions, 4362 flow. Second operand has 25 states, 25 states have (on average 7.28) internal successors, (182), 25 states have internal predecessors, (182), 0 states have call successors, (0), 0 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-13 21:42:54,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:54,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:54,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:55,509 INFO L124 PetriNetUnfolderBase]: 4265/7652 cut-off events. [2025-03-13 21:42:55,509 INFO L125 PetriNetUnfolderBase]: For 71936/72097 co-relation queries the response was YES. [2025-03-13 21:42:55,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47270 conditions, 7652 events. 4265/7652 cut-off events. For 71936/72097 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 55718 event pairs, 1150 based on Foata normal form. 10/7605 useless extension candidates. Maximal degree in co-relation 47205. Up to 3197 conditions per place. [2025-03-13 21:42:55,575 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 260 selfloop transitions, 74 changer transitions 7/354 dead transitions. [2025-03-13 21:42:55,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 354 transitions, 6495 flow [2025-03-13 21:42:55,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 21:42:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 21:42:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 154 transitions. [2025-03-13 21:42:55,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2025-03-13 21:42:55,576 INFO L175 Difference]: Start difference. First operand has 206 places, 245 transitions, 4362 flow. Second operand 15 states and 154 transitions. [2025-03-13 21:42:55,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 354 transitions, 6495 flow [2025-03-13 21:42:55,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 354 transitions, 6364 flow, removed 35 selfloop flow, removed 8 redundant places. [2025-03-13 21:42:55,784 INFO L231 Difference]: Finished difference. Result has 217 places, 253 transitions, 4610 flow [2025-03-13 21:42:55,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4247, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4610, PETRI_PLACES=217, PETRI_TRANSITIONS=253} [2025-03-13 21:42:55,785 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 191 predicate places. [2025-03-13 21:42:55,785 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 253 transitions, 4610 flow [2025-03-13 21:42:55,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.28) internal successors, (182), 25 states have internal predecessors, (182), 0 states have call successors, (0), 0 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-13 21:42:55,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:55,785 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:55,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-03-13 21:42:55,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable70 [2025-03-13 21:42:55,986 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:55,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:55,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1504747097, now seen corresponding path program 2 times [2025-03-13 21:42:55,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:55,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281493555] [2025-03-13 21:42:55,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:55,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:55,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:42:56,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:42:56,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:56,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:56,461 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-13 21:42:56,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:56,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281493555] [2025-03-13 21:42:56,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281493555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:56,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604200936] [2025-03-13 21:42:56,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:56,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:56,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:56,464 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:42:56,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-13 21:42:56,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:42:56,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:42:56,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:56,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:56,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-13 21:42:56,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:56,777 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 21:42:56,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-13 21:42:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:42:56,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:57,029 INFO L349 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-03-13 21:42:57,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 70 [2025-03-13 21:42:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:42:57,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604200936] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:57,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:57,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 28 [2025-03-13 21:42:57,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550058551] [2025-03-13 21:42:57,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:57,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-13 21:42:57,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:57,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-13 21:42:57,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2025-03-13 21:42:57,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:42:57,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 253 transitions, 4610 flow. Second operand has 28 states, 28 states have (on average 7.392857142857143) internal successors, (207), 28 states have internal predecessors, (207), 0 states have call successors, (0), 0 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-13 21:42:57,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:57,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:42:57,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:00,044 INFO L124 PetriNetUnfolderBase]: 8889/16028 cut-off events. [2025-03-13 21:43:00,044 INFO L125 PetriNetUnfolderBase]: For 171310/171543 co-relation queries the response was YES. [2025-03-13 21:43:00,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101600 conditions, 16028 events. 8889/16028 cut-off events. For 171310/171543 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 132502 event pairs, 1436 based on Foata normal form. 22/15987 useless extension candidates. Maximal degree in co-relation 101531. Up to 3873 conditions per place. [2025-03-13 21:43:00,188 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 608 selfloop transitions, 219 changer transitions 13/853 dead transitions. [2025-03-13 21:43:00,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 853 transitions, 15984 flow [2025-03-13 21:43:00,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-13 21:43:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-13 21:43:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 368 transitions. [2025-03-13 21:43:00,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2025-03-13 21:43:00,189 INFO L175 Difference]: Start difference. First operand has 217 places, 253 transitions, 4610 flow. Second operand 32 states and 368 transitions. [2025-03-13 21:43:00,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 853 transitions, 15984 flow [2025-03-13 21:43:00,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 853 transitions, 15662 flow, removed 86 selfloop flow, removed 9 redundant places. [2025-03-13 21:43:00,891 INFO L231 Difference]: Finished difference. Result has 253 places, 391 transitions, 7815 flow [2025-03-13 21:43:00,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4462, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=7815, PETRI_PLACES=253, PETRI_TRANSITIONS=391} [2025-03-13 21:43:00,892 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 227 predicate places. [2025-03-13 21:43:00,892 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 391 transitions, 7815 flow [2025-03-13 21:43:00,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.392857142857143) internal successors, (207), 28 states have internal predecessors, (207), 0 states have call successors, (0), 0 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-13 21:43:00,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:00,892 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:00,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-13 21:43:01,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:43:01,092 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:43:01,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:01,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1487153441, now seen corresponding path program 3 times [2025-03-13 21:43:01,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:01,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157269465] [2025-03-13 21:43:01,093 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:43:01,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:01,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:43:01,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:43:01,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:43:01,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:43:01,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:01,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157269465] [2025-03-13 21:43:01,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157269465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:43:01,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960062260] [2025-03-13 21:43:01,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:43:01,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:43:01,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:43:01,351 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:43:01,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-13 21:43:01,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:43:01,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:43:01,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:43:01,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:01,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-13 21:43:01,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:43:01,598 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 21:43:01,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-13 21:43:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:43:01,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:43:01,784 INFO L349 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-03-13 21:43:01,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 70 [2025-03-13 21:43:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:43:01,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960062260] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:43:01,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:43:01,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 30 [2025-03-13 21:43:01,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10815965] [2025-03-13 21:43:01,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:43:01,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-13 21:43:01,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:01,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-13 21:43:01,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2025-03-13 21:43:01,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:43:01,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 391 transitions, 7815 flow. Second operand has 30 states, 30 states have (on average 7.433333333333334) internal successors, (223), 30 states have internal predecessors, (223), 0 states have call successors, (0), 0 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-13 21:43:01,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:01,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:43:01,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:04,788 INFO L124 PetriNetUnfolderBase]: 9073/16420 cut-off events. [2025-03-13 21:43:04,789 INFO L125 PetriNetUnfolderBase]: For 208047/208232 co-relation queries the response was YES. [2025-03-13 21:43:04,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110274 conditions, 16420 events. 9073/16420 cut-off events. For 208047/208232 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 136717 event pairs, 996 based on Foata normal form. 26/16417 useless extension candidates. Maximal degree in co-relation 110191. Up to 3905 conditions per place. [2025-03-13 21:43:04,993 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 599 selfloop transitions, 233 changer transitions 18/863 dead transitions. [2025-03-13 21:43:04,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 863 transitions, 17092 flow [2025-03-13 21:43:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-13 21:43:04,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-13 21:43:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 361 transitions. [2025-03-13 21:43:04,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4029017857142857 [2025-03-13 21:43:04,994 INFO L175 Difference]: Start difference. First operand has 253 places, 391 transitions, 7815 flow. Second operand 32 states and 361 transitions. [2025-03-13 21:43:04,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 863 transitions, 17092 flow [2025-03-13 21:43:06,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 863 transitions, 16592 flow, removed 165 selfloop flow, removed 7 redundant places. [2025-03-13 21:43:06,345 INFO L231 Difference]: Finished difference. Result has 279 places, 417 transitions, 8562 flow [2025-03-13 21:43:06,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=7401, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=207, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=8562, PETRI_PLACES=279, PETRI_TRANSITIONS=417} [2025-03-13 21:43:06,345 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 253 predicate places. [2025-03-13 21:43:06,345 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 417 transitions, 8562 flow [2025-03-13 21:43:06,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.433333333333334) internal successors, (223), 30 states have internal predecessors, (223), 0 states have call successors, (0), 0 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-13 21:43:06,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:06,346 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:06,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-03-13 21:43:06,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:43:06,546 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:43:06,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:06,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1041535459, now seen corresponding path program 4 times [2025-03-13 21:43:06,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:06,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380264368] [2025-03-13 21:43:06,547 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:43:06,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:06,552 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:43:06,556 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:43:06,556 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:43:06,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:43:06,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:06,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380264368] [2025-03-13 21:43:06,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380264368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:43:06,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029345381] [2025-03-13 21:43:06,650 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:43:06,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:43:06,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:43:06,652 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:43:06,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-13 21:43:06,725 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:43:06,745 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:43:06,745 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:43:06,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:06,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-13 21:43:06,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:43:06,924 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-13 21:43:06,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 24 [2025-03-13 21:43:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:43:06,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:43:07,111 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-13 21:43:07,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 74 [2025-03-13 21:43:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:43:07,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029345381] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:43:07,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:43:07,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 9] total 22 [2025-03-13 21:43:07,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143560611] [2025-03-13 21:43:07,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:43:07,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-13 21:43:07,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:07,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-13 21:43:07,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2025-03-13 21:43:07,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:43:07,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 417 transitions, 8562 flow. Second operand has 22 states, 22 states have (on average 7.636363636363637) internal successors, (168), 22 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-13 21:43:07,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:07,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:43:07,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand