./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 735b3cc8 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-?-735b3cc-m [2025-03-14 01:00:22,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:00:22,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:00:22,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:00:22,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:00:22,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:00:22,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:00:22,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:00:22,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:00:22,661 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:00:22,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:00:22,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:00:22,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:00:22,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:00:22,662 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:00:22,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:00:22,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:00:22,662 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:00:22,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:00:22,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:00:22,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:00:22,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:00:22,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:00:22,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:00:22,662 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:00:22,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:00:22,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:00:22,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:00:22,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:00:22,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:00:22,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:00:22,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:00:22,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:00:22,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:00:22,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:00:22,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:00:22,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:00:22,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:00:22,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:00:22,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:00:22,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:00:22,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:00:22,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:00:22,665 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-14 01:00:22,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:00:22,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:00:22,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:00:22,883 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:00:22,883 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:00:22,884 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-14 01:00:23,975 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78189947a/7e8222675e564463a5d6222900113860/FLAG662e5f1ee [2025-03-14 01:00:24,179 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:00:24,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-14 01:00:24,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78189947a/7e8222675e564463a5d6222900113860/FLAG662e5f1ee [2025-03-14 01:00:24,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78189947a/7e8222675e564463a5d6222900113860 [2025-03-14 01:00:24,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:00:24,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:00:24,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:00:24,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:00:24,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:00:24,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:00:24" (1/1) ... [2025-03-14 01:00:24,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2647395d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:24, skipping insertion in model container [2025-03-14 01:00:24,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:00:24" (1/1) ... [2025-03-14 01:00:24,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:00:24,324 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-14 01:00:24,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:00:24,342 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:00:24,360 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-14 01:00:24,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:00:24,378 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:00:24,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:24 WrapperNode [2025-03-14 01:00:24,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:00:24,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:00:24,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:00:24,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:00:24,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:24" (1/1) ... [2025-03-14 01:00:24,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:24" (1/1) ... [2025-03-14 01:00:24,410 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 181 [2025-03-14 01:00:24,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:00:24,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:00:24,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:00:24,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:00:24,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:24" (1/1) ... [2025-03-14 01:00:24,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:24" (1/1) ... [2025-03-14 01:00:24,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:24" (1/1) ... [2025-03-14 01:00:24,440 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-14 01:00:24,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:24" (1/1) ... [2025-03-14 01:00:24,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:24" (1/1) ... [2025-03-14 01:00:24,448 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:24" (1/1) ... [2025-03-14 01:00:24,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:24" (1/1) ... [2025-03-14 01:00:24,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:24" (1/1) ... [2025-03-14 01:00:24,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:24" (1/1) ... [2025-03-14 01:00:24,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:00:24,452 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:00:24,452 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:00:24,452 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:00:24,453 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:24" (1/1) ... [2025-03-14 01:00:24,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:00:24,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:24,482 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-14 01:00:24,484 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-14 01:00:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:00:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:00:24,505 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:00:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:00:24,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:00:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:00:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:00:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:00:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:00:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:00:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:00:24,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:00:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:00:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:00:24,507 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:00:24,592 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:00:24,593 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:00:24,825 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:00:24,826 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:00:24,826 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:00:25,005 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:00:25,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:00:25 BoogieIcfgContainer [2025-03-14 01:00:25,006 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:00:25,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:00:25,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:00:25,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:00:25,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:00:24" (1/3) ... [2025-03-14 01:00:25,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2835bae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:00:25, skipping insertion in model container [2025-03-14 01:00:25,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:24" (2/3) ... [2025-03-14 01:00:25,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2835bae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:00:25, skipping insertion in model container [2025-03-14 01:00:25,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:00:25" (3/3) ... [2025-03-14 01:00:25,012 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2025-03-14 01:00:25,023 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:00:25,024 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-14 01:00:25,024 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:00:25,077 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:00:25,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 70 flow [2025-03-14 01:00:25,126 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-03-14 01:00:25,130 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:00:25,133 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-14 01:00:25,136 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 28 transitions, 70 flow [2025-03-14 01:00:25,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 25 transitions, 62 flow [2025-03-14 01:00:25,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:00:25,159 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;@5a6d3a67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:00:25,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 01:00:25,172 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:00:25,173 INFO L124 PetriNetUnfolderBase]: 6/24 cut-off events. [2025-03-14 01:00:25,173 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:00:25,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:25,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:25,174 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-14 01:00:25,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:25,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1347315461, now seen corresponding path program 1 times [2025-03-14 01:00:25,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:25,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423630829] [2025-03-14 01:00:25,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:25,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:25,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 01:00:25,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 01:00:25,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:25,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:25,692 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-14 01:00:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:25,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423630829] [2025-03-14 01:00:25,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423630829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:25,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:25,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:00:25,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516671918] [2025-03-14 01:00:25,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:25,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:00:25,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:25,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:00:25,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:00:25,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:25,747 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-14 01:00:25,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:25,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:25,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:25,977 INFO L124 PetriNetUnfolderBase]: 230/408 cut-off events. [2025-03-14 01:00:25,977 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-14 01:00:25,978 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-14 01:00:25,983 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 58 selfloop transitions, 10 changer transitions 1/72 dead transitions. [2025-03-14 01:00:25,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 72 transitions, 324 flow [2025-03-14 01:00:25,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 01:00:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 01:00:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2025-03-14 01:00:25,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49107142857142855 [2025-03-14 01:00:25,995 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 62 flow. Second operand 8 states and 110 transitions. [2025-03-14 01:00:25,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 72 transitions, 324 flow [2025-03-14 01:00:26,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 72 transitions, 296 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:00:26,002 INFO L231 Difference]: Finished difference. Result has 33 places, 34 transitions, 123 flow [2025-03-14 01:00:26,005 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-14 01:00:26,007 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2025-03-14 01:00:26,007 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 34 transitions, 123 flow [2025-03-14 01:00:26,009 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-14 01:00:26,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:26,009 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-14 01:00:26,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:00:26,009 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-14 01:00:26,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:26,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2132697743, now seen corresponding path program 1 times [2025-03-14 01:00:26,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:26,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651377495] [2025-03-14 01:00:26,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:26,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:26,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 01:00:26,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 01:00:26,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:26,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:26,206 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-14 01:00:26,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651377495] [2025-03-14 01:00:26,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651377495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488585162] [2025-03-14 01:00:26,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:26,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:26,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:26,209 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-14 01:00:26,211 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-14 01:00:26,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 01:00:26,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 01:00:26,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:26,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:26,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-14 01:00:26,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:26,389 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-14 01:00:26,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:26,487 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-14 01:00:26,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488585162] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:26,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:26,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 14 [2025-03-14 01:00:26,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292277205] [2025-03-14 01:00:26,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:26,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:00:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:26,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:00:26,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:00:26,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:26,514 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-14 01:00:26,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:26,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:26,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:26,776 INFO L124 PetriNetUnfolderBase]: 495/876 cut-off events. [2025-03-14 01:00:26,776 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-03-14 01:00:26,778 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-14 01:00:26,783 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 83 selfloop transitions, 12 changer transitions 1/99 dead transitions. [2025-03-14 01:00:26,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 99 transitions, 508 flow [2025-03-14 01:00:26,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 01:00:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 01:00:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2025-03-14 01:00:26,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-14 01:00:26,787 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 123 flow. Second operand 8 states and 126 transitions. [2025-03-14 01:00:26,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 99 transitions, 508 flow [2025-03-14 01:00:26,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 99 transitions, 504 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-14 01:00:26,789 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 210 flow [2025-03-14 01:00:26,789 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-14 01:00:26,790 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2025-03-14 01:00:26,790 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 210 flow [2025-03-14 01:00:26,790 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-14 01:00:26,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:26,790 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-14 01:00:26,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:00:26,990 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-14 01:00:26,991 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-14 01:00:26,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:26,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1394888682, now seen corresponding path program 1 times [2025-03-14 01:00:26,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:26,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264712033] [2025-03-14 01:00:26,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:26,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:26,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 01:00:27,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 01:00:27,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:27,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:27,069 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-14 01:00:27,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:27,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264712033] [2025-03-14 01:00:27,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264712033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:27,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:27,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:00:27,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433945375] [2025-03-14 01:00:27,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:27,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:27,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:27,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:27,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:00:27,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:27,078 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-14 01:00:27,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:27,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:27,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:27,202 INFO L124 PetriNetUnfolderBase]: 372/703 cut-off events. [2025-03-14 01:00:27,203 INFO L125 PetriNetUnfolderBase]: For 496/496 co-relation queries the response was YES. [2025-03-14 01:00:27,205 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-14 01:00:27,208 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 58 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2025-03-14 01:00:27,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 431 flow [2025-03-14 01:00:27,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:00:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:00:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-03-14 01:00:27,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2025-03-14 01:00:27,210 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 210 flow. Second operand 5 states and 73 transitions. [2025-03-14 01:00:27,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 431 flow [2025-03-14 01:00:27,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 410 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-14 01:00:27,215 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 212 flow [2025-03-14 01:00:27,215 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-14 01:00:27,215 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2025-03-14 01:00:27,215 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 212 flow [2025-03-14 01:00:27,215 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-14 01:00:27,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:27,216 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-14 01:00:27,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:00:27,216 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-14 01:00:27,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:27,216 INFO L85 PathProgramCache]: Analyzing trace with hash -208855790, now seen corresponding path program 1 times [2025-03-14 01:00:27,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:27,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084394203] [2025-03-14 01:00:27,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:27,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:27,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 01:00:27,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 01:00:27,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:27,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:27,289 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-14 01:00:27,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:27,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084394203] [2025-03-14 01:00:27,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084394203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:27,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:27,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:00:27,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207078670] [2025-03-14 01:00:27,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:27,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:27,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:27,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:27,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:00:27,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:27,298 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-14 01:00:27,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:27,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:27,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:27,410 INFO L124 PetriNetUnfolderBase]: 303/578 cut-off events. [2025-03-14 01:00:27,410 INFO L125 PetriNetUnfolderBase]: For 436/436 co-relation queries the response was YES. [2025-03-14 01:00:27,411 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-14 01:00:27,413 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 48 selfloop transitions, 6 changer transitions 2/59 dead transitions. [2025-03-14 01:00:27,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 389 flow [2025-03-14 01:00:27,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:00:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:00:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2025-03-14 01:00:27,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2025-03-14 01:00:27,414 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 212 flow. Second operand 6 states and 75 transitions. [2025-03-14 01:00:27,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 389 flow [2025-03-14 01:00:27,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 372 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-14 01:00:27,417 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 222 flow [2025-03-14 01:00:27,417 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-14 01:00:27,418 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 24 predicate places. [2025-03-14 01:00:27,418 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 222 flow [2025-03-14 01:00:27,418 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-14 01:00:27,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:27,418 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-14 01:00:27,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:00:27,418 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-14 01:00:27,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:27,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1144005200, now seen corresponding path program 1 times [2025-03-14 01:00:27,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:27,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517633452] [2025-03-14 01:00:27,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:27,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:27,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 01:00:27,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 01:00:27,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:27,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:27,529 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-14 01:00:27,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:27,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517633452] [2025-03-14 01:00:27,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517633452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:27,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305487430] [2025-03-14 01:00:27,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:27,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:27,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:27,532 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-14 01:00:27,534 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-14 01:00:27,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 01:00:27,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 01:00:27,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:27,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:27,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-14 01:00:27,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:27,725 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-14 01:00:27,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:27,795 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-14 01:00:27,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305487430] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:27,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:27,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-14 01:00:27,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135709937] [2025-03-14 01:00:27,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:27,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:00:27,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:27,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:00:27,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-14 01:00:27,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:27,813 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-14 01:00:27,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:27,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:27,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:27,978 INFO L124 PetriNetUnfolderBase]: 286/540 cut-off events. [2025-03-14 01:00:27,978 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2025-03-14 01:00:27,979 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-14 01:00:27,982 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 46 selfloop transitions, 5 changer transitions 7/61 dead transitions. [2025-03-14 01:00:27,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 395 flow [2025-03-14 01:00:27,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:00:27,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:00:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2025-03-14 01:00:27,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42346938775510207 [2025-03-14 01:00:27,983 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 222 flow. Second operand 7 states and 83 transitions. [2025-03-14 01:00:27,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 395 flow [2025-03-14 01:00:27,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 380 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-14 01:00:27,986 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 205 flow [2025-03-14 01:00:27,986 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-14 01:00:27,989 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2025-03-14 01:00:27,989 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 205 flow [2025-03-14 01:00:27,989 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-14 01:00:27,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:27,989 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-14 01:00:27,996 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-14 01:00:28,190 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-14 01:00:28,190 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-14 01:00:28,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:28,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1132307270, now seen corresponding path program 2 times [2025-03-14 01:00:28,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:28,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077171756] [2025-03-14 01:00:28,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:28,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:28,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-14 01:00:28,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 18 statements. [2025-03-14 01:00:28,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:00:28,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:28,309 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-14 01:00:28,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:28,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077171756] [2025-03-14 01:00:28,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077171756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:28,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:28,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:00:28,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299631176] [2025-03-14 01:00:28,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:28,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:00:28,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:28,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:00:28,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:00:28,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:28,320 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-14 01:00:28,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:28,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:28,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:28,467 INFO L124 PetriNetUnfolderBase]: 275/511 cut-off events. [2025-03-14 01:00:28,468 INFO L125 PetriNetUnfolderBase]: For 359/359 co-relation queries the response was YES. [2025-03-14 01:00:28,468 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-14 01:00:28,470 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 31 selfloop transitions, 5 changer transitions 20/59 dead transitions. [2025-03-14 01:00:28,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 59 transitions, 370 flow [2025-03-14 01:00:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 01:00:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 01:00:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2025-03-14 01:00:28,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39732142857142855 [2025-03-14 01:00:28,471 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 205 flow. Second operand 8 states and 89 transitions. [2025-03-14 01:00:28,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 59 transitions, 370 flow [2025-03-14 01:00:28,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 357 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-14 01:00:28,473 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 173 flow [2025-03-14 01:00:28,473 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-14 01:00:28,474 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2025-03-14 01:00:28,474 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 173 flow [2025-03-14 01:00:28,474 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-14 01:00:28,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:28,474 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-14 01:00:28,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:00:28,474 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-14 01:00:28,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:28,475 INFO L85 PathProgramCache]: Analyzing trace with hash -612047067, now seen corresponding path program 2 times [2025-03-14 01:00:28,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:28,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176136231] [2025-03-14 01:00:28,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:28,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:28,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-14 01:00:28,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 18 statements. [2025-03-14 01:00:28,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:00:28,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:28,605 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-14 01:00:28,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:28,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176136231] [2025-03-14 01:00:28,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176136231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:28,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:28,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:00:28,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312291518] [2025-03-14 01:00:28,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:28,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:00:28,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:28,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:00:28,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:00:28,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:28,624 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-14 01:00:28,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:28,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:28,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:28,807 INFO L124 PetriNetUnfolderBase]: 272/498 cut-off events. [2025-03-14 01:00:28,807 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2025-03-14 01:00:28,809 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-14 01:00:28,811 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 59 selfloop transitions, 15 changer transitions 1/78 dead transitions. [2025-03-14 01:00:28,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 461 flow [2025-03-14 01:00:28,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:28,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2025-03-14 01:00:28,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2025-03-14 01:00:28,812 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 173 flow. Second operand 9 states and 118 transitions. [2025-03-14 01:00:28,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 461 flow [2025-03-14 01:00:28,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 78 transitions, 415 flow, removed 17 selfloop flow, removed 9 redundant places. [2025-03-14 01:00:28,814 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 235 flow [2025-03-14 01:00:28,814 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-14 01:00:28,816 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2025-03-14 01:00:28,816 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 235 flow [2025-03-14 01:00:28,817 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-14 01:00:28,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:28,817 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-14 01:00:28,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:00:28,817 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-14 01:00:28,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:28,817 INFO L85 PathProgramCache]: Analyzing trace with hash -751695230, now seen corresponding path program 1 times [2025-03-14 01:00:28,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:28,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004539682] [2025-03-14 01:00:28,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:28,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:28,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 01:00:28,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 01:00:28,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:28,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:28,906 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-14 01:00:28,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:28,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004539682] [2025-03-14 01:00:28,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004539682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:28,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:28,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:00:28,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092407117] [2025-03-14 01:00:28,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:28,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:28,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:28,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:28,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:00:28,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:28,914 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-14 01:00:28,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:28,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:28,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:28,997 INFO L124 PetriNetUnfolderBase]: 172/339 cut-off events. [2025-03-14 01:00:28,998 INFO L125 PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES. [2025-03-14 01:00:28,998 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-14 01:00:29,000 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 45 selfloop transitions, 6 changer transitions 0/54 dead transitions. [2025-03-14 01:00:29,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 342 flow [2025-03-14 01:00:29,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:00:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:00:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-03-14 01:00:29,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2025-03-14 01:00:29,002 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 235 flow. Second operand 5 states and 71 transitions. [2025-03-14 01:00:29,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 342 flow [2025-03-14 01:00:29,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 323 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-14 01:00:29,004 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 197 flow [2025-03-14 01:00:29,006 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-14 01:00:29,006 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2025-03-14 01:00:29,006 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 197 flow [2025-03-14 01:00:29,006 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-14 01:00:29,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:29,006 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-14 01:00:29,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:00:29,007 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-14 01:00:29,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:29,008 INFO L85 PathProgramCache]: Analyzing trace with hash -885353914, now seen corresponding path program 1 times [2025-03-14 01:00:29,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:29,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727758078] [2025-03-14 01:00:29,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:29,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:29,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 01:00:29,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 01:00:29,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:29,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:29,089 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-14 01:00:29,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:29,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727758078] [2025-03-14 01:00:29,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727758078] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:29,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18121293] [2025-03-14 01:00:29,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:29,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:29,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:29,092 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-14 01:00:29,093 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-14 01:00:29,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 01:00:29,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 01:00:29,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:29,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:29,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 01:00:29,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:29,211 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-14 01:00:29,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:29,280 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-14 01:00:29,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18121293] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:29,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:29,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-03-14 01:00:29,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025683394] [2025-03-14 01:00:29,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:29,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:00:29,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:29,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:00:29,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:00:29,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-14 01:00:29,285 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-14 01:00:29,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:29,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-14 01:00:29,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:29,398 INFO L124 PetriNetUnfolderBase]: 265/473 cut-off events. [2025-03-14 01:00:29,398 INFO L125 PetriNetUnfolderBase]: For 478/478 co-relation queries the response was YES. [2025-03-14 01:00:29,398 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-14 01:00:29,400 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 50 selfloop transitions, 9 changer transitions 0/61 dead transitions. [2025-03-14 01:00:29,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 385 flow [2025-03-14 01:00:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:00:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:00:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2025-03-14 01:00:29,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.413265306122449 [2025-03-14 01:00:29,401 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 197 flow. Second operand 7 states and 81 transitions. [2025-03-14 01:00:29,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 385 flow [2025-03-14 01:00:29,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 376 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:00:29,403 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 223 flow [2025-03-14 01:00:29,403 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-14 01:00:29,403 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2025-03-14 01:00:29,403 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 223 flow [2025-03-14 01:00:29,403 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-14 01:00:29,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:29,403 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-14 01:00:29,410 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-14 01:00:29,604 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-14 01:00:29,604 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-14 01:00:29,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:29,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2068450322, now seen corresponding path program 1 times [2025-03-14 01:00:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:29,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732070247] [2025-03-14 01:00:29,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:29,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:29,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 01:00:29,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 01:00:29,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:29,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:29,660 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-14 01:00:29,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:29,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732070247] [2025-03-14 01:00:29,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732070247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:29,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:29,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:00:29,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886539231] [2025-03-14 01:00:29,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:29,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:29,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:29,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:29,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:00:29,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:29,670 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-14 01:00:29,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:29,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:29,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:29,737 INFO L124 PetriNetUnfolderBase]: 166/327 cut-off events. [2025-03-14 01:00:29,737 INFO L125 PetriNetUnfolderBase]: For 370/371 co-relation queries the response was YES. [2025-03-14 01:00:29,737 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-14 01:00:29,738 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 25 selfloop transitions, 2 changer transitions 17/47 dead transitions. [2025-03-14 01:00:29,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 308 flow [2025-03-14 01:00:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:00:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:00:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-03-14 01:00:29,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-14 01:00:29,739 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 223 flow. Second operand 5 states and 65 transitions. [2025-03-14 01:00:29,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 308 flow [2025-03-14 01:00:29,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 47 transitions, 289 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-14 01:00:29,741 INFO L231 Difference]: Finished difference. Result has 51 places, 30 transitions, 136 flow [2025-03-14 01:00:29,741 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-14 01:00:29,743 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 25 predicate places. [2025-03-14 01:00:29,743 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 30 transitions, 136 flow [2025-03-14 01:00:29,743 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-14 01:00:29,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:29,743 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-14 01:00:29,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:00:29,743 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-14 01:00:29,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:29,743 INFO L85 PathProgramCache]: Analyzing trace with hash -738742195, now seen corresponding path program 1 times [2025-03-14 01:00:29,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:29,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727464415] [2025-03-14 01:00:29,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:29,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:29,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 01:00:29,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 01:00:29,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:29,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:29,836 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-14 01:00:29,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:29,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727464415] [2025-03-14 01:00:29,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727464415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:29,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828832978] [2025-03-14 01:00:29,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:29,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:29,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:29,838 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-14 01:00:29,840 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-14 01:00:29,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 01:00:29,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 01:00:29,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:29,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:29,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 01:00:29,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:29,944 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-14 01:00:29,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:30,003 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-14 01:00:30,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828832978] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:30,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:30,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-03-14 01:00:30,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708636496] [2025-03-14 01:00:30,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:30,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:00:30,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:30,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:00:30,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:00:30,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-14 01:00:30,016 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-14 01:00:30,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:30,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-14 01:00:30,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:30,107 INFO L124 PetriNetUnfolderBase]: 201/374 cut-off events. [2025-03-14 01:00:30,107 INFO L125 PetriNetUnfolderBase]: For 327/329 co-relation queries the response was YES. [2025-03-14 01:00:30,108 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-14 01:00:30,109 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 34 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2025-03-14 01:00:30,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 276 flow [2025-03-14 01:00:30,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:00:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:00:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2025-03-14 01:00:30,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34183673469387754 [2025-03-14 01:00:30,110 INFO L175 Difference]: Start difference. First operand has 51 places, 30 transitions, 136 flow. Second operand 7 states and 67 transitions. [2025-03-14 01:00:30,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 276 flow [2025-03-14 01:00:30,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 251 flow, removed 9 selfloop flow, removed 7 redundant places. [2025-03-14 01:00:30,112 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 150 flow [2025-03-14 01:00:30,112 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-14 01:00:30,112 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2025-03-14 01:00:30,112 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 150 flow [2025-03-14 01:00:30,112 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-14 01:00:30,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:30,112 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-14 01:00:30,120 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-14 01:00:30,312 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-14 01:00:30,313 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-14 01:00:30,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:30,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1496546592, now seen corresponding path program 1 times [2025-03-14 01:00:30,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:30,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699038452] [2025-03-14 01:00:30,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:30,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:30,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:00:30,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:00:30,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:30,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:30,695 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-14 01:00:30,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:30,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699038452] [2025-03-14 01:00:30,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699038452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:30,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57128427] [2025-03-14 01:00:30,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:30,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:30,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:30,698 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-14 01:00:30,699 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-14 01:00:30,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:00:30,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:00:30,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:30,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:30,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-14 01:00:30,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:30,843 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-14 01:00:30,844 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-14 01:00:30,866 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-14 01:00:30,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:00:30,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57128427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:30,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:00:30,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2025-03-14 01:00:30,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195128720] [2025-03-14 01:00:30,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:30,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:00:30,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:30,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:00:30,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:00:30,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:30,877 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-14 01:00:30,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:30,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:30,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:31,063 INFO L124 PetriNetUnfolderBase]: 274/515 cut-off events. [2025-03-14 01:00:31,063 INFO L125 PetriNetUnfolderBase]: For 532/551 co-relation queries the response was YES. [2025-03-14 01:00:31,064 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-14 01:00:31,066 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 59 selfloop transitions, 7 changer transitions 6/75 dead transitions. [2025-03-14 01:00:31,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 456 flow [2025-03-14 01:00:31,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:00:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:00:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-03-14 01:00:31,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-03-14 01:00:31,066 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 150 flow. Second operand 7 states and 100 transitions. [2025-03-14 01:00:31,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 456 flow [2025-03-14 01:00:31,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 75 transitions, 444 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:00:31,068 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 198 flow [2025-03-14 01:00:31,068 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-14 01:00:31,068 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 22 predicate places. [2025-03-14 01:00:31,068 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 198 flow [2025-03-14 01:00:31,068 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-14 01:00:31,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:31,068 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-14 01:00:31,074 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-14 01:00:31,269 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-14 01:00:31,269 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-14 01:00:31,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:31,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1773613190, now seen corresponding path program 2 times [2025-03-14 01:00:31,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:31,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624088529] [2025-03-14 01:00:31,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:31,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:31,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-14 01:00:31,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-14 01:00:31,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:00:31,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:31,564 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-14 01:00:31,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:31,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624088529] [2025-03-14 01:00:31,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624088529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:31,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:31,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:00:31,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936378035] [2025-03-14 01:00:31,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:31,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:00:31,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:31,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:00:31,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:00:31,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:31,580 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-14 01:00:31,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:31,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:31,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:31,828 INFO L124 PetriNetUnfolderBase]: 329/605 cut-off events. [2025-03-14 01:00:31,828 INFO L125 PetriNetUnfolderBase]: For 1088/1114 co-relation queries the response was YES. [2025-03-14 01:00:31,829 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-14 01:00:31,831 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 52 selfloop transitions, 14 changer transitions 6/75 dead transitions. [2025-03-14 01:00:31,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 520 flow [2025-03-14 01:00:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2025-03-14 01:00:31,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2025-03-14 01:00:31,832 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 198 flow. Second operand 9 states and 110 transitions. [2025-03-14 01:00:31,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 520 flow [2025-03-14 01:00:31,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 489 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-14 01:00:31,835 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 286 flow [2025-03-14 01:00:31,835 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-14 01:00:31,836 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 31 predicate places. [2025-03-14 01:00:31,836 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 286 flow [2025-03-14 01:00:31,836 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-14 01:00:31,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:31,836 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-14 01:00:31,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:00:31,836 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-14 01:00:31,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:31,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1201577342, now seen corresponding path program 3 times [2025-03-14 01:00:31,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:31,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101294384] [2025-03-14 01:00:31,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:00:31,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:31,844 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-14 01:00:31,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-14 01:00:31,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:00:31,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:32,085 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-14 01:00:32,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:32,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101294384] [2025-03-14 01:00:32,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101294384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:32,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:32,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:00:32,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449022330] [2025-03-14 01:00:32,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:32,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:00:32,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:32,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:00:32,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:00:32,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:32,099 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-14 01:00:32,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:32,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:32,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:32,288 INFO L124 PetriNetUnfolderBase]: 325/605 cut-off events. [2025-03-14 01:00:32,288 INFO L125 PetriNetUnfolderBase]: For 1557/1580 co-relation queries the response was YES. [2025-03-14 01:00:32,289 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-14 01:00:32,291 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 54 selfloop transitions, 15 changer transitions 6/78 dead transitions. [2025-03-14 01:00:32,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 575 flow [2025-03-14 01:00:32,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:32,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2025-03-14 01:00:32,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-14 01:00:32,293 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 286 flow. Second operand 9 states and 112 transitions. [2025-03-14 01:00:32,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 575 flow [2025-03-14 01:00:32,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 549 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-14 01:00:32,295 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 337 flow [2025-03-14 01:00:32,295 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-14 01:00:32,296 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 37 predicate places. [2025-03-14 01:00:32,296 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 337 flow [2025-03-14 01:00:32,297 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-14 01:00:32,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:32,297 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-14 01:00:32,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:00:32,297 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-14 01:00:32,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:32,298 INFO L85 PathProgramCache]: Analyzing trace with hash -547107398, now seen corresponding path program 4 times [2025-03-14 01:00:32,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:32,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703551015] [2025-03-14 01:00:32,298 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:00:32,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:32,303 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-14 01:00:32,312 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:00:32,312 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:00:32,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:32,450 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-14 01:00:32,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:32,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703551015] [2025-03-14 01:00:32,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703551015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:32,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:32,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:00:32,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927264577] [2025-03-14 01:00:32,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:32,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:00:32,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:32,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:00:32,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:00:32,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:32,459 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-14 01:00:32,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:32,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:32,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:32,599 INFO L124 PetriNetUnfolderBase]: 315/582 cut-off events. [2025-03-14 01:00:32,600 INFO L125 PetriNetUnfolderBase]: For 1726/1749 co-relation queries the response was YES. [2025-03-14 01:00:32,601 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-14 01:00:32,602 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 48 selfloop transitions, 15 changer transitions 6/72 dead transitions. [2025-03-14 01:00:32,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 72 transitions, 575 flow [2025-03-14 01:00:32,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 01:00:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 01:00:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-03-14 01:00:32,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45982142857142855 [2025-03-14 01:00:32,603 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 337 flow. Second operand 8 states and 103 transitions. [2025-03-14 01:00:32,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 72 transitions, 575 flow [2025-03-14 01:00:32,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 544 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-14 01:00:32,606 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 347 flow [2025-03-14 01:00:32,607 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-14 01:00:32,607 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2025-03-14 01:00:32,608 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 347 flow [2025-03-14 01:00:32,608 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-14 01:00:32,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:32,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:32,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:00:32,608 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-14 01:00:32,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:32,608 INFO L85 PathProgramCache]: Analyzing trace with hash -73075014, now seen corresponding path program 5 times [2025-03-14 01:00:32,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:32,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942119074] [2025-03-14 01:00:32,609 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:00:32,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:32,616 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-14 01:00:32,632 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:00:32,634 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:32,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:32,890 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-14 01:00:32,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:32,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942119074] [2025-03-14 01:00:32,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942119074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:32,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329778888] [2025-03-14 01:00:32,891 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:00:32,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:32,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:32,893 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-14 01:00:32,894 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-14 01:00:32,938 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-14 01:00:32,955 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:00:32,956 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:32,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:32,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 01:00:32,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:33,093 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:00:33,093 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-14 01:00:33,115 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-14 01:00:33,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:00:33,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329778888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:33,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:00:33,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 15 [2025-03-14 01:00:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819846763] [2025-03-14 01:00:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:33,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:00:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:33,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:00:33,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:00:33,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:33,130 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-14 01:00:33,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:33,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:33,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:33,378 INFO L124 PetriNetUnfolderBase]: 422/777 cut-off events. [2025-03-14 01:00:33,378 INFO L125 PetriNetUnfolderBase]: For 2175/2202 co-relation queries the response was YES. [2025-03-14 01:00:33,379 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-14 01:00:33,381 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 67 selfloop transitions, 15 changer transitions 6/91 dead transitions. [2025-03-14 01:00:33,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 821 flow [2025-03-14 01:00:33,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:33,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:33,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2025-03-14 01:00:33,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-14 01:00:33,383 INFO L175 Difference]: Start difference. First operand has 65 places, 44 transitions, 347 flow. Second operand 9 states and 105 transitions. [2025-03-14 01:00:33,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 821 flow [2025-03-14 01:00:33,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 91 transitions, 765 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-03-14 01:00:33,387 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 398 flow [2025-03-14 01:00:33,387 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-14 01:00:33,387 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 42 predicate places. [2025-03-14 01:00:33,388 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 398 flow [2025-03-14 01:00:33,388 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-14 01:00:33,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:33,388 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-14 01:00:33,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-14 01:00:33,592 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-14 01:00:33,592 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-14 01:00:33,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:33,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1014674192, now seen corresponding path program 6 times [2025-03-14 01:00:33,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:33,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184647781] [2025-03-14 01:00:33,593 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:00:33,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:33,598 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-14 01:00:33,614 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-14 01:00:33,614 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:00:33,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:33,818 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-14 01:00:33,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:33,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184647781] [2025-03-14 01:00:33,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184647781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:33,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:33,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:00:33,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114294773] [2025-03-14 01:00:33,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:33,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:00:33,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:33,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:00:33,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:00:33,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:33,833 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-14 01:00:33,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:33,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:33,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:34,023 INFO L124 PetriNetUnfolderBase]: 418/773 cut-off events. [2025-03-14 01:00:34,024 INFO L125 PetriNetUnfolderBase]: For 2516/2543 co-relation queries the response was YES. [2025-03-14 01:00:34,026 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-14 01:00:34,028 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 57 selfloop transitions, 18 changer transitions 6/84 dead transitions. [2025-03-14 01:00:34,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 84 transitions, 738 flow [2025-03-14 01:00:34,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:34,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2025-03-14 01:00:34,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-14 01:00:34,030 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 398 flow. Second operand 9 states and 108 transitions. [2025-03-14 01:00:34,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 84 transitions, 738 flow [2025-03-14 01:00:34,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 84 transitions, 697 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-14 01:00:34,035 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 488 flow [2025-03-14 01:00:34,036 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-14 01:00:34,036 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 48 predicate places. [2025-03-14 01:00:34,036 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 488 flow [2025-03-14 01:00:34,036 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-14 01:00:34,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:34,036 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-14 01:00:34,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:00:34,037 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-14 01:00:34,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:34,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1469488570, now seen corresponding path program 7 times [2025-03-14 01:00:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:34,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153048164] [2025-03-14 01:00:34,037 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:00:34,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:34,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:00:34,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:00:34,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:34,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:34,358 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-14 01:00:34,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:34,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153048164] [2025-03-14 01:00:34,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153048164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:34,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460070250] [2025-03-14 01:00:34,358 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:00:34,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:34,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:34,361 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-14 01:00:34,362 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-14 01:00:34,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:00:34,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:00:34,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:34,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:34,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-14 01:00:34,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:34,494 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-14 01:00:34,494 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-14 01:00:34,513 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-14 01:00:34,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:00:34,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460070250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:34,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:00:34,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2025-03-14 01:00:34,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024282439] [2025-03-14 01:00:34,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:34,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:00:34,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:34,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:00:34,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-14 01:00:34,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:34,527 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-14 01:00:34,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:34,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:34,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:34,730 INFO L124 PetriNetUnfolderBase]: 442/813 cut-off events. [2025-03-14 01:00:34,731 INFO L125 PetriNetUnfolderBase]: For 3522/3549 co-relation queries the response was YES. [2025-03-14 01:00:34,732 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-14 01:00:34,735 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 66 selfloop transitions, 19 changer transitions 6/94 dead transitions. [2025-03-14 01:00:34,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 94 transitions, 954 flow [2025-03-14 01:00:34,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:00:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:00:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2025-03-14 01:00:34,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2025-03-14 01:00:34,736 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 488 flow. Second operand 7 states and 96 transitions. [2025-03-14 01:00:34,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 94 transitions, 954 flow [2025-03-14 01:00:34,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 94 transitions, 916 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-03-14 01:00:34,741 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 610 flow [2025-03-14 01:00:34,741 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-14 01:00:34,741 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 53 predicate places. [2025-03-14 01:00:34,742 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 610 flow [2025-03-14 01:00:34,742 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-14 01:00:34,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:34,742 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-14 01:00:34,748 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-14 01:00:34,946 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-14 01:00:34,946 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-14 01:00:34,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash -499522596, now seen corresponding path program 8 times [2025-03-14 01:00:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:34,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337352178] [2025-03-14 01:00:34,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:34,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:34,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-14 01:00:34,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-14 01:00:34,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:00:34,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:35,175 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-14 01:00:35,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:35,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337352178] [2025-03-14 01:00:35,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337352178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:35,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:35,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:00:35,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896965831] [2025-03-14 01:00:35,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:35,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:00:35,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:35,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:00:35,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:00:35,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:35,192 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-14 01:00:35,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:35,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:35,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:35,438 INFO L124 PetriNetUnfolderBase]: 450/829 cut-off events. [2025-03-14 01:00:35,438 INFO L125 PetriNetUnfolderBase]: For 3890/3917 co-relation queries the response was YES. [2025-03-14 01:00:35,440 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-14 01:00:35,443 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 59 selfloop transitions, 27 changer transitions 6/95 dead transitions. [2025-03-14 01:00:35,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 95 transitions, 1001 flow [2025-03-14 01:00:35,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2025-03-14 01:00:35,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43253968253968256 [2025-03-14 01:00:35,444 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 610 flow. Second operand 9 states and 109 transitions. [2025-03-14 01:00:35,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 95 transitions, 1001 flow [2025-03-14 01:00:35,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 95 transitions, 948 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-14 01:00:35,450 INFO L231 Difference]: Finished difference. Result has 86 places, 64 transitions, 723 flow [2025-03-14 01:00:35,450 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-14 01:00:35,450 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 60 predicate places. [2025-03-14 01:00:35,451 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 64 transitions, 723 flow [2025-03-14 01:00:35,451 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-14 01:00:35,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:35,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] [2025-03-14 01:00:35,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:00:35,451 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-14 01:00:35,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1388089514, now seen corresponding path program 9 times [2025-03-14 01:00:35,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:35,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793591615] [2025-03-14 01:00:35,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:00:35,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:35,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-14 01:00:35,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-14 01:00:35,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:00:35,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:35,654 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-14 01:00:35,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:35,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793591615] [2025-03-14 01:00:35,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793591615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:35,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:35,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:00:35,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157433217] [2025-03-14 01:00:35,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:35,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:00:35,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:35,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:00:35,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:00:35,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:35,671 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-14 01:00:35,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:35,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:35,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:35,878 INFO L124 PetriNetUnfolderBase]: 441/808 cut-off events. [2025-03-14 01:00:35,879 INFO L125 PetriNetUnfolderBase]: For 4177/4204 co-relation queries the response was YES. [2025-03-14 01:00:35,880 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-14 01:00:35,883 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 55 selfloop transitions, 27 changer transitions 6/91 dead transitions. [2025-03-14 01:00:35,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 1007 flow [2025-03-14 01:00:35,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:35,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2025-03-14 01:00:35,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2025-03-14 01:00:35,884 INFO L175 Difference]: Start difference. First operand has 86 places, 64 transitions, 723 flow. Second operand 9 states and 106 transitions. [2025-03-14 01:00:35,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 1007 flow [2025-03-14 01:00:35,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 91 transitions, 957 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-14 01:00:35,891 INFO L231 Difference]: Finished difference. Result has 90 places, 64 transitions, 739 flow [2025-03-14 01:00:35,891 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-14 01:00:35,891 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 64 predicate places. [2025-03-14 01:00:35,891 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 64 transitions, 739 flow [2025-03-14 01:00:35,892 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-14 01:00:35,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:35,892 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-14 01:00:35,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:00:35,892 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-14 01:00:35,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2135768919, now seen corresponding path program 1 times [2025-03-14 01:00:35,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:35,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681507178] [2025-03-14 01:00:35,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:35,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:35,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:00:35,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:35,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:35,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:36,078 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-14 01:00:36,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:36,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681507178] [2025-03-14 01:00:36,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681507178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:36,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129459231] [2025-03-14 01:00:36,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:36,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:36,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:36,081 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-14 01:00:36,082 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-14 01:00:36,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:00:36,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:36,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:36,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:36,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 01:00:36,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:36,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:00:36,185 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-14 01:00:36,204 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-14 01:00:36,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:36,283 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-14 01:00:36,283 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-14 01:00:36,299 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-14 01:00:36,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129459231] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:36,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:36,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 18 [2025-03-14 01:00:36,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335158617] [2025-03-14 01:00:36,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:36,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:00:36,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:36,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:00:36,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:00:36,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:36,311 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-14 01:00:36,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:36,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:36,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:36,557 INFO L124 PetriNetUnfolderBase]: 498/912 cut-off events. [2025-03-14 01:00:36,557 INFO L125 PetriNetUnfolderBase]: For 4765/4800 co-relation queries the response was YES. [2025-03-14 01:00:36,560 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-14 01:00:36,563 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 84 selfloop transitions, 30 changer transitions 0/117 dead transitions. [2025-03-14 01:00:36,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 117 transitions, 1360 flow [2025-03-14 01:00:36,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:00:36,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:00:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2025-03-14 01:00:36,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-03-14 01:00:36,564 INFO L175 Difference]: Start difference. First operand has 90 places, 64 transitions, 739 flow. Second operand 7 states and 105 transitions. [2025-03-14 01:00:36,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 117 transitions, 1360 flow [2025-03-14 01:00:36,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 117 transitions, 1275 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-03-14 01:00:36,573 INFO L231 Difference]: Finished difference. Result has 90 places, 73 transitions, 899 flow [2025-03-14 01:00:36,573 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-14 01:00:36,573 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 64 predicate places. [2025-03-14 01:00:36,574 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 73 transitions, 899 flow [2025-03-14 01:00:36,574 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-14 01:00:36,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:36,574 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-14 01:00:36,580 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-14 01:00:36,774 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-14 01:00:36,774 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-14 01:00:36,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:36,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1360628359, now seen corresponding path program 2 times [2025-03-14 01:00:36,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:36,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907895807] [2025-03-14 01:00:36,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:36,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:36,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:36,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:36,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:36,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:36,976 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-14 01:00:36,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:36,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907895807] [2025-03-14 01:00:36,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907895807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:36,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273851460] [2025-03-14 01:00:36,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:36,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:36,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:36,978 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-14 01:00:36,980 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-14 01:00:37,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:37,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:37,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:37,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:37,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-14 01:00:37,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:37,110 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:00:37,110 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-14 01:00:37,117 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-14 01:00:37,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:37,178 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-14 01:00:37,179 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-14 01:00:37,205 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-14 01:00:37,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273851460] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:00:37,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:00:37,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 16 [2025-03-14 01:00:37,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633176450] [2025-03-14 01:00:37,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:00:37,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-14 01:00:37,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:37,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-14 01:00:37,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-14 01:00:37,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:37,245 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-14 01:00:37,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:37,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:37,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:37,566 INFO L124 PetriNetUnfolderBase]: 578/1074 cut-off events. [2025-03-14 01:00:37,566 INFO L125 PetriNetUnfolderBase]: For 5808/5834 co-relation queries the response was YES. [2025-03-14 01:00:37,568 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-14 01:00:37,574 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 73 selfloop transitions, 39 changer transitions 0/115 dead transitions. [2025-03-14 01:00:37,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 115 transitions, 1360 flow [2025-03-14 01:00:37,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:00:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:00:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2025-03-14 01:00:37,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2025-03-14 01:00:37,576 INFO L175 Difference]: Start difference. First operand has 90 places, 73 transitions, 899 flow. Second operand 10 states and 123 transitions. [2025-03-14 01:00:37,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 115 transitions, 1360 flow [2025-03-14 01:00:37,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 115 transitions, 1324 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-14 01:00:37,586 INFO L231 Difference]: Finished difference. Result has 100 places, 78 transitions, 1033 flow [2025-03-14 01:00:37,586 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-14 01:00:37,586 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 74 predicate places. [2025-03-14 01:00:37,586 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 78 transitions, 1033 flow [2025-03-14 01:00:37,587 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-14 01:00:37,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:37,587 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-14 01:00:37,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-14 01:00:37,790 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-14 01:00:37,791 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-14 01:00:37,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:37,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1630671351, now seen corresponding path program 3 times [2025-03-14 01:00:37,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:37,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502839208] [2025-03-14 01:00:37,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:00:37,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:37,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:37,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:37,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:00:37,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:37,951 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-14 01:00:37,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:37,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502839208] [2025-03-14 01:00:37,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502839208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:37,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:37,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:00:37,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274720503] [2025-03-14 01:00:37,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:37,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:00:37,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:37,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:00:37,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:00:37,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:37,963 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-14 01:00:37,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:37,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:37,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:38,171 INFO L124 PetriNetUnfolderBase]: 573/1062 cut-off events. [2025-03-14 01:00:38,173 INFO L125 PetriNetUnfolderBase]: For 6641/6672 co-relation queries the response was YES. [2025-03-14 01:00:38,176 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-14 01:00:38,180 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 76 selfloop transitions, 32 changer transitions 10/121 dead transitions. [2025-03-14 01:00:38,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 121 transitions, 1535 flow [2025-03-14 01:00:38,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2025-03-14 01:00:38,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2025-03-14 01:00:38,182 INFO L175 Difference]: Start difference. First operand has 100 places, 78 transitions, 1033 flow. Second operand 9 states and 106 transitions. [2025-03-14 01:00:38,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 121 transitions, 1535 flow [2025-03-14 01:00:38,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 121 transitions, 1468 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-14 01:00:38,193 INFO L231 Difference]: Finished difference. Result has 104 places, 76 transitions, 988 flow [2025-03-14 01:00:38,193 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-14 01:00:38,193 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 78 predicate places. [2025-03-14 01:00:38,194 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 76 transitions, 988 flow [2025-03-14 01:00:38,194 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-14 01:00:38,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:38,194 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-14 01:00:38,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:00:38,195 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-14 01:00:38,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:38,195 INFO L85 PathProgramCache]: Analyzing trace with hash 237278107, now seen corresponding path program 4 times [2025-03-14 01:00:38,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:38,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988563652] [2025-03-14 01:00:38,195 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:00:38,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:38,199 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:38,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-14 01:00:38,204 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:00:38,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:38,278 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-14 01:00:38,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:38,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988563652] [2025-03-14 01:00:38,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988563652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:38,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:38,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:00:38,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825417780] [2025-03-14 01:00:38,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:38,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:00:38,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:38,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:00:38,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:00:38,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:38,290 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-14 01:00:38,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:38,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:38,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:38,477 INFO L124 PetriNetUnfolderBase]: 585/1077 cut-off events. [2025-03-14 01:00:38,477 INFO L125 PetriNetUnfolderBase]: For 7237/7267 co-relation queries the response was YES. [2025-03-14 01:00:38,480 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-14 01:00:38,482 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 67 selfloop transitions, 39 changer transitions 0/109 dead transitions. [2025-03-14 01:00:38,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 109 transitions, 1428 flow [2025-03-14 01:00:38,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:00:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:00:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-03-14 01:00:38,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-03-14 01:00:38,483 INFO L175 Difference]: Start difference. First operand has 104 places, 76 transitions, 988 flow. Second operand 7 states and 100 transitions. [2025-03-14 01:00:38,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 109 transitions, 1428 flow [2025-03-14 01:00:38,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 109 transitions, 1343 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-03-14 01:00:38,492 INFO L231 Difference]: Finished difference. Result has 103 places, 82 transitions, 1117 flow [2025-03-14 01:00:38,492 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-14 01:00:38,492 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 77 predicate places. [2025-03-14 01:00:38,492 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 82 transitions, 1117 flow [2025-03-14 01:00:38,492 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-14 01:00:38,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:38,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-14 01:00:38,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 01:00:38,493 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-14 01:00:38,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:38,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1169446033, now seen corresponding path program 1 times [2025-03-14 01:00:38,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:38,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538775515] [2025-03-14 01:00:38,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:38,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:38,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:00:38,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:38,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:38,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:38,648 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-14 01:00:38,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:38,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538775515] [2025-03-14 01:00:38,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538775515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:38,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213826663] [2025-03-14 01:00:38,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:38,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:38,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:38,650 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-14 01:00:38,652 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-14 01:00:38,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:00:38,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:38,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:38,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:38,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 01:00:38,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:38,759 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-14 01:00:38,760 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-14 01:00:38,767 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-14 01:00:38,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:38,833 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-14 01:00:38,834 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-14 01:00:38,844 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-14 01:00:38,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213826663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:00:38,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:00:38,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2025-03-14 01:00:38,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098359164] [2025-03-14 01:00:38,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:00:38,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 01:00:38,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:38,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 01:00:38,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-14 01:00:38,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:38,877 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-14 01:00:38,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:38,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:38,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:39,221 INFO L124 PetriNetUnfolderBase]: 619/1146 cut-off events. [2025-03-14 01:00:39,221 INFO L125 PetriNetUnfolderBase]: For 6878/6904 co-relation queries the response was YES. [2025-03-14 01:00:39,224 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-14 01:00:39,227 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 91 selfloop transitions, 40 changer transitions 0/134 dead transitions. [2025-03-14 01:00:39,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 134 transitions, 1730 flow [2025-03-14 01:00:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:00:39,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:00:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2025-03-14 01:00:39,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-03-14 01:00:39,228 INFO L175 Difference]: Start difference. First operand has 103 places, 82 transitions, 1117 flow. Second operand 10 states and 119 transitions. [2025-03-14 01:00:39,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 134 transitions, 1730 flow [2025-03-14 01:00:39,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 134 transitions, 1653 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-14 01:00:39,240 INFO L231 Difference]: Finished difference. Result has 111 places, 84 transitions, 1157 flow [2025-03-14 01:00:39,241 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-14 01:00:39,241 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 85 predicate places. [2025-03-14 01:00:39,241 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 84 transitions, 1157 flow [2025-03-14 01:00:39,241 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-14 01:00:39,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:39,241 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-14 01:00:39,248 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-14 01:00:39,442 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-14 01:00:39,442 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-14 01:00:39,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:39,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1943206035, now seen corresponding path program 5 times [2025-03-14 01:00:39,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:39,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506228560] [2025-03-14 01:00:39,442 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:00:39,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:39,448 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:39,454 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:39,454 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:39,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:39,625 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-14 01:00:39,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:39,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506228560] [2025-03-14 01:00:39,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506228560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:39,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840032854] [2025-03-14 01:00:39,626 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:00:39,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:39,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:39,628 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-14 01:00:39,629 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-14 01:00:39,676 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:39,695 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:39,695 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:39,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:39,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 01:00:39,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:39,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:00:39,718 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-14 01:00:39,734 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-14 01:00:39,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:39,796 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-14 01:00:39,796 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-14 01:00:39,815 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-14 01:00:39,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840032854] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:39,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:39,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2025-03-14 01:00:39,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010583415] [2025-03-14 01:00:39,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:39,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:00:39,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:39,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:00:39,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-14 01:00:39,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:39,825 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-14 01:00:39,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:39,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:39,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:40,052 INFO L124 PetriNetUnfolderBase]: 639/1195 cut-off events. [2025-03-14 01:00:40,052 INFO L125 PetriNetUnfolderBase]: For 7762/7795 co-relation queries the response was YES. [2025-03-14 01:00:40,057 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-14 01:00:40,060 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 81 selfloop transitions, 39 changer transitions 0/123 dead transitions. [2025-03-14 01:00:40,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 123 transitions, 1638 flow [2025-03-14 01:00:40,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:00:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:00:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2025-03-14 01:00:40,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5561224489795918 [2025-03-14 01:00:40,061 INFO L175 Difference]: Start difference. First operand has 111 places, 84 transitions, 1157 flow. Second operand 7 states and 109 transitions. [2025-03-14 01:00:40,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 123 transitions, 1638 flow [2025-03-14 01:00:40,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 123 transitions, 1540 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-14 01:00:40,073 INFO L231 Difference]: Finished difference. Result has 114 places, 89 transitions, 1274 flow [2025-03-14 01:00:40,073 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-14 01:00:40,074 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 88 predicate places. [2025-03-14 01:00:40,074 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 89 transitions, 1274 flow [2025-03-14 01:00:40,074 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-14 01:00:40,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:40,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:40,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-14 01:00:40,274 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-14 01:00:40,274 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-14 01:00:40,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:40,275 INFO L85 PathProgramCache]: Analyzing trace with hash 262668121, now seen corresponding path program 2 times [2025-03-14 01:00:40,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:40,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981032236] [2025-03-14 01:00:40,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:40,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:40,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:40,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-14 01:00:40,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:00:40,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:40,440 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-14 01:00:40,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:40,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981032236] [2025-03-14 01:00:40,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981032236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:40,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:40,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:00:40,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619486387] [2025-03-14 01:00:40,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:40,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:00:40,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:40,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:00:40,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:00:40,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:40,455 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-14 01:00:40,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:40,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:40,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:40,719 INFO L124 PetriNetUnfolderBase]: 724/1362 cut-off events. [2025-03-14 01:00:40,720 INFO L125 PetriNetUnfolderBase]: For 7870/7901 co-relation queries the response was YES. [2025-03-14 01:00:40,723 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-14 01:00:40,727 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 91 selfloop transitions, 43 changer transitions 0/137 dead transitions. [2025-03-14 01:00:40,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 137 transitions, 1849 flow [2025-03-14 01:00:40,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2025-03-14 01:00:40,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-14 01:00:40,727 INFO L175 Difference]: Start difference. First operand has 114 places, 89 transitions, 1274 flow. Second operand 9 states and 117 transitions. [2025-03-14 01:00:40,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 137 transitions, 1849 flow [2025-03-14 01:00:40,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 137 transitions, 1756 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-03-14 01:00:40,740 INFO L231 Difference]: Finished difference. Result has 120 places, 93 transitions, 1337 flow [2025-03-14 01:00:40,740 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-14 01:00:40,741 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 94 predicate places. [2025-03-14 01:00:40,741 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 93 transitions, 1337 flow [2025-03-14 01:00:40,741 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-14 01:00:40,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:40,741 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-14 01:00:40,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-14 01:00:40,741 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-14 01:00:40,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:40,741 INFO L85 PathProgramCache]: Analyzing trace with hash -738099883, now seen corresponding path program 3 times [2025-03-14 01:00:40,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:40,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139016849] [2025-03-14 01:00:40,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:00:40,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:40,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:40,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-14 01:00:40,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:00:40,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:40,908 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-14 01:00:40,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:40,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139016849] [2025-03-14 01:00:40,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139016849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:40,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:40,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:00:40,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427536393] [2025-03-14 01:00:40,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:40,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:00:40,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:40,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:00:40,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:00:40,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:40,922 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-14 01:00:40,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:40,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:40,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:41,132 INFO L124 PetriNetUnfolderBase]: 720/1351 cut-off events. [2025-03-14 01:00:41,132 INFO L125 PetriNetUnfolderBase]: For 7951/7988 co-relation queries the response was YES. [2025-03-14 01:00:41,136 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-14 01:00:41,139 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 76 selfloop transitions, 41 changer transitions 3/123 dead transitions. [2025-03-14 01:00:41,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 123 transitions, 1760 flow [2025-03-14 01:00:41,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:41,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2025-03-14 01:00:41,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-03-14 01:00:41,140 INFO L175 Difference]: Start difference. First operand has 120 places, 93 transitions, 1337 flow. Second operand 9 states and 102 transitions. [2025-03-14 01:00:41,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 123 transitions, 1760 flow [2025-03-14 01:00:41,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 123 transitions, 1691 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-03-14 01:00:41,155 INFO L231 Difference]: Finished difference. Result has 125 places, 93 transitions, 1343 flow [2025-03-14 01:00:41,155 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-14 01:00:41,159 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 99 predicate places. [2025-03-14 01:00:41,159 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 93 transitions, 1343 flow [2025-03-14 01:00:41,159 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-14 01:00:41,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:41,159 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-14 01:00:41,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-14 01:00:41,159 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-14 01:00:41,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:41,159 INFO L85 PathProgramCache]: Analyzing trace with hash 160477153, now seen corresponding path program 4 times [2025-03-14 01:00:41,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:41,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798977330] [2025-03-14 01:00:41,160 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:00:41,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:41,165 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:41,170 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:41,170 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:00:41,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:41,247 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-14 01:00:41,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:41,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798977330] [2025-03-14 01:00:41,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798977330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:41,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:41,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:00:41,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295096808] [2025-03-14 01:00:41,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:41,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:00:41,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:41,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:00:41,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:00:41,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:41,260 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-14 01:00:41,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:41,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:41,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:41,440 INFO L124 PetriNetUnfolderBase]: 684/1282 cut-off events. [2025-03-14 01:00:41,441 INFO L125 PetriNetUnfolderBase]: For 7650/7683 co-relation queries the response was YES. [2025-03-14 01:00:41,445 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-14 01:00:41,448 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 83 selfloop transitions, 40 changer transitions 0/126 dead transitions. [2025-03-14 01:00:41,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 126 transitions, 1782 flow [2025-03-14 01:00:41,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:00:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:00:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2025-03-14 01:00:41,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2025-03-14 01:00:41,450 INFO L175 Difference]: Start difference. First operand has 125 places, 93 transitions, 1343 flow. Second operand 7 states and 96 transitions. [2025-03-14 01:00:41,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 126 transitions, 1782 flow [2025-03-14 01:00:41,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 126 transitions, 1688 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-14 01:00:41,464 INFO L231 Difference]: Finished difference. Result has 125 places, 93 transitions, 1333 flow [2025-03-14 01:00:41,464 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-14 01:00:41,466 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 99 predicate places. [2025-03-14 01:00:41,466 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 93 transitions, 1333 flow [2025-03-14 01:00:41,466 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-14 01:00:41,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:41,466 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-14 01:00:41,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-14 01:00:41,466 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-14 01:00:41,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:41,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1436471035, now seen corresponding path program 6 times [2025-03-14 01:00:41,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:41,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704118369] [2025-03-14 01:00:41,467 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:00:41,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:41,473 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:41,479 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-14 01:00:41,479 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:00:41,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:41,624 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-14 01:00:41,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:41,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704118369] [2025-03-14 01:00:41,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704118369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:41,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:41,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:00:41,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62388158] [2025-03-14 01:00:41,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:41,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:00:41,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:41,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:00:41,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:00:41,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:41,641 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-14 01:00:41,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:41,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:41,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:41,845 INFO L124 PetriNetUnfolderBase]: 684/1284 cut-off events. [2025-03-14 01:00:41,845 INFO L125 PetriNetUnfolderBase]: For 7208/7243 co-relation queries the response was YES. [2025-03-14 01:00:41,848 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-14 01:00:41,850 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 76 selfloop transitions, 40 changer transitions 4/123 dead transitions. [2025-03-14 01:00:41,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 123 transitions, 1748 flow [2025-03-14 01:00:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2025-03-14 01:00:41,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-03-14 01:00:41,851 INFO L175 Difference]: Start difference. First operand has 125 places, 93 transitions, 1333 flow. Second operand 9 states and 102 transitions. [2025-03-14 01:00:41,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 123 transitions, 1748 flow [2025-03-14 01:00:41,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 123 transitions, 1670 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:00:41,864 INFO L231 Difference]: Finished difference. Result has 129 places, 92 transitions, 1326 flow [2025-03-14 01:00:41,864 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-14 01:00:41,865 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 103 predicate places. [2025-03-14 01:00:41,865 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 92 transitions, 1326 flow [2025-03-14 01:00:41,865 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-14 01:00:41,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:41,865 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-14 01:00:41,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-14 01:00:41,865 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-14 01:00:41,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1402871807, now seen corresponding path program 7 times [2025-03-14 01:00:41,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:41,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958576040] [2025-03-14 01:00:41,866 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:00:41,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:41,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:00:41,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:41,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:41,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:42,025 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-14 01:00:42,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:42,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958576040] [2025-03-14 01:00:42,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958576040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:42,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:42,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:00:42,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306879223] [2025-03-14 01:00:42,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:42,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:00:42,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:42,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:00:42,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:00:42,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:42,043 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-14 01:00:42,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:42,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:42,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:42,281 INFO L124 PetriNetUnfolderBase]: 652/1214 cut-off events. [2025-03-14 01:00:42,282 INFO L125 PetriNetUnfolderBase]: For 7210/7241 co-relation queries the response was YES. [2025-03-14 01:00:42,285 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-14 01:00:42,287 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 74 selfloop transitions, 38 changer transitions 8/123 dead transitions. [2025-03-14 01:00:42,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 123 transitions, 1720 flow [2025-03-14 01:00:42,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:42,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2025-03-14 01:00:42,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4087301587301587 [2025-03-14 01:00:42,288 INFO L175 Difference]: Start difference. First operand has 129 places, 92 transitions, 1326 flow. Second operand 9 states and 103 transitions. [2025-03-14 01:00:42,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 123 transitions, 1720 flow [2025-03-14 01:00:42,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 123 transitions, 1636 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-14 01:00:42,300 INFO L231 Difference]: Finished difference. Result has 128 places, 89 transitions, 1265 flow [2025-03-14 01:00:42,300 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-14 01:00:42,301 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 102 predicate places. [2025-03-14 01:00:42,301 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 89 transitions, 1265 flow [2025-03-14 01:00:42,301 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-14 01:00:42,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:42,301 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-14 01:00:42,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-14 01:00:42,301 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-14 01:00:42,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:42,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1427274783, now seen corresponding path program 5 times [2025-03-14 01:00:42,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:42,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760583231] [2025-03-14 01:00:42,302 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:00:42,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:42,306 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:42,315 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:42,315 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:42,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:42,457 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-14 01:00:42,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:42,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760583231] [2025-03-14 01:00:42,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760583231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:42,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125810956] [2025-03-14 01:00:42,457 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:00:42,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:42,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:42,459 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-14 01:00:42,460 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-14 01:00:42,509 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:42,529 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:42,529 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:42,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:42,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-14 01:00:42,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:42,696 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-14 01:00:42,696 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-14 01:00:42,710 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-14 01:00:42,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:42,808 INFO L349 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-03-14 01:00:42,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 44 treesize of output 77 [2025-03-14 01:00:42,963 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-14 01:00:42,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125810956] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:00:42,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:00:42,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 27 [2025-03-14 01:00:42,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132652436] [2025-03-14 01:00:42,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:00:42,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-14 01:00:42,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:42,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-14 01:00:42,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2025-03-14 01:00:43,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-14 01:00:43,068 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-14 01:00:43,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:43,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-14 01:00:43,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:44,638 INFO L124 PetriNetUnfolderBase]: 2911/5237 cut-off events. [2025-03-14 01:00:44,638 INFO L125 PetriNetUnfolderBase]: For 27758/27839 co-relation queries the response was YES. [2025-03-14 01:00:44,650 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-14 01:00:44,659 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 311 selfloop transitions, 229 changer transitions 13/555 dead transitions. [2025-03-14 01:00:44,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 555 transitions, 6731 flow [2025-03-14 01:00:44,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-14 01:00:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-14 01:00:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 529 transitions. [2025-03-14 01:00:44,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44982993197278914 [2025-03-14 01:00:44,660 INFO L175 Difference]: Start difference. First operand has 128 places, 89 transitions, 1265 flow. Second operand 42 states and 529 transitions. [2025-03-14 01:00:44,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 555 transitions, 6731 flow [2025-03-14 01:00:44,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 555 transitions, 6469 flow, removed 3 selfloop flow, removed 9 redundant places. [2025-03-14 01:00:44,717 INFO L231 Difference]: Finished difference. Result has 184 places, 300 transitions, 4744 flow [2025-03-14 01:00:44,717 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-14 01:00:44,718 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 158 predicate places. [2025-03-14 01:00:44,718 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 300 transitions, 4744 flow [2025-03-14 01:00:44,718 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-14 01:00:44,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:44,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:44,724 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-14 01:00:44,918 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-14 01:00:44,918 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-14 01:00:44,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:44,919 INFO L85 PathProgramCache]: Analyzing trace with hash -42411219, now seen corresponding path program 8 times [2025-03-14 01:00:44,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:44,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056483170] [2025-03-14 01:00:44,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:44,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:44,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:44,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-14 01:00:44,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:00:44,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:45,067 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-14 01:00:45,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:45,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056483170] [2025-03-14 01:00:45,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056483170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:45,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:45,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:00:45,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783124547] [2025-03-14 01:00:45,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:45,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:00:45,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:45,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:00:45,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:00:45,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:45,079 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-14 01:00:45,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:45,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:45,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:45,643 INFO L124 PetriNetUnfolderBase]: 2573/4691 cut-off events. [2025-03-14 01:00:45,644 INFO L125 PetriNetUnfolderBase]: For 56039/56234 co-relation queries the response was YES. [2025-03-14 01:00:45,711 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-14 01:00:45,723 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 207 selfloop transitions, 106 changer transitions 6/324 dead transitions. [2025-03-14 01:00:45,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 324 transitions, 5510 flow [2025-03-14 01:00:45,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2025-03-14 01:00:45,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2025-03-14 01:00:45,724 INFO L175 Difference]: Start difference. First operand has 184 places, 300 transitions, 4744 flow. Second operand 9 states and 107 transitions. [2025-03-14 01:00:45,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 324 transitions, 5510 flow [2025-03-14 01:00:45,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 324 transitions, 5350 flow, removed 77 selfloop flow, removed 2 redundant places. [2025-03-14 01:00:45,879 INFO L231 Difference]: Finished difference. Result has 190 places, 294 transitions, 4678 flow [2025-03-14 01:00:45,879 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-14 01:00:45,879 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 164 predicate places. [2025-03-14 01:00:45,879 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 294 transitions, 4678 flow [2025-03-14 01:00:45,879 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-14 01:00:45,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:45,879 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-14 01:00:45,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-14 01:00:45,879 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-14 01:00:45,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:45,880 INFO L85 PathProgramCache]: Analyzing trace with hash 432425735, now seen corresponding path program 9 times [2025-03-14 01:00:45,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:45,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191236235] [2025-03-14 01:00:45,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:00:45,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:45,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:45,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:45,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:00:45,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:46,065 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-14 01:00:46,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:46,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191236235] [2025-03-14 01:00:46,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191236235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:46,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:46,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:00:46,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736748742] [2025-03-14 01:00:46,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:46,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:00:46,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:46,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:00:46,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:00:46,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:46,078 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-14 01:00:46,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:46,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:46,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:46,684 INFO L124 PetriNetUnfolderBase]: 2567/4685 cut-off events. [2025-03-14 01:00:46,685 INFO L125 PetriNetUnfolderBase]: For 56662/56839 co-relation queries the response was YES. [2025-03-14 01:00:46,702 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-14 01:00:46,715 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 200 selfloop transitions, 109 changer transitions 4/318 dead transitions. [2025-03-14 01:00:46,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 318 transitions, 5457 flow [2025-03-14 01:00:46,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2025-03-14 01:00:46,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-14 01:00:46,716 INFO L175 Difference]: Start difference. First operand has 190 places, 294 transitions, 4678 flow. Second operand 9 states and 105 transitions. [2025-03-14 01:00:46,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 318 transitions, 5457 flow [2025-03-14 01:00:46,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 318 transitions, 5239 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-03-14 01:00:46,859 INFO L231 Difference]: Finished difference. Result has 190 places, 294 transitions, 4688 flow [2025-03-14 01:00:46,859 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-14 01:00:46,859 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 164 predicate places. [2025-03-14 01:00:46,859 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 294 transitions, 4688 flow [2025-03-14 01:00:46,860 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-14 01:00:46,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:46,860 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-14 01:00:46,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-14 01:00:46,860 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-14 01:00:46,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:46,860 INFO L85 PathProgramCache]: Analyzing trace with hash 839851105, now seen corresponding path program 6 times [2025-03-14 01:00:46,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:46,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394519467] [2025-03-14 01:00:46,860 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:00:46,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:46,864 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:46,867 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-14 01:00:46,867 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:00:46,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:47,005 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-14 01:00:47,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:47,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394519467] [2025-03-14 01:00:47,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394519467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:47,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:47,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:00:47,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966060723] [2025-03-14 01:00:47,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:47,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:00:47,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:47,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:00:47,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:00:47,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:47,018 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-14 01:00:47,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:47,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:47,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:47,539 INFO L124 PetriNetUnfolderBase]: 2552/4663 cut-off events. [2025-03-14 01:00:47,539 INFO L125 PetriNetUnfolderBase]: For 55127/55310 co-relation queries the response was YES. [2025-03-14 01:00:47,559 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-14 01:00:47,573 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 198 selfloop transitions, 110 changer transitions 6/319 dead transitions. [2025-03-14 01:00:47,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 319 transitions, 5515 flow [2025-03-14 01:00:47,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2025-03-14 01:00:47,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2025-03-14 01:00:47,577 INFO L175 Difference]: Start difference. First operand has 190 places, 294 transitions, 4688 flow. Second operand 9 states and 106 transitions. [2025-03-14 01:00:47,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 319 transitions, 5515 flow [2025-03-14 01:00:47,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 319 transitions, 5282 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-14 01:00:47,708 INFO L231 Difference]: Finished difference. Result has 190 places, 293 transitions, 4657 flow [2025-03-14 01:00:47,708 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-14 01:00:47,708 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 164 predicate places. [2025-03-14 01:00:47,708 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 293 transitions, 4657 flow [2025-03-14 01:00:47,708 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-14 01:00:47,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:47,708 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-14 01:00:47,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-14 01:00:47,709 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-14 01:00:47,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:47,709 INFO L85 PathProgramCache]: Analyzing trace with hash 970281313, now seen corresponding path program 10 times [2025-03-14 01:00:47,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:47,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290896753] [2025-03-14 01:00:47,709 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:00:47,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:47,713 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:47,716 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:47,717 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:00:47,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:47,776 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-14 01:00:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:47,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290896753] [2025-03-14 01:00:47,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290896753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:47,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:47,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:00:47,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100469145] [2025-03-14 01:00:47,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:47,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:00:47,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:47,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:00:47,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:00:47,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:47,784 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-14 01:00:47,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:47,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:47,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:48,241 INFO L124 PetriNetUnfolderBase]: 2450/4435 cut-off events. [2025-03-14 01:00:48,241 INFO L125 PetriNetUnfolderBase]: For 52937/53117 co-relation queries the response was YES. [2025-03-14 01:00:48,259 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-14 01:00:48,272 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 200 selfloop transitions, 100 changer transitions 6/311 dead transitions. [2025-03-14 01:00:48,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 311 transitions, 5318 flow [2025-03-14 01:00:48,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:00:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:00:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2025-03-14 01:00:48,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4744897959183674 [2025-03-14 01:00:48,273 INFO L175 Difference]: Start difference. First operand has 190 places, 293 transitions, 4657 flow. Second operand 7 states and 93 transitions. [2025-03-14 01:00:48,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 311 transitions, 5318 flow [2025-03-14 01:00:48,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 311 transitions, 5036 flow, removed 11 selfloop flow, removed 11 redundant places. [2025-03-14 01:00:48,481 INFO L231 Difference]: Finished difference. Result has 184 places, 287 transitions, 4457 flow [2025-03-14 01:00:48,482 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-14 01:00:48,482 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 158 predicate places. [2025-03-14 01:00:48,482 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 287 transitions, 4457 flow [2025-03-14 01:00:48,482 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-14 01:00:48,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:48,483 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-14 01:00:48,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-14 01:00:48,483 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-14 01:00:48,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:48,483 INFO L85 PathProgramCache]: Analyzing trace with hash -488846315, now seen corresponding path program 7 times [2025-03-14 01:00:48,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:48,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035843196] [2025-03-14 01:00:48,484 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:00:48,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:48,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:00:48,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:48,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:48,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:48,632 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-14 01:00:48,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:48,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035843196] [2025-03-14 01:00:48,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035843196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:48,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:48,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:00:48,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388854510] [2025-03-14 01:00:48,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:48,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:00:48,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:48,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:00:48,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:00:48,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:48,646 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-14 01:00:48,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:48,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:48,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:49,240 INFO L124 PetriNetUnfolderBase]: 2432/4402 cut-off events. [2025-03-14 01:00:49,241 INFO L125 PetriNetUnfolderBase]: For 51818/51998 co-relation queries the response was YES. [2025-03-14 01:00:49,258 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-14 01:00:49,272 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 197 selfloop transitions, 98 changer transitions 3/303 dead transitions. [2025-03-14 01:00:49,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 303 transitions, 5107 flow [2025-03-14 01:00:49,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2025-03-14 01:00:49,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-14 01:00:49,274 INFO L175 Difference]: Start difference. First operand has 184 places, 287 transitions, 4457 flow. Second operand 9 states and 99 transitions. [2025-03-14 01:00:49,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 303 transitions, 5107 flow [2025-03-14 01:00:49,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 303 transitions, 4906 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-14 01:00:49,427 INFO L231 Difference]: Finished difference. Result has 184 places, 283 transitions, 4365 flow [2025-03-14 01:00:49,427 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-14 01:00:49,427 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 158 predicate places. [2025-03-14 01:00:49,427 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 283 transitions, 4365 flow [2025-03-14 01:00:49,427 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-14 01:00:49,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:49,427 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-14 01:00:49,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-14 01:00:49,427 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-14 01:00:49,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:49,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2007885113, now seen corresponding path program 8 times [2025-03-14 01:00:49,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:49,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146893722] [2025-03-14 01:00:49,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:49,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:49,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:49,439 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:49,439 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:49,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:49,614 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-14 01:00:49,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:49,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146893722] [2025-03-14 01:00:49,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146893722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:49,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:49,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:00:49,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641750863] [2025-03-14 01:00:49,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:49,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:00:49,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:49,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:00:49,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:00:49,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:49,631 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-14 01:00:49,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:49,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:49,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:50,331 INFO L124 PetriNetUnfolderBase]: 2427/4405 cut-off events. [2025-03-14 01:00:50,331 INFO L125 PetriNetUnfolderBase]: For 51064/51225 co-relation queries the response was YES. [2025-03-14 01:00:50,349 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-14 01:00:50,361 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 195 selfloop transitions, 91 changer transitions 8/299 dead transitions. [2025-03-14 01:00:50,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 299 transitions, 5013 flow [2025-03-14 01:00:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2025-03-14 01:00:50,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38492063492063494 [2025-03-14 01:00:50,363 INFO L175 Difference]: Start difference. First operand has 184 places, 283 transitions, 4365 flow. Second operand 9 states and 97 transitions. [2025-03-14 01:00:50,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 299 transitions, 5013 flow [2025-03-14 01:00:50,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 299 transitions, 4819 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-03-14 01:00:50,500 INFO L231 Difference]: Finished difference. Result has 184 places, 276 transitions, 4217 flow [2025-03-14 01:00:50,501 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-14 01:00:50,501 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 158 predicate places. [2025-03-14 01:00:50,501 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 276 transitions, 4217 flow [2025-03-14 01:00:50,501 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-14 01:00:50,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:50,501 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-14 01:00:50,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-14 01:00:50,501 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-14 01:00:50,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:50,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1284943717, now seen corresponding path program 11 times [2025-03-14 01:00:50,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:50,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090376663] [2025-03-14 01:00:50,502 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:00:50,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:50,506 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:50,510 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:50,510 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:50,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:50,655 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-14 01:00:50,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:50,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090376663] [2025-03-14 01:00:50,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090376663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:50,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045611465] [2025-03-14 01:00:50,656 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:00:50,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:50,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:50,657 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-14 01:00:50,658 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-14 01:00:50,705 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:50,719 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:50,720 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:50,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:50,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 01:00:50,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:50,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:00:50,744 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-14 01:00:50,758 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-14 01:00:50,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:50,803 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-14 01:00:50,804 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-14 01:00:50,820 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-14 01:00:50,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045611465] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:50,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:50,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2025-03-14 01:00:50,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611299213] [2025-03-14 01:00:50,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:50,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:00:50,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:50,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:00:50,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-14 01:00:50,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:50,833 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-14 01:00:50,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:50,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:50,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:51,405 INFO L124 PetriNetUnfolderBase]: 2579/4724 cut-off events. [2025-03-14 01:00:51,405 INFO L125 PetriNetUnfolderBase]: For 54359/54481 co-relation queries the response was YES. [2025-03-14 01:00:51,423 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-14 01:00:51,435 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 214 selfloop transitions, 120 changer transitions 0/339 dead transitions. [2025-03-14 01:00:51,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 339 transitions, 5520 flow [2025-03-14 01:00:51,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:00:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:00:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2025-03-14 01:00:51,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2025-03-14 01:00:51,436 INFO L175 Difference]: Start difference. First operand has 184 places, 276 transitions, 4217 flow. Second operand 7 states and 103 transitions. [2025-03-14 01:00:51,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 339 transitions, 5520 flow [2025-03-14 01:00:51,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 339 transitions, 5280 flow, removed 3 selfloop flow, removed 9 redundant places. [2025-03-14 01:00:51,579 INFO L231 Difference]: Finished difference. Result has 181 places, 289 transitions, 4528 flow [2025-03-14 01:00:51,579 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-14 01:00:51,579 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 155 predicate places. [2025-03-14 01:00:51,579 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 289 transitions, 4528 flow [2025-03-14 01:00:51,580 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-14 01:00:51,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:51,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:51,585 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-14 01:00:51,780 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-14 01:00:51,780 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-14 01:00:51,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1174285997, now seen corresponding path program 12 times [2025-03-14 01:00:51,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:51,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343766919] [2025-03-14 01:00:51,781 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:00:51,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:51,785 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:51,790 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:51,791 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 01:00:51,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:51,928 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-14 01:00:51,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:51,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343766919] [2025-03-14 01:00:51,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343766919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:51,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429523780] [2025-03-14 01:00:51,928 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:00:51,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:51,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:51,930 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-14 01:00:51,930 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-14 01:00:51,976 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:51,990 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:51,990 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 01:00:51,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:51,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-14 01:00:51,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:52,039 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:00:52,039 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-14 01:00:52,044 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-14 01:00:52,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:52,094 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-14 01:00:52,095 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-14 01:00:52,124 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-14 01:00:52,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429523780] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:00:52,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:00:52,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 16 [2025-03-14 01:00:52,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636134499] [2025-03-14 01:00:52,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:00:52,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-14 01:00:52,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:52,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-14 01:00:52,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-14 01:00:52,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:52,158 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-14 01:00:52,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:52,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:52,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:52,795 INFO L124 PetriNetUnfolderBase]: 2818/5165 cut-off events. [2025-03-14 01:00:52,795 INFO L125 PetriNetUnfolderBase]: For 63383/63538 co-relation queries the response was YES. [2025-03-14 01:00:52,819 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-14 01:00:52,834 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 215 selfloop transitions, 135 changer transitions 0/355 dead transitions. [2025-03-14 01:00:52,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 355 transitions, 5945 flow [2025-03-14 01:00:52,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:00:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:00:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2025-03-14 01:00:52,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2025-03-14 01:00:52,835 INFO L175 Difference]: Start difference. First operand has 181 places, 289 transitions, 4528 flow. Second operand 10 states and 123 transitions. [2025-03-14 01:00:52,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 355 transitions, 5945 flow [2025-03-14 01:00:53,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 355 transitions, 5718 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-03-14 01:00:53,011 INFO L231 Difference]: Finished difference. Result has 191 places, 300 transitions, 4884 flow [2025-03-14 01:00:53,012 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-14 01:00:53,012 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 165 predicate places. [2025-03-14 01:00:53,012 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 300 transitions, 4884 flow [2025-03-14 01:00:53,012 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-14 01:00:53,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:53,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-14 01:00:53,018 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-14 01:00:53,212 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-14 01:00:53,213 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-14 01:00:53,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:53,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1349084739, now seen corresponding path program 13 times [2025-03-14 01:00:53,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:53,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594788454] [2025-03-14 01:00:53,213 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:00:53,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:53,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:00:53,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:53,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:53,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:53,366 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-14 01:00:53,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:53,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594788454] [2025-03-14 01:00:53,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594788454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:53,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:53,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:00:53,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044646725] [2025-03-14 01:00:53,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:53,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:00:53,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:53,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:00:53,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:00:53,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:53,382 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-14 01:00:53,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:53,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:53,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:54,060 INFO L124 PetriNetUnfolderBase]: 3058/5587 cut-off events. [2025-03-14 01:00:54,060 INFO L125 PetriNetUnfolderBase]: For 71614/71793 co-relation queries the response was YES. [2025-03-14 01:00:54,082 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-14 01:00:54,096 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 260 selfloop transitions, 119 changer transitions 0/384 dead transitions. [2025-03-14 01:00:54,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 384 transitions, 6485 flow [2025-03-14 01:00:54,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2025-03-14 01:00:54,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-03-14 01:00:54,097 INFO L175 Difference]: Start difference. First operand has 191 places, 300 transitions, 4884 flow. Second operand 9 states and 114 transitions. [2025-03-14 01:00:54,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 384 transitions, 6485 flow [2025-03-14 01:00:54,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 384 transitions, 6328 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-03-14 01:00:54,302 INFO L231 Difference]: Finished difference. Result has 197 places, 307 transitions, 5131 flow [2025-03-14 01:00:54,302 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-14 01:00:54,303 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 171 predicate places. [2025-03-14 01:00:54,303 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 307 transitions, 5131 flow [2025-03-14 01:00:54,303 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-14 01:00:54,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:54,303 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-14 01:00:54,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-14 01:00:54,303 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-14 01:00:54,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:54,303 INFO L85 PathProgramCache]: Analyzing trace with hash -971351909, now seen corresponding path program 14 times [2025-03-14 01:00:54,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:54,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335713895] [2025-03-14 01:00:54,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:54,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:54,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:54,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:54,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:54,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:54,448 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-14 01:00:54,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:54,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335713895] [2025-03-14 01:00:54,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335713895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:54,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293512429] [2025-03-14 01:00:54,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:54,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:54,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:54,451 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-14 01:00:54,452 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-14 01:00:54,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:54,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:54,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:54,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:54,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-14 01:00:54,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:54,571 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:00:54,571 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-14 01:00:54,577 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-14 01:00:54,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:54,639 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-14 01:00:54,639 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-14 01:00:54,654 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-14 01:00:54,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293512429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:00:54,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:00:54,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 16 [2025-03-14 01:00:54,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999122974] [2025-03-14 01:00:54,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:00:54,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-14 01:00:54,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:54,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-14 01:00:54,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-14 01:00:54,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:54,678 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-14 01:00:54,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:54,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:54,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:55,431 INFO L124 PetriNetUnfolderBase]: 2953/5414 cut-off events. [2025-03-14 01:00:55,432 INFO L125 PetriNetUnfolderBase]: For 70720/70875 co-relation queries the response was YES. [2025-03-14 01:00:55,455 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-14 01:00:55,469 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 272 selfloop transitions, 114 changer transitions 2/393 dead transitions. [2025-03-14 01:00:55,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 393 transitions, 6743 flow [2025-03-14 01:00:55,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:00:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:00:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2025-03-14 01:00:55,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4035714285714286 [2025-03-14 01:00:55,470 INFO L175 Difference]: Start difference. First operand has 197 places, 307 transitions, 5131 flow. Second operand 10 states and 113 transitions. [2025-03-14 01:00:55,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 393 transitions, 6743 flow [2025-03-14 01:00:55,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 393 transitions, 6566 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-14 01:00:55,689 INFO L231 Difference]: Finished difference. Result has 203 places, 311 transitions, 5291 flow [2025-03-14 01:00:55,689 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-14 01:00:55,690 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 177 predicate places. [2025-03-14 01:00:55,690 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 311 transitions, 5291 flow [2025-03-14 01:00:55,690 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-14 01:00:55,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:55,690 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-14 01:00:55,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-14 01:00:55,890 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-14 01:00:55,890 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-14 01:00:55,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:55,891 INFO L85 PathProgramCache]: Analyzing trace with hash -503163111, now seen corresponding path program 9 times [2025-03-14 01:00:55,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:55,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769933404] [2025-03-14 01:00:55,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:00:55,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:55,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:55,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:55,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:00:55,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:56,035 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-14 01:00:56,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:56,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769933404] [2025-03-14 01:00:56,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769933404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:56,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275608366] [2025-03-14 01:00:56,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:00:56,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:56,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:56,037 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-14 01:00:56,038 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-14 01:00:56,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:56,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:56,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:00:56,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:56,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-14 01:00:56,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:56,166 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:00:56,166 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-14 01:00:56,171 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-14 01:00:56,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:56,218 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-14 01:00:56,218 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-14 01:00:56,240 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-14 01:00:56,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275608366] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:00:56,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:00:56,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 16 [2025-03-14 01:00:56,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497278883] [2025-03-14 01:00:56,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:00:56,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-14 01:00:56,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:56,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-14 01:00:56,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-14 01:00:56,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:56,273 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-14 01:00:56,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:56,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:56,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:57,028 INFO L124 PetriNetUnfolderBase]: 3052/5564 cut-off events. [2025-03-14 01:00:57,028 INFO L125 PetriNetUnfolderBase]: For 77562/77701 co-relation queries the response was YES. [2025-03-14 01:00:57,051 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-14 01:00:57,063 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 246 selfloop transitions, 141 changer transitions 0/392 dead transitions. [2025-03-14 01:00:57,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 392 transitions, 6932 flow [2025-03-14 01:00:57,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:00:57,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:00:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2025-03-14 01:00:57,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43214285714285716 [2025-03-14 01:00:57,064 INFO L175 Difference]: Start difference. First operand has 203 places, 311 transitions, 5291 flow. Second operand 10 states and 121 transitions. [2025-03-14 01:00:57,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 392 transitions, 6932 flow [2025-03-14 01:00:57,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 392 transitions, 6585 flow, removed 25 selfloop flow, removed 7 redundant places. [2025-03-14 01:00:57,281 INFO L231 Difference]: Finished difference. Result has 207 places, 327 transitions, 5641 flow [2025-03-14 01:00:57,281 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-14 01:00:57,281 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 181 predicate places. [2025-03-14 01:00:57,281 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 327 transitions, 5641 flow [2025-03-14 01:00:57,281 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-14 01:00:57,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:57,282 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-14 01:00:57,288 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-14 01:00:57,482 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-14 01:00:57,482 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-14 01:00:57,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash -665309925, now seen corresponding path program 15 times [2025-03-14 01:00:57,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:57,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829698534] [2025-03-14 01:00:57,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:00:57,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:57,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:57,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-14 01:00:57,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:00:57,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:57,633 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-14 01:00:57,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:57,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829698534] [2025-03-14 01:00:57,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829698534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:57,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:57,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:00:57,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856665027] [2025-03-14 01:00:57,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:57,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:00:57,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:57,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:00:57,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:00:57,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:57,649 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-14 01:00:57,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:57,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:57,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:58,404 INFO L124 PetriNetUnfolderBase]: 3022/5536 cut-off events. [2025-03-14 01:00:58,404 INFO L125 PetriNetUnfolderBase]: For 71642/71779 co-relation queries the response was YES. [2025-03-14 01:00:58,428 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-14 01:00:58,445 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 252 selfloop transitions, 135 changer transitions 0/392 dead transitions. [2025-03-14 01:00:58,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 392 transitions, 6995 flow [2025-03-14 01:00:58,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:58,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2025-03-14 01:00:58,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-14 01:00:58,446 INFO L175 Difference]: Start difference. First operand has 207 places, 327 transitions, 5641 flow. Second operand 9 states and 105 transitions. [2025-03-14 01:00:58,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 392 transitions, 6995 flow [2025-03-14 01:00:58,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 392 transitions, 6606 flow, removed 47 selfloop flow, removed 7 redundant places. [2025-03-14 01:00:58,677 INFO L231 Difference]: Finished difference. Result has 211 places, 331 transitions, 5637 flow [2025-03-14 01:00:58,678 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-14 01:00:58,678 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 185 predicate places. [2025-03-14 01:00:58,678 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 331 transitions, 5637 flow [2025-03-14 01:00:58,678 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-14 01:00:58,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:58,678 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-14 01:00:58,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-14 01:00:58,678 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-14 01:00:58,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:58,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1580391413, now seen corresponding path program 16 times [2025-03-14 01:00:58,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:58,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569087489] [2025-03-14 01:00:58,679 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:00:58,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:58,683 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:58,687 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:58,687 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:00:58,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:58,770 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-14 01:00:58,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:58,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569087489] [2025-03-14 01:00:58,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569087489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:58,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:58,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:00:58,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251880199] [2025-03-14 01:00:58,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:58,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:00:58,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:58,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:00:58,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:00:58,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:00:58,779 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-14 01:00:58,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:58,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:00:58,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:59,516 INFO L124 PetriNetUnfolderBase]: 2992/5511 cut-off events. [2025-03-14 01:00:59,516 INFO L125 PetriNetUnfolderBase]: For 67262/67393 co-relation queries the response was YES. [2025-03-14 01:00:59,541 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-14 01:00:59,556 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 229 selfloop transitions, 140 changer transitions 2/376 dead transitions. [2025-03-14 01:00:59,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 376 transitions, 6780 flow [2025-03-14 01:00:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:00:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:00:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-03-14 01:00:59,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-03-14 01:00:59,557 INFO L175 Difference]: Start difference. First operand has 211 places, 331 transitions, 5637 flow. Second operand 7 states and 100 transitions. [2025-03-14 01:00:59,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 376 transitions, 6780 flow [2025-03-14 01:00:59,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 376 transitions, 6588 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-14 01:00:59,763 INFO L231 Difference]: Finished difference. Result has 214 places, 333 transitions, 5774 flow [2025-03-14 01:00:59,763 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-14 01:00:59,763 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 188 predicate places. [2025-03-14 01:00:59,763 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 333 transitions, 5774 flow [2025-03-14 01:00:59,763 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-14 01:00:59,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:59,764 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-14 01:00:59,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-14 01:00:59,764 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-14 01:00:59,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:59,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1532457057, now seen corresponding path program 10 times [2025-03-14 01:00:59,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:59,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580166781] [2025-03-14 01:00:59,764 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:00:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:59,768 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:59,772 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:59,772 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:00:59,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:59,844 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-14 01:00:59,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:59,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580166781] [2025-03-14 01:00:59,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580166781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:59,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091390824] [2025-03-14 01:00:59,844 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:00:59,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:59,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:59,847 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-14 01:00:59,848 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-14 01:00:59,898 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:00:59,912 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:59,913 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:00:59,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:59,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-14 01:00:59,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:59,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:00:59,957 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-14 01:00:59,971 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-14 01:00:59,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:00,023 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-14 01:01:00,023 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-14 01:01:00,037 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-14 01:01:00,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091390824] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:00,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:01:00,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 8] total 17 [2025-03-14 01:01:00,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144031925] [2025-03-14 01:01:00,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:00,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:01:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:00,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:01:00,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-14 01:01:00,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:00,046 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-14 01:01:00,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:00,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:00,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:00,723 INFO L124 PetriNetUnfolderBase]: 3130/5807 cut-off events. [2025-03-14 01:01:00,723 INFO L125 PetriNetUnfolderBase]: For 71915/72046 co-relation queries the response was YES. [2025-03-14 01:01:00,751 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-14 01:01:00,767 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 246 selfloop transitions, 145 changer transitions 0/396 dead transitions. [2025-03-14 01:01:00,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 396 transitions, 7186 flow [2025-03-14 01:01:00,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:01:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:01:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2025-03-14 01:01:00,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2025-03-14 01:01:00,767 INFO L175 Difference]: Start difference. First operand has 214 places, 333 transitions, 5774 flow. Second operand 7 states and 106 transitions. [2025-03-14 01:01:00,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 396 transitions, 7186 flow [2025-03-14 01:01:00,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 396 transitions, 6712 flow, removed 30 selfloop flow, removed 14 redundant places. [2025-03-14 01:01:00,963 INFO L231 Difference]: Finished difference. Result has 208 places, 344 transitions, 5892 flow [2025-03-14 01:01:00,963 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-14 01:01:00,964 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 182 predicate places. [2025-03-14 01:01:00,964 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 344 transitions, 5892 flow [2025-03-14 01:01:00,964 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-14 01:01:00,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:00,964 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-14 01:01:00,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-14 01:01:01,164 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-14 01:01:01,165 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-14 01:01:01,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:01,165 INFO L85 PathProgramCache]: Analyzing trace with hash -239139503, now seen corresponding path program 11 times [2025-03-14 01:01:01,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:01,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082301730] [2025-03-14 01:01:01,165 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:01:01,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:01,169 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:01:01,174 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:01:01,174 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:01:01,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:01,309 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-14 01:01:01,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:01,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082301730] [2025-03-14 01:01:01,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082301730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:01,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858284998] [2025-03-14 01:01:01,309 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:01:01,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:01,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:01,311 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-14 01:01:01,312 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-14 01:01:01,360 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:01:01,374 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:01:01,374 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:01:01,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:01,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-14 01:01:01,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:01,493 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-14 01:01:01,493 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-14 01:01:01,507 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-14 01:01:01,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:01,580 INFO L349 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-03-14 01:01:01,580 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-14 01:01:01,707 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-14 01:01:01,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858284998] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:01,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:01,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 27 [2025-03-14 01:01:01,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408023032] [2025-03-14 01:01:01,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:01,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-14 01:01:01,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:01,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-14 01:01:01,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2025-03-14 01:01:01,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-14 01:01:01,785 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-14 01:01:01,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:01,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-14 01:01:01,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:03,338 INFO L124 PetriNetUnfolderBase]: 3496/6369 cut-off events. [2025-03-14 01:01:03,338 INFO L125 PetriNetUnfolderBase]: For 72863/72911 co-relation queries the response was YES. [2025-03-14 01:01:03,364 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-14 01:01:03,379 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 394 selfloop transitions, 251 changer transitions 3/652 dead transitions. [2025-03-14 01:01:03,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 652 transitions, 10344 flow [2025-03-14 01:01:03,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-14 01:01:03,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-14 01:01:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 451 transitions. [2025-03-14 01:01:03,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3835034013605442 [2025-03-14 01:01:03,380 INFO L175 Difference]: Start difference. First operand has 208 places, 344 transitions, 5892 flow. Second operand 42 states and 451 transitions. [2025-03-14 01:01:03,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 652 transitions, 10344 flow [2025-03-14 01:01:03,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 652 transitions, 10127 flow, removed 18 selfloop flow, removed 2 redundant places. [2025-03-14 01:01:03,609 INFO L231 Difference]: Finished difference. Result has 253 places, 423 transitions, 7788 flow [2025-03-14 01:01:03,609 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-14 01:01:03,609 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 227 predicate places. [2025-03-14 01:01:03,609 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 423 transitions, 7788 flow [2025-03-14 01:01:03,609 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-14 01:01:03,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:03,609 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-14 01:01:03,615 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-14 01:01:03,810 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-14 01:01:03,810 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-14 01:01:03,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:03,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1072002133, now seen corresponding path program 12 times [2025-03-14 01:01:03,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:03,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577992973] [2025-03-14 01:01:03,810 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:01:03,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:03,815 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:01:03,821 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:01:03,821 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 01:01:03,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:03,950 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-14 01:01:03,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:03,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577992973] [2025-03-14 01:01:03,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577992973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:03,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:03,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:01:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823549542] [2025-03-14 01:01:03,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:03,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:01:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:03,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:01:03,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:01:03,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:03,963 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-14 01:01:03,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:03,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:03,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:04,738 INFO L124 PetriNetUnfolderBase]: 3184/5931 cut-off events. [2025-03-14 01:01:04,738 INFO L125 PetriNetUnfolderBase]: For 75788/75923 co-relation queries the response was YES. [2025-03-14 01:01:04,768 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-14 01:01:04,785 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 282 selfloop transitions, 187 changer transitions 10/484 dead transitions. [2025-03-14 01:01:04,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 484 transitions, 9163 flow [2025-03-14 01:01:04,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:01:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:01:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2025-03-14 01:01:04,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2025-03-14 01:01:04,786 INFO L175 Difference]: Start difference. First operand has 253 places, 423 transitions, 7788 flow. Second operand 9 states and 100 transitions. [2025-03-14 01:01:04,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 484 transitions, 9163 flow [2025-03-14 01:01:05,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 484 transitions, 8597 flow, removed 113 selfloop flow, removed 10 redundant places. [2025-03-14 01:01:05,133 INFO L231 Difference]: Finished difference. Result has 252 places, 415 transitions, 7401 flow [2025-03-14 01:01:05,133 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-14 01:01:05,134 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 226 predicate places. [2025-03-14 01:01:05,134 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 415 transitions, 7401 flow [2025-03-14 01:01:05,134 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-14 01:01:05,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:05,134 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-14 01:01:05,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-14 01:01:05,134 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-14 01:01:05,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:05,134 INFO L85 PathProgramCache]: Analyzing trace with hash -116617391, now seen corresponding path program 13 times [2025-03-14 01:01:05,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:05,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549661940] [2025-03-14 01:01:05,134 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:01:05,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:05,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:01:05,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:01:05,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:05,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:05,290 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-14 01:01:05,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:05,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549661940] [2025-03-14 01:01:05,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549661940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:05,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:05,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:01:05,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862101310] [2025-03-14 01:01:05,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:05,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:01:05,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:05,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:01:05,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:01:05,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:05,308 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-14 01:01:05,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:05,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:05,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:06,102 INFO L124 PetriNetUnfolderBase]: 3146/5868 cut-off events. [2025-03-14 01:01:06,103 INFO L125 PetriNetUnfolderBase]: For 65644/65781 co-relation queries the response was YES. [2025-03-14 01:01:06,135 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-14 01:01:06,153 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 257 selfloop transitions, 193 changer transitions 7/462 dead transitions. [2025-03-14 01:01:06,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 462 transitions, 8596 flow [2025-03-14 01:01:06,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:01:06,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:01:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2025-03-14 01:01:06,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-03-14 01:01:06,154 INFO L175 Difference]: Start difference. First operand has 252 places, 415 transitions, 7401 flow. Second operand 9 states and 102 transitions. [2025-03-14 01:01:06,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 462 transitions, 8596 flow [2025-03-14 01:01:06,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 462 transitions, 8217 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-03-14 01:01:06,419 INFO L231 Difference]: Finished difference. Result has 250 places, 407 transitions, 7229 flow [2025-03-14 01:01:06,419 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-14 01:01:06,419 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 224 predicate places. [2025-03-14 01:01:06,419 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 407 transitions, 7229 flow [2025-03-14 01:01:06,419 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-14 01:01:06,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:06,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:01:06,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-14 01:01:06,420 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-14 01:01:06,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:06,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1076995717, now seen corresponding path program 14 times [2025-03-14 01:01:06,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:06,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544941064] [2025-03-14 01:01:06,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:01:06,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:06,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:01:06,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-14 01:01:06,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:01:06,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:06,572 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-14 01:01:06,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:06,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544941064] [2025-03-14 01:01:06,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544941064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:06,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:06,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:01:06,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996079203] [2025-03-14 01:01:06,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:06,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:01:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:06,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:01:06,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:01:06,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:06,590 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-14 01:01:06,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:06,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:06,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:07,373 INFO L124 PetriNetUnfolderBase]: 3082/5744 cut-off events. [2025-03-14 01:01:07,373 INFO L125 PetriNetUnfolderBase]: For 64787/64918 co-relation queries the response was YES. [2025-03-14 01:01:07,404 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-14 01:01:07,422 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 248 selfloop transitions, 193 changer transitions 5/451 dead transitions. [2025-03-14 01:01:07,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 451 transitions, 8369 flow [2025-03-14 01:01:07,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:01:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:01:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2025-03-14 01:01:07,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2025-03-14 01:01:07,423 INFO L175 Difference]: Start difference. First operand has 250 places, 407 transitions, 7229 flow. Second operand 9 states and 100 transitions. [2025-03-14 01:01:07,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 451 transitions, 8369 flow [2025-03-14 01:01:07,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 451 transitions, 7948 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-03-14 01:01:07,682 INFO L231 Difference]: Finished difference. Result has 246 places, 399 transitions, 7034 flow [2025-03-14 01:01:07,682 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-14 01:01:07,682 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 220 predicate places. [2025-03-14 01:01:07,682 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 399 transitions, 7034 flow [2025-03-14 01:01:07,682 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-14 01:01:07,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:07,682 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-14 01:01:07,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-14 01:01:07,683 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-14 01:01:07,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash -53954839, now seen corresponding path program 17 times [2025-03-14 01:01:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:07,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687537972] [2025-03-14 01:01:07,683 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:01:07,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:07,689 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:01:07,694 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:01:07,694 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:01:07,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:07,907 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-14 01:01:07,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:07,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687537972] [2025-03-14 01:01:07,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687537972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:07,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273383250] [2025-03-14 01:01:07,908 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:01:07,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:07,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:07,910 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-14 01:01:07,912 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-14 01:01:08,004 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:01:08,021 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:01:08,021 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:01:08,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:08,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-14 01:01:08,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:08,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:01:08,110 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-14 01:01:08,128 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-14 01:01:08,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:01:08,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273383250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:08,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:01:08,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2025-03-14 01:01:08,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523480301] [2025-03-14 01:01:08,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:08,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:01:08,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:08,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:01:08,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-14 01:01:08,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:08,137 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-14 01:01:08,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:08,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:08,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:08,928 INFO L124 PetriNetUnfolderBase]: 2986/5529 cut-off events. [2025-03-14 01:01:08,929 INFO L125 PetriNetUnfolderBase]: For 60222/60353 co-relation queries the response was YES. [2025-03-14 01:01:08,951 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-14 01:01:08,966 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 246 selfloop transitions, 187 changer transitions 6/444 dead transitions. [2025-03-14 01:01:08,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 444 transitions, 8186 flow [2025-03-14 01:01:08,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:01:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:01:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2025-03-14 01:01:08,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-14 01:01:08,967 INFO L175 Difference]: Start difference. First operand has 246 places, 399 transitions, 7034 flow. Second operand 9 states and 98 transitions. [2025-03-14 01:01:08,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 444 transitions, 8186 flow [2025-03-14 01:01:09,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 444 transitions, 7751 flow, removed 9 selfloop flow, removed 8 redundant places. [2025-03-14 01:01:09,176 INFO L231 Difference]: Finished difference. Result has 241 places, 393 transitions, 6848 flow [2025-03-14 01:01:09,176 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-14 01:01:09,177 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 215 predicate places. [2025-03-14 01:01:09,177 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 393 transitions, 6848 flow [2025-03-14 01:01:09,177 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-14 01:01:09,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:09,177 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-14 01:01:09,184 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-14 01:01:09,377 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-14 01:01:09,377 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-14 01:01:09,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:09,378 INFO L85 PathProgramCache]: Analyzing trace with hash -876537755, now seen corresponding path program 15 times [2025-03-14 01:01:09,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:09,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866057848] [2025-03-14 01:01:09,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:01:09,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:09,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:01:09,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-14 01:01:09,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:01:09,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:09,584 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-14 01:01:09,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:09,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866057848] [2025-03-14 01:01:09,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866057848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:09,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:09,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:01:09,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238560897] [2025-03-14 01:01:09,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:09,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:01:09,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:09,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:01:09,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:01:09,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:09,605 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-14 01:01:09,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:09,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:09,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:10,533 INFO L124 PetriNetUnfolderBase]: 2968/5488 cut-off events. [2025-03-14 01:01:10,533 INFO L125 PetriNetUnfolderBase]: For 59965/60104 co-relation queries the response was YES. [2025-03-14 01:01:10,556 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-14 01:01:10,571 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 248 selfloop transitions, 165 changer transitions 5/423 dead transitions. [2025-03-14 01:01:10,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 423 transitions, 7805 flow [2025-03-14 01:01:10,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:01:10,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:01:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2025-03-14 01:01:10,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-14 01:01:10,572 INFO L175 Difference]: Start difference. First operand has 241 places, 393 transitions, 6848 flow. Second operand 9 states and 105 transitions. [2025-03-14 01:01:10,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 423 transitions, 7805 flow [2025-03-14 01:01:10,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 423 transitions, 7416 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-14 01:01:10,772 INFO L231 Difference]: Finished difference. Result has 240 places, 387 transitions, 6659 flow [2025-03-14 01:01:10,772 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-14 01:01:10,773 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 214 predicate places. [2025-03-14 01:01:10,773 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 387 transitions, 6659 flow [2025-03-14 01:01:10,773 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-14 01:01:10,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:10,773 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-14 01:01:10,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-14 01:01:10,773 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-14 01:01:10,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:10,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1986799719, now seen corresponding path program 16 times [2025-03-14 01:01:10,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:10,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931689410] [2025-03-14 01:01:10,773 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:01:10,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:10,778 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:01:10,782 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:01:10,782 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:01:10,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:10,842 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-14 01:01:10,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:10,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931689410] [2025-03-14 01:01:10,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931689410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:10,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:10,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:01:10,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716764476] [2025-03-14 01:01:10,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:10,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:01:10,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:10,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:01:10,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:01:10,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:10,854 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-14 01:01:10,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:10,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:10,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:11,602 INFO L124 PetriNetUnfolderBase]: 2871/5270 cut-off events. [2025-03-14 01:01:11,603 INFO L125 PetriNetUnfolderBase]: For 57689/57819 co-relation queries the response was YES. [2025-03-14 01:01:11,628 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-14 01:01:11,647 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 254 selfloop transitions, 151 changer transitions 7/417 dead transitions. [2025-03-14 01:01:11,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 417 transitions, 7604 flow [2025-03-14 01:01:11,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:01:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:01:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2025-03-14 01:01:11,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4744897959183674 [2025-03-14 01:01:11,648 INFO L175 Difference]: Start difference. First operand has 240 places, 387 transitions, 6659 flow. Second operand 7 states and 93 transitions. [2025-03-14 01:01:11,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 417 transitions, 7604 flow [2025-03-14 01:01:11,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 417 transitions, 7258 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-14 01:01:11,854 INFO L231 Difference]: Finished difference. Result has 238 places, 379 transitions, 6436 flow [2025-03-14 01:01:11,854 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-14 01:01:11,854 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 212 predicate places. [2025-03-14 01:01:11,854 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 379 transitions, 6436 flow [2025-03-14 01:01:11,854 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-14 01:01:11,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:11,855 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-14 01:01:11,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-14 01:01:11,855 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-14 01:01:11,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:11,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1707293375, now seen corresponding path program 17 times [2025-03-14 01:01:11,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:11,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230787984] [2025-03-14 01:01:11,855 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:01:11,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:11,860 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:01:11,864 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:01:11,865 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:01:11,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:12,142 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-14 01:01:12,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:12,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230787984] [2025-03-14 01:01:12,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230787984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:12,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158869742] [2025-03-14 01:01:12,143 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:01:12,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:12,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:12,150 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-14 01:01:12,152 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-14 01:01:12,233 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:01:12,250 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:01:12,250 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:01:12,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:12,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-14 01:01:12,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:12,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:01:12,340 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-14 01:01:12,361 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-14 01:01:12,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:01:12,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158869742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:12,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:01:12,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2025-03-14 01:01:12,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111611201] [2025-03-14 01:01:12,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:12,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:01:12,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:12,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:01:12,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-14 01:01:12,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:12,376 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-14 01:01:12,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:12,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:12,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:13,103 INFO L124 PetriNetUnfolderBase]: 2806/5120 cut-off events. [2025-03-14 01:01:13,103 INFO L125 PetriNetUnfolderBase]: For 57041/57172 co-relation queries the response was YES. [2025-03-14 01:01:13,125 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-14 01:01:13,140 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 239 selfloop transitions, 158 changer transitions 5/407 dead transitions. [2025-03-14 01:01:13,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 407 transitions, 7378 flow [2025-03-14 01:01:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:01:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:01:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2025-03-14 01:01:13,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-14 01:01:13,141 INFO L175 Difference]: Start difference. First operand has 238 places, 379 transitions, 6436 flow. Second operand 9 states and 99 transitions. [2025-03-14 01:01:13,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 407 transitions, 7378 flow [2025-03-14 01:01:13,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 407 transitions, 7053 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-14 01:01:13,332 INFO L231 Difference]: Finished difference. Result has 237 places, 375 transitions, 6356 flow [2025-03-14 01:01:13,332 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-14 01:01:13,332 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 211 predicate places. [2025-03-14 01:01:13,332 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 375 transitions, 6356 flow [2025-03-14 01:01:13,332 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-14 01:01:13,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:13,332 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-14 01:01:13,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-14 01:01:13,533 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-14 01:01:13,533 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-14 01:01:13,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash 53949903, now seen corresponding path program 18 times [2025-03-14 01:01:13,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:13,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190810771] [2025-03-14 01:01:13,534 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:01:13,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:13,538 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:01:13,542 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-14 01:01:13,542 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:01:13,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:13,672 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-14 01:01:13,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:13,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190810771] [2025-03-14 01:01:13,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190810771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:13,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:13,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:01:13,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906934988] [2025-03-14 01:01:13,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:13,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:01:13,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:13,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:01:13,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:01:13,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:13,692 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-14 01:01:13,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:13,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:13,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:14,566 INFO L124 PetriNetUnfolderBase]: 2710/4914 cut-off events. [2025-03-14 01:01:14,566 INFO L125 PetriNetUnfolderBase]: For 54878/55005 co-relation queries the response was YES. [2025-03-14 01:01:14,596 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-14 01:01:14,617 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 244 selfloop transitions, 150 changer transitions 5/404 dead transitions. [2025-03-14 01:01:14,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 404 transitions, 7273 flow [2025-03-14 01:01:14,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:01:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:01:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2025-03-14 01:01:14,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4087301587301587 [2025-03-14 01:01:14,617 INFO L175 Difference]: Start difference. First operand has 237 places, 375 transitions, 6356 flow. Second operand 9 states and 103 transitions. [2025-03-14 01:01:14,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 404 transitions, 7273 flow [2025-03-14 01:01:14,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 404 transitions, 6943 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-03-14 01:01:14,842 INFO L231 Difference]: Finished difference. Result has 233 places, 370 transitions, 6224 flow [2025-03-14 01:01:14,842 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-14 01:01:14,843 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 207 predicate places. [2025-03-14 01:01:14,843 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 370 transitions, 6224 flow [2025-03-14 01:01:14,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-14 01:01:14,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:14,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-14 01:01:14,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-14 01:01:14,843 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-14 01:01:14,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:14,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1888993589, now seen corresponding path program 19 times [2025-03-14 01:01:14,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:14,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528590982] [2025-03-14 01:01:14,844 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:01:14,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:14,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:01:14,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:01:14,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:14,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:15,012 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-14 01:01:15,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:15,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528590982] [2025-03-14 01:01:15,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528590982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:15,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:15,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:01:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328635941] [2025-03-14 01:01:15,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:15,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:01:15,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:15,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:01:15,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:01:15,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:15,029 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-14 01:01:15,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:15,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:15,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:15,698 INFO L124 PetriNetUnfolderBase]: 2699/4905 cut-off events. [2025-03-14 01:01:15,698 INFO L125 PetriNetUnfolderBase]: For 54598/54723 co-relation queries the response was YES. [2025-03-14 01:01:15,723 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-14 01:01:15,741 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 239 selfloop transitions, 147 changer transitions 8/399 dead transitions. [2025-03-14 01:01:15,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 399 transitions, 7171 flow [2025-03-14 01:01:15,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:01:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:01:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2025-03-14 01:01:15,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-14 01:01:15,742 INFO L175 Difference]: Start difference. First operand has 233 places, 370 transitions, 6224 flow. Second operand 9 states and 98 transitions. [2025-03-14 01:01:15,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 399 transitions, 7171 flow [2025-03-14 01:01:15,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 399 transitions, 6863 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-14 01:01:15,928 INFO L231 Difference]: Finished difference. Result has 232 places, 364 transitions, 6115 flow [2025-03-14 01:01:15,928 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-14 01:01:15,928 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 206 predicate places. [2025-03-14 01:01:15,929 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 364 transitions, 6115 flow [2025-03-14 01:01:15,929 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-14 01:01:15,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:15,929 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-14 01:01:15,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-14 01:01:15,929 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-14 01:01:15,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:15,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1564633043, now seen corresponding path program 20 times [2025-03-14 01:01:15,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:15,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520019476] [2025-03-14 01:01:15,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:01:15,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:15,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 01:01:15,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-14 01:01:15,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:01:15,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:16,071 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-14 01:01:16,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:16,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520019476] [2025-03-14 01:01:16,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520019476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:16,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:16,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:01:16,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145164360] [2025-03-14 01:01:16,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:16,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:01:16,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:16,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:01:16,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:01:16,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:16,083 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-14 01:01:16,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:16,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:16,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:16,700 INFO L124 PetriNetUnfolderBase]: 2588/4665 cut-off events. [2025-03-14 01:01:16,700 INFO L125 PetriNetUnfolderBase]: For 49986/50108 co-relation queries the response was YES. [2025-03-14 01:01:16,719 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-14 01:01:16,732 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 234 selfloop transitions, 145 changer transitions 5/389 dead transitions. [2025-03-14 01:01:16,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 389 transitions, 6993 flow [2025-03-14 01:01:16,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:01:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:01:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2025-03-14 01:01:16,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2025-03-14 01:01:16,733 INFO L175 Difference]: Start difference. First operand has 232 places, 364 transitions, 6115 flow. Second operand 9 states and 96 transitions. [2025-03-14 01:01:16,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 389 transitions, 6993 flow [2025-03-14 01:01:16,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 389 transitions, 6631 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-03-14 01:01:16,890 INFO L231 Difference]: Finished difference. Result has 228 places, 359 transitions, 5954 flow [2025-03-14 01:01:16,890 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-14 01:01:16,890 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 202 predicate places. [2025-03-14 01:01:16,890 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 359 transitions, 5954 flow [2025-03-14 01:01:16,890 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-14 01:01:16,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:16,891 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-14 01:01:16,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-14 01:01:16,891 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-14 01:01:16,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:16,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2086445909, now seen corresponding path program 18 times [2025-03-14 01:01:16,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:16,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872374039] [2025-03-14 01:01:16,891 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:01:16,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:16,896 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-03-14 01:01:16,899 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-03-14 01:01:16,899 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:01:16,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:17,026 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-14 01:01:17,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:17,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872374039] [2025-03-14 01:01:17,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872374039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:17,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:17,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:01:17,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881120987] [2025-03-14 01:01:17,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:17,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:01:17,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:17,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:01:17,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:01:17,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:17,047 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-14 01:01:17,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:17,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:17,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:17,600 INFO L124 PetriNetUnfolderBase]: 2615/4684 cut-off events. [2025-03-14 01:01:17,600 INFO L125 PetriNetUnfolderBase]: For 51770/51916 co-relation queries the response was YES. [2025-03-14 01:01:17,620 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-14 01:01:17,633 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 272 selfloop transitions, 107 changer transitions 0/384 dead transitions. [2025-03-14 01:01:17,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 384 transitions, 6983 flow [2025-03-14 01:01:17,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:01:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:01:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2025-03-14 01:01:17,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38492063492063494 [2025-03-14 01:01:17,634 INFO L175 Difference]: Start difference. First operand has 228 places, 359 transitions, 5954 flow. Second operand 9 states and 97 transitions. [2025-03-14 01:01:17,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 384 transitions, 6983 flow [2025-03-14 01:01:17,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 384 transitions, 6607 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-14 01:01:17,797 INFO L231 Difference]: Finished difference. Result has 223 places, 363 transitions, 5907 flow [2025-03-14 01:01:17,797 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-14 01:01:17,798 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 197 predicate places. [2025-03-14 01:01:17,798 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 363 transitions, 5907 flow [2025-03-14 01:01:17,798 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-14 01:01:17,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:17,798 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-14 01:01:17,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-14 01:01:17,798 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-14 01:01:17,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:17,799 INFO L85 PathProgramCache]: Analyzing trace with hash -783725745, now seen corresponding path program 19 times [2025-03-14 01:01:17,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:17,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993128857] [2025-03-14 01:01:17,799 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:01:17,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:17,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:01:17,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:01:17,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:17,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:17,957 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-14 01:01:17,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:17,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993128857] [2025-03-14 01:01:17,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993128857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:17,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145263815] [2025-03-14 01:01:17,958 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:01:17,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:17,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:17,960 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-14 01:01:17,961 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-14 01:01:18,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:01:18,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:01:18,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:18,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:18,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 01:01:18,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:18,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:01:18,070 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-14 01:01:18,084 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-14 01:01:18,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:18,132 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-14 01:01:18,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 40 treesize of output 56 [2025-03-14 01:01:18,147 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-14 01:01:18,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145263815] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:18,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:01:18,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 18 [2025-03-14 01:01:18,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043038042] [2025-03-14 01:01:18,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:18,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:01:18,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:18,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:01:18,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:01:18,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:18,154 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-14 01:01:18,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:18,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:18,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:18,681 INFO L124 PetriNetUnfolderBase]: 2547/4556 cut-off events. [2025-03-14 01:01:18,681 INFO L125 PetriNetUnfolderBase]: For 48047/48185 co-relation queries the response was YES. [2025-03-14 01:01:18,702 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-14 01:01:18,715 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 273 selfloop transitions, 106 changer transitions 0/384 dead transitions. [2025-03-14 01:01:18,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 384 transitions, 6840 flow [2025-03-14 01:01:18,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:01:18,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:01:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2025-03-14 01:01:18,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2025-03-14 01:01:18,716 INFO L175 Difference]: Start difference. First operand has 223 places, 363 transitions, 5907 flow. Second operand 7 states and 86 transitions. [2025-03-14 01:01:18,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 384 transitions, 6840 flow [2025-03-14 01:01:18,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 384 transitions, 6601 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-03-14 01:01:18,877 INFO L231 Difference]: Finished difference. Result has 222 places, 363 transitions, 5891 flow [2025-03-14 01:01:18,877 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-14 01:01:18,877 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 196 predicate places. [2025-03-14 01:01:18,877 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 363 transitions, 5891 flow [2025-03-14 01:01:18,877 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-14 01:01:18,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:18,877 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-14 01:01:18,883 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-14 01:01:19,078 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-14 01:01:19,078 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-14 01:01:19,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:19,078 INFO L85 PathProgramCache]: Analyzing trace with hash 324619719, now seen corresponding path program 20 times [2025-03-14 01:01:19,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:19,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893571143] [2025-03-14 01:01:19,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:01:19,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:19,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-14 01:01:19,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-03-14 01:01:19,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:01:19,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:19,229 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-14 01:01:19,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:19,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893571143] [2025-03-14 01:01:19,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893571143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:19,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:19,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:01:19,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955830717] [2025-03-14 01:01:19,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:19,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:01:19,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:19,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:01:19,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:01:19,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:19,247 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-14 01:01:19,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:19,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:19,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:19,874 INFO L124 PetriNetUnfolderBase]: 2523/4519 cut-off events. [2025-03-14 01:01:19,874 INFO L125 PetriNetUnfolderBase]: For 46400/46507 co-relation queries the response was YES. [2025-03-14 01:01:19,897 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-14 01:01:19,912 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 242 selfloop transitions, 154 changer transitions 3/404 dead transitions. [2025-03-14 01:01:19,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 404 transitions, 7044 flow [2025-03-14 01:01:19,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:01:19,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:01:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2025-03-14 01:01:19,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38492063492063494 [2025-03-14 01:01:19,912 INFO L175 Difference]: Start difference. First operand has 222 places, 363 transitions, 5891 flow. Second operand 9 states and 97 transitions. [2025-03-14 01:01:19,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 404 transitions, 7044 flow [2025-03-14 01:01:20,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 404 transitions, 6811 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-03-14 01:01:20,068 INFO L231 Difference]: Finished difference. Result has 225 places, 366 transitions, 5999 flow [2025-03-14 01:01:20,068 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-14 01:01:20,068 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 199 predicate places. [2025-03-14 01:01:20,068 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 366 transitions, 5999 flow [2025-03-14 01:01:20,069 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-14 01:01:20,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:20,069 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-14 01:01:20,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-14 01:01:20,069 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-14 01:01:20,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:20,069 INFO L85 PathProgramCache]: Analyzing trace with hash -494724444, now seen corresponding path program 1 times [2025-03-14 01:01:20,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:20,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322816040] [2025-03-14 01:01:20,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:20,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:20,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:01:20,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:01:20,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:20,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:20,145 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-14 01:01:20,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:20,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322816040] [2025-03-14 01:01:20,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322816040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:20,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494118994] [2025-03-14 01:01:20,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:20,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:20,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:20,147 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-14 01:01:20,148 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-14 01:01:20,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:01:20,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:01:20,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:20,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:20,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 01:01:20,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:20,330 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-14 01:01:20,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:20,414 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-14 01:01:20,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494118994] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:20,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:20,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-14 01:01:20,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494615088] [2025-03-14 01:01:20,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:20,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-14 01:01:20,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:20,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-14 01:01:20,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2025-03-14 01:01:20,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:20,466 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-14 01:01:20,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:20,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:20,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:21,442 INFO L124 PetriNetUnfolderBase]: 3868/6953 cut-off events. [2025-03-14 01:01:21,443 INFO L125 PetriNetUnfolderBase]: For 68179/68321 co-relation queries the response was YES. [2025-03-14 01:01:21,481 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-14 01:01:21,507 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 565 selfloop transitions, 18 changer transitions 1/589 dead transitions. [2025-03-14 01:01:21,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 589 transitions, 10567 flow [2025-03-14 01:01:21,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:01:21,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:01:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2025-03-14 01:01:21,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-14 01:01:21,509 INFO L175 Difference]: Start difference. First operand has 225 places, 366 transitions, 5999 flow. Second operand 11 states and 143 transitions. [2025-03-14 01:01:21,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 589 transitions, 10567 flow [2025-03-14 01:01:21,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 589 transitions, 10020 flow, removed 4 selfloop flow, removed 17 redundant places. [2025-03-14 01:01:21,768 INFO L231 Difference]: Finished difference. Result has 220 places, 378 transitions, 5960 flow [2025-03-14 01:01:21,769 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-14 01:01:21,769 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 194 predicate places. [2025-03-14 01:01:21,769 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 378 transitions, 5960 flow [2025-03-14 01:01:21,769 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-14 01:01:21,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:21,769 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-14 01:01:21,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-14 01:01:21,969 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-14 01:01:21,970 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-14 01:01:21,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:21,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1045282210, now seen corresponding path program 2 times [2025-03-14 01:01:21,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:21,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968780058] [2025-03-14 01:01:21,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:01:21,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:21,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-14 01:01:21,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 24 statements. [2025-03-14 01:01:21,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:01:21,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:22,003 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-14 01:01:22,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:22,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968780058] [2025-03-14 01:01:22,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968780058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:22,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:22,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:01:22,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665085700] [2025-03-14 01:01:22,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:22,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:01:22,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:22,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:01:22,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:01:22,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:22,008 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-14 01:01:22,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:22,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:22,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:22,968 INFO L124 PetriNetUnfolderBase]: 4146/7414 cut-off events. [2025-03-14 01:01:22,969 INFO L125 PetriNetUnfolderBase]: For 77599/77777 co-relation queries the response was YES. [2025-03-14 01:01:23,008 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-14 01:01:23,039 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 427 selfloop transitions, 53 changer transitions 3/488 dead transitions. [2025-03-14 01:01:23,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 488 transitions, 8239 flow [2025-03-14 01:01:23,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:01:23,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:01:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-03-14 01:01:23,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2025-03-14 01:01:23,040 INFO L175 Difference]: Start difference. First operand has 220 places, 378 transitions, 5960 flow. Second operand 5 states and 74 transitions. [2025-03-14 01:01:23,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 488 transitions, 8239 flow [2025-03-14 01:01:23,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 488 transitions, 8168 flow, removed 25 selfloop flow, removed 6 redundant places. [2025-03-14 01:01:23,340 INFO L231 Difference]: Finished difference. Result has 220 places, 388 transitions, 6269 flow [2025-03-14 01:01:23,340 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-14 01:01:23,341 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 194 predicate places. [2025-03-14 01:01:23,341 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 388 transitions, 6269 flow [2025-03-14 01:01:23,341 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-14 01:01:23,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:23,341 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-14 01:01:23,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-14 01:01:23,341 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-14 01:01:23,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:23,342 INFO L85 PathProgramCache]: Analyzing trace with hash 575149163, now seen corresponding path program 1 times [2025-03-14 01:01:23,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:23,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144019789] [2025-03-14 01:01:23,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:23,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:23,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:01:23,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:01:23,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:23,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:23,397 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-14 01:01:23,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:23,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144019789] [2025-03-14 01:01:23,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144019789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:23,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286913457] [2025-03-14 01:01:23,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:23,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:23,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:23,399 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-14 01:01:23,400 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-14 01:01:23,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:01:23,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:01:23,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:23,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:23,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:01:23,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:23,545 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-14 01:01:23,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:23,591 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-14 01:01:23,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286913457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:23,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:23,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-14 01:01:23,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120108761] [2025-03-14 01:01:23,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:23,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-14 01:01:23,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:23,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-14 01:01:23,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-14 01:01:23,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:23,638 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-14 01:01:23,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:23,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:23,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:24,335 INFO L124 PetriNetUnfolderBase]: 2499/4692 cut-off events. [2025-03-14 01:01:24,336 INFO L125 PetriNetUnfolderBase]: For 55614/55738 co-relation queries the response was YES. [2025-03-14 01:01:24,358 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-14 01:01:24,373 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 357 selfloop transitions, 111 changer transitions 0/472 dead transitions. [2025-03-14 01:01:24,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 472 transitions, 8397 flow [2025-03-14 01:01:24,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 01:01:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 01:01:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 217 transitions. [2025-03-14 01:01:24,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2025-03-14 01:01:24,374 INFO L175 Difference]: Start difference. First operand has 220 places, 388 transitions, 6269 flow. Second operand 17 states and 217 transitions. [2025-03-14 01:01:24,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 472 transitions, 8397 flow [2025-03-14 01:01:24,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 472 transitions, 7980 flow, removed 182 selfloop flow, removed 12 redundant places. [2025-03-14 01:01:24,582 INFO L231 Difference]: Finished difference. Result has 212 places, 302 transitions, 5348 flow [2025-03-14 01:01:24,582 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-14 01:01:24,582 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 186 predicate places. [2025-03-14 01:01:24,582 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 302 transitions, 5348 flow [2025-03-14 01:01:24,583 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-14 01:01:24,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:24,583 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-14 01:01:24,589 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-14 01:01:24,783 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-14 01:01:24,783 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-14 01:01:24,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:24,784 INFO L85 PathProgramCache]: Analyzing trace with hash 262990697, now seen corresponding path program 1 times [2025-03-14 01:01:24,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:24,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222587630] [2025-03-14 01:01:24,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:24,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:24,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:01:24,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:01:24,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:24,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:24,837 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-14 01:01:24,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:24,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222587630] [2025-03-14 01:01:24,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222587630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:24,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854112554] [2025-03-14 01:01:24,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:24,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:24,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:24,839 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-14 01:01:24,840 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-14 01:01:24,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:01:24,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:01:24,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:24,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:24,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:01:24,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:24,963 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-14 01:01:24,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:25,017 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-14 01:01:25,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854112554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:25,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:25,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-14 01:01:25,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676538624] [2025-03-14 01:01:25,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:25,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-14 01:01:25,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:25,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-14 01:01:25,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-14 01:01:25,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:25,055 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-14 01:01:25,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:25,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:25,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:25,544 INFO L124 PetriNetUnfolderBase]: 1611/3293 cut-off events. [2025-03-14 01:01:25,544 INFO L125 PetriNetUnfolderBase]: For 29555/29633 co-relation queries the response was YES. [2025-03-14 01:01:25,559 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-14 01:01:25,566 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 154 selfloop transitions, 35 changer transitions 232/424 dead transitions. [2025-03-14 01:01:25,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 424 transitions, 7631 flow [2025-03-14 01:01:25,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 01:01:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 01:01:25,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 200 transitions. [2025-03-14 01:01:25,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42016806722689076 [2025-03-14 01:01:25,567 INFO L175 Difference]: Start difference. First operand has 212 places, 302 transitions, 5348 flow. Second operand 17 states and 200 transitions. [2025-03-14 01:01:25,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 424 transitions, 7631 flow [2025-03-14 01:01:25,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 424 transitions, 7564 flow, removed 9 selfloop flow, removed 9 redundant places. [2025-03-14 01:01:25,660 INFO L231 Difference]: Finished difference. Result has 225 places, 165 transitions, 2873 flow [2025-03-14 01:01:25,660 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-14 01:01:25,662 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 199 predicate places. [2025-03-14 01:01:25,663 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 165 transitions, 2873 flow [2025-03-14 01:01:25,663 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-14 01:01:25,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:25,663 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-14 01:01:25,669 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-14 01:01:25,863 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-14 01:01:25,863 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-14 01:01:25,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:25,865 INFO L85 PathProgramCache]: Analyzing trace with hash -976398347, now seen corresponding path program 3 times [2025-03-14 01:01:25,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:25,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639176977] [2025-03-14 01:01:25,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:01:25,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:25,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-03-14 01:01:25,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 24 statements. [2025-03-14 01:01:25,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:01:25,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:25,901 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-14 01:01:25,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:25,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639176977] [2025-03-14 01:01:25,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639176977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:25,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:25,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:01:25,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100013049] [2025-03-14 01:01:25,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:25,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:01:25,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:25,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:01:25,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:01:25,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:25,906 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-14 01:01:25,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:25,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:25,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:26,104 INFO L124 PetriNetUnfolderBase]: 937/1799 cut-off events. [2025-03-14 01:01:26,105 INFO L125 PetriNetUnfolderBase]: For 18565/18586 co-relation queries the response was YES. [2025-03-14 01:01:26,111 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-14 01:01:26,115 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 130 selfloop transitions, 14 changer transitions 63/210 dead transitions. [2025-03-14 01:01:26,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 210 transitions, 3822 flow [2025-03-14 01:01:26,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:01:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:01:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-03-14 01:01:26,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-03-14 01:01:26,116 INFO L175 Difference]: Start difference. First operand has 225 places, 165 transitions, 2873 flow. Second operand 5 states and 76 transitions. [2025-03-14 01:01:26,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 210 transitions, 3822 flow [2025-03-14 01:01:26,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 210 transitions, 3451 flow, removed 112 selfloop flow, removed 26 redundant places. [2025-03-14 01:01:26,154 INFO L231 Difference]: Finished difference. Result has 172 places, 106 transitions, 1521 flow [2025-03-14 01:01:26,154 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-14 01:01:26,155 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 146 predicate places. [2025-03-14 01:01:26,155 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 106 transitions, 1521 flow [2025-03-14 01:01:26,155 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-14 01:01:26,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:26,155 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-14 01:01:26,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-14 01:01:26,155 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-14 01:01:26,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:26,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1712345616, now seen corresponding path program 2 times [2025-03-14 01:01:26,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:26,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006980718] [2025-03-14 01:01:26,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:01:26,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:26,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:01:26,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:01:26,164 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:01:26,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:26,237 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-14 01:01:26,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:26,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006980718] [2025-03-14 01:01:26,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006980718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:26,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752195416] [2025-03-14 01:01:26,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:01:26,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:26,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:26,239 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-14 01:01:26,241 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-14 01:01:26,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:01:26,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:01:26,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:01:26,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:26,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-14 01:01:26,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:26,384 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-14 01:01:26,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:26,446 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-14 01:01:26,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752195416] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:26,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:26,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2025-03-14 01:01:26,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235896240] [2025-03-14 01:01:26,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:26,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-14 01:01:26,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:26,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-14 01:01:26,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-14 01:01:26,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-14 01:01:26,474 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-14 01:01:26,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:26,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-14 01:01:26,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:26,835 INFO L124 PetriNetUnfolderBase]: 1238/2153 cut-off events. [2025-03-14 01:01:26,836 INFO L125 PetriNetUnfolderBase]: For 15649/15692 co-relation queries the response was YES. [2025-03-14 01:01:26,843 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-14 01:01:26,848 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 141 selfloop transitions, 33 changer transitions 13/189 dead transitions. [2025-03-14 01:01:26,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 189 transitions, 2791 flow [2025-03-14 01:01:26,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:01:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:01:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2025-03-14 01:01:26,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38311688311688313 [2025-03-14 01:01:26,848 INFO L175 Difference]: Start difference. First operand has 172 places, 106 transitions, 1521 flow. Second operand 11 states and 118 transitions. [2025-03-14 01:01:26,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 189 transitions, 2791 flow [2025-03-14 01:01:26,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 189 transitions, 2575 flow, removed 76 selfloop flow, removed 13 redundant places. [2025-03-14 01:01:26,868 INFO L231 Difference]: Finished difference. Result has 154 places, 110 transitions, 1534 flow [2025-03-14 01:01:26,869 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-14 01:01:26,869 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 128 predicate places. [2025-03-14 01:01:26,869 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 110 transitions, 1534 flow [2025-03-14 01:01:26,869 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-14 01:01:26,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:26,869 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-14 01:01:26,875 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-14 01:01:27,069 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-14 01:01:27,070 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-14 01:01:27,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:27,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1497121210, now seen corresponding path program 2 times [2025-03-14 01:01:27,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:27,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447985524] [2025-03-14 01:01:27,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:01:27,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:27,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:01:27,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:01:27,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:01:27,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:27,181 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-14 01:01:27,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:27,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447985524] [2025-03-14 01:01:27,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447985524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:27,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112463588] [2025-03-14 01:01:27,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:01:27,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:27,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:27,183 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-14 01:01:27,184 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-14 01:01:27,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:01:27,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:01:27,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:01:27,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:27,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-14 01:01:27,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:27,371 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-14 01:01:27,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:27,484 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-14 01:01:27,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112463588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:27,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:27,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-03-14 01:01:27,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371409554] [2025-03-14 01:01:27,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:27,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-14 01:01:27,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:27,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-14 01:01:27,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-03-14 01:01:27,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-14 01:01:27,524 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-14 01:01:27,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:27,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-14 01:01:27,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:28,217 INFO L124 PetriNetUnfolderBase]: 3159/5493 cut-off events. [2025-03-14 01:01:28,217 INFO L125 PetriNetUnfolderBase]: For 34511/34609 co-relation queries the response was YES. [2025-03-14 01:01:28,238 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-14 01:01:28,256 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 294 selfloop transitions, 75 changer transitions 0/372 dead transitions. [2025-03-14 01:01:28,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 372 transitions, 5593 flow [2025-03-14 01:01:28,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:01:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:01:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 208 transitions. [2025-03-14 01:01:28,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35374149659863946 [2025-03-14 01:01:28,257 INFO L175 Difference]: Start difference. First operand has 154 places, 110 transitions, 1534 flow. Second operand 21 states and 208 transitions. [2025-03-14 01:01:28,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 372 transitions, 5593 flow [2025-03-14 01:01:28,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 372 transitions, 5436 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-14 01:01:28,316 INFO L231 Difference]: Finished difference. Result has 169 places, 151 transitions, 2336 flow [2025-03-14 01:01:28,316 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-14 01:01:28,316 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 143 predicate places. [2025-03-14 01:01:28,316 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 151 transitions, 2336 flow [2025-03-14 01:01:28,316 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-14 01:01:28,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:28,316 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-14 01:01:28,322 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-14 01:01:28,517 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-14 01:01:28,517 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-14 01:01:28,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:28,517 INFO L85 PathProgramCache]: Analyzing trace with hash 988667838, now seen corresponding path program 3 times [2025-03-14 01:01:28,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:28,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103026416] [2025-03-14 01:01:28,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:01:28,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:28,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:01:28,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:01:28,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:01:28,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:28,595 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-14 01:01:28,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:28,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103026416] [2025-03-14 01:01:28,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103026416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:28,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891440519] [2025-03-14 01:01:28,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:01:28,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:28,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:28,597 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-14 01:01:28,598 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-14 01:01:28,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:01:28,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:01:28,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:01:28,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:28,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-14 01:01:28,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:28,760 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-14 01:01:28,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:28,843 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-14 01:01:28,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891440519] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:28,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:01:28,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 21 [2025-03-14 01:01:28,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202231502] [2025-03-14 01:01:28,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:28,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:01:28,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:28,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:01:28,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-03-14 01:01:28,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-14 01:01:28,854 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-14 01:01:28,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:28,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-14 01:01:28,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:29,495 INFO L124 PetriNetUnfolderBase]: 3641/6403 cut-off events. [2025-03-14 01:01:29,495 INFO L125 PetriNetUnfolderBase]: For 43655/43669 co-relation queries the response was YES. [2025-03-14 01:01:29,525 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-14 01:01:29,547 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 216 selfloop transitions, 41 changer transitions 12/271 dead transitions. [2025-03-14 01:01:29,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 271 transitions, 4280 flow [2025-03-14 01:01:29,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:01:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:01:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2025-03-14 01:01:29,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42207792207792205 [2025-03-14 01:01:29,548 INFO L175 Difference]: Start difference. First operand has 169 places, 151 transitions, 2336 flow. Second operand 11 states and 130 transitions. [2025-03-14 01:01:29,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 271 transitions, 4280 flow [2025-03-14 01:01:29,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 271 transitions, 4188 flow, removed 38 selfloop flow, removed 6 redundant places. [2025-03-14 01:01:29,645 INFO L231 Difference]: Finished difference. Result has 177 places, 157 transitions, 2562 flow [2025-03-14 01:01:29,646 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-14 01:01:29,646 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 151 predicate places. [2025-03-14 01:01:29,646 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 157 transitions, 2562 flow [2025-03-14 01:01:29,646 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-14 01:01:29,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:29,646 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-14 01:01:29,652 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-14 01:01:29,847 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-14 01:01:29,847 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-14 01:01:29,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:29,847 INFO L85 PathProgramCache]: Analyzing trace with hash 90673136, now seen corresponding path program 4 times [2025-03-14 01:01:29,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:29,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109850181] [2025-03-14 01:01:29,847 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:01:29,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:29,853 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:01:29,854 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 26 statements. [2025-03-14 01:01:29,854 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:01:29,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:29,877 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-14 01:01:29,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:29,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109850181] [2025-03-14 01:01:29,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109850181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:29,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236481947] [2025-03-14 01:01:29,878 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:01:29,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:29,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:29,880 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-14 01:01:29,881 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-14 01:01:29,943 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:01:29,950 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 26 statements. [2025-03-14 01:01:29,950 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:01:29,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:29,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-14 01:01:29,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:29,990 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-14 01:01:29,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:30,013 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-14 01:01:30,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236481947] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:30,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:30,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-14 01:01:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141812878] [2025-03-14 01:01:30,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:30,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:01:30,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:30,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:01:30,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:01:30,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-14 01:01:30,021 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-14 01:01:30,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:30,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-14 01:01:30,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:31,030 INFO L124 PetriNetUnfolderBase]: 4769/8359 cut-off events. [2025-03-14 01:01:31,030 INFO L125 PetriNetUnfolderBase]: For 61413/61413 co-relation queries the response was YES. [2025-03-14 01:01:31,068 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-14 01:01:31,095 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 350 selfloop transitions, 130 changer transitions 6/487 dead transitions. [2025-03-14 01:01:31,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 487 transitions, 7211 flow [2025-03-14 01:01:31,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-14 01:01:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-14 01:01:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 292 transitions. [2025-03-14 01:01:31,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2025-03-14 01:01:31,097 INFO L175 Difference]: Start difference. First operand has 177 places, 157 transitions, 2562 flow. Second operand 24 states and 292 transitions. [2025-03-14 01:01:31,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 487 transitions, 7211 flow [2025-03-14 01:01:31,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 487 transitions, 7040 flow, removed 53 selfloop flow, removed 7 redundant places. [2025-03-14 01:01:31,261 INFO L231 Difference]: Finished difference. Result has 205 places, 229 transitions, 4101 flow [2025-03-14 01:01:31,261 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-14 01:01:31,261 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 179 predicate places. [2025-03-14 01:01:31,261 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 229 transitions, 4101 flow [2025-03-14 01:01:31,261 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-14 01:01:31,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:31,262 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-14 01:01:31,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-03-14 01:01:31,462 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-14 01:01:31,462 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-14 01:01:31,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:31,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1812987746, now seen corresponding path program 5 times [2025-03-14 01:01:31,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:31,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203048860] [2025-03-14 01:01:31,463 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:01:31,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:31,468 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:01:31,471 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:01:31,471 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:01:31,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:31,530 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-14 01:01:31,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:31,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203048860] [2025-03-14 01:01:31,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203048860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:31,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464460465] [2025-03-14 01:01:31,531 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:01:31,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:31,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:31,532 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-14 01:01:31,533 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-14 01:01:31,597 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:01:31,615 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:01:31,615 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:01:31,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:31,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-14 01:01:31,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:31,708 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-14 01:01:31,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:31,806 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-14 01:01:31,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464460465] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:31,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:31,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-14 01:01:31,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378730684] [2025-03-14 01:01:31,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:31,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 01:01:31,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:31,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 01:01:31,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-03-14 01:01:31,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-14 01:01:31,820 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-14 01:01:31,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:31,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-14 01:01:31,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:32,850 INFO L124 PetriNetUnfolderBase]: 4645/8113 cut-off events. [2025-03-14 01:01:32,850 INFO L125 PetriNetUnfolderBase]: For 76167/76167 co-relation queries the response was YES. [2025-03-14 01:01:32,896 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-14 01:01:32,923 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 272 selfloop transitions, 122 changer transitions 0/395 dead transitions. [2025-03-14 01:01:32,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 395 transitions, 7003 flow [2025-03-14 01:01:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 01:01:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 01:01:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 161 transitions. [2025-03-14 01:01:32,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.359375 [2025-03-14 01:01:32,924 INFO L175 Difference]: Start difference. First operand has 205 places, 229 transitions, 4101 flow. Second operand 16 states and 161 transitions. [2025-03-14 01:01:32,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 395 transitions, 7003 flow [2025-03-14 01:01:33,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 395 transitions, 6627 flow, removed 84 selfloop flow, removed 13 redundant places. [2025-03-14 01:01:33,133 INFO L231 Difference]: Finished difference. Result has 206 places, 245 transitions, 4362 flow [2025-03-14 01:01:33,133 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-14 01:01:33,134 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 180 predicate places. [2025-03-14 01:01:33,134 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 245 transitions, 4362 flow [2025-03-14 01:01:33,134 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-14 01:01:33,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:33,134 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-14 01:01:33,142 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-14 01:01:33,334 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-14 01:01:33,334 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-14 01:01:33,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:33,335 INFO L85 PathProgramCache]: Analyzing trace with hash -238089059, now seen corresponding path program 1 times [2025-03-14 01:01:33,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:33,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286957085] [2025-03-14 01:01:33,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:33,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:33,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:01:33,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:01:33,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:33,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:33,610 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-14 01:01:33,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:33,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286957085] [2025-03-14 01:01:33,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286957085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:33,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322568738] [2025-03-14 01:01:33,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:33,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:33,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:33,612 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-14 01:01:33,612 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-14 01:01:33,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:01:33,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:01:33,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:33,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:33,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-14 01:01:33,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:33,776 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-14 01:01:33,776 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-14 01:01:33,789 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-14 01:01:33,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:33,966 INFO L349 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-03-14 01:01:33,966 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-14 01:01:33,992 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-14 01:01:33,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322568738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:33,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:33,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 25 [2025-03-14 01:01:33,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722374681] [2025-03-14 01:01:33,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:33,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-14 01:01:33,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:33,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-14 01:01:33,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-03-14 01:01:34,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:34,052 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-14 01:01:34,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:34,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:34,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:35,294 INFO L124 PetriNetUnfolderBase]: 4265/7652 cut-off events. [2025-03-14 01:01:35,294 INFO L125 PetriNetUnfolderBase]: For 71936/72097 co-relation queries the response was YES. [2025-03-14 01:01:35,332 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-14 01:01:35,354 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 260 selfloop transitions, 74 changer transitions 7/354 dead transitions. [2025-03-14 01:01:35,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 354 transitions, 6495 flow [2025-03-14 01:01:35,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 01:01:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 01:01:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 154 transitions. [2025-03-14 01:01:35,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2025-03-14 01:01:35,355 INFO L175 Difference]: Start difference. First operand has 206 places, 245 transitions, 4362 flow. Second operand 15 states and 154 transitions. [2025-03-14 01:01:35,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 354 transitions, 6495 flow [2025-03-14 01:01:35,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 354 transitions, 6364 flow, removed 35 selfloop flow, removed 8 redundant places. [2025-03-14 01:01:35,553 INFO L231 Difference]: Finished difference. Result has 217 places, 253 transitions, 4610 flow [2025-03-14 01:01:35,553 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-14 01:01:35,554 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 191 predicate places. [2025-03-14 01:01:35,554 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 253 transitions, 4610 flow [2025-03-14 01:01:35,554 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-14 01:01:35,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:35,554 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-14 01:01:35,562 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-14 01:01:35,754 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-14 01:01:35,754 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-14 01:01:35,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1504747097, now seen corresponding path program 2 times [2025-03-14 01:01:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:35,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636135398] [2025-03-14 01:01:35,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:01:35,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:35,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:01:35,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:01:35,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:01:35,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:36,101 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-14 01:01:36,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:36,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636135398] [2025-03-14 01:01:36,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636135398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:36,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069115056] [2025-03-14 01:01:36,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:01:36,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:36,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:36,104 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-14 01:01:36,105 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-14 01:01:36,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:01:36,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:01:36,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:01:36,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:36,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-14 01:01:36,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:36,372 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:01:36,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 39 treesize of output 19 [2025-03-14 01:01:36,392 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-14 01:01:36,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:36,574 INFO L349 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-03-14 01:01:36,575 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-14 01:01:36,637 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-14 01:01:36,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069115056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:36,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:36,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 28 [2025-03-14 01:01:36,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493576120] [2025-03-14 01:01:36,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:36,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-14 01:01:36,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:36,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-14 01:01:36,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2025-03-14 01:01:36,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:36,760 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-14 01:01:36,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:36,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:36,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:39,476 INFO L124 PetriNetUnfolderBase]: 8889/16028 cut-off events. [2025-03-14 01:01:39,476 INFO L125 PetriNetUnfolderBase]: For 171310/171543 co-relation queries the response was YES. [2025-03-14 01:01:39,571 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-14 01:01:39,626 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 608 selfloop transitions, 219 changer transitions 13/853 dead transitions. [2025-03-14 01:01:39,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 853 transitions, 15984 flow [2025-03-14 01:01:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-14 01:01:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-14 01:01:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 368 transitions. [2025-03-14 01:01:39,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2025-03-14 01:01:39,627 INFO L175 Difference]: Start difference. First operand has 217 places, 253 transitions, 4610 flow. Second operand 32 states and 368 transitions. [2025-03-14 01:01:39,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 853 transitions, 15984 flow [2025-03-14 01:01:40,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 853 transitions, 15662 flow, removed 86 selfloop flow, removed 9 redundant places. [2025-03-14 01:01:40,338 INFO L231 Difference]: Finished difference. Result has 253 places, 391 transitions, 7815 flow [2025-03-14 01:01:40,338 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-14 01:01:40,339 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 227 predicate places. [2025-03-14 01:01:40,339 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 391 transitions, 7815 flow [2025-03-14 01:01:40,339 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-14 01:01:40,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:40,339 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-14 01:01:40,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-03-14 01:01:40,539 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-14 01:01:40,540 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-14 01:01:40,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1487153441, now seen corresponding path program 3 times [2025-03-14 01:01:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:40,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842227563] [2025-03-14 01:01:40,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:01:40,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:40,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:01:40,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:01:40,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:01:40,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:40,808 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-14 01:01:40,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:40,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842227563] [2025-03-14 01:01:40,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842227563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:40,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949772192] [2025-03-14 01:01:40,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:01:40,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:40,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:40,810 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-14 01:01:40,811 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-14 01:01:40,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:01:40,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:01:40,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:01:40,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:40,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-14 01:01:40,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:41,196 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:01:41,197 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-14 01:01:41,213 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-14 01:01:41,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:41,400 INFO L349 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-03-14 01:01:41,400 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-14 01:01:41,441 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-14 01:01:41,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949772192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:41,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:41,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 30 [2025-03-14 01:01:41,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003553756] [2025-03-14 01:01:41,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:41,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-14 01:01:41,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:41,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-14 01:01:41,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2025-03-14 01:01:41,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:41,580 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-14 01:01:41,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:41,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:41,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:44,543 INFO L124 PetriNetUnfolderBase]: 9073/16420 cut-off events. [2025-03-14 01:01:44,543 INFO L125 PetriNetUnfolderBase]: For 208047/208232 co-relation queries the response was YES. [2025-03-14 01:01:44,684 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-14 01:01:44,964 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 599 selfloop transitions, 233 changer transitions 18/863 dead transitions. [2025-03-14 01:01:44,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 863 transitions, 17092 flow [2025-03-14 01:01:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-14 01:01:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-14 01:01:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 361 transitions. [2025-03-14 01:01:44,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4029017857142857 [2025-03-14 01:01:44,965 INFO L175 Difference]: Start difference. First operand has 253 places, 391 transitions, 7815 flow. Second operand 32 states and 361 transitions. [2025-03-14 01:01:44,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 863 transitions, 17092 flow [2025-03-14 01:01:46,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 863 transitions, 16592 flow, removed 165 selfloop flow, removed 7 redundant places. [2025-03-14 01:01:46,201 INFO L231 Difference]: Finished difference. Result has 279 places, 417 transitions, 8562 flow [2025-03-14 01:01:46,201 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-14 01:01:46,201 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 253 predicate places. [2025-03-14 01:01:46,201 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 417 transitions, 8562 flow [2025-03-14 01:01:46,202 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-14 01:01:46,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:46,202 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-14 01:01:46,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-03-14 01:01:46,402 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-14 01:01:46,402 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-14 01:01:46,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:46,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1041535459, now seen corresponding path program 4 times [2025-03-14 01:01:46,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:46,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481461748] [2025-03-14 01:01:46,403 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:01:46,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:46,410 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:01:46,416 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:01:46,416 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:01:46,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:46,544 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-14 01:01:46,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:46,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481461748] [2025-03-14 01:01:46,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481461748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:46,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261415755] [2025-03-14 01:01:46,544 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:01:46,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:46,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:46,547 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-14 01:01:46,548 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-14 01:01:46,626 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:01:46,647 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:01:46,647 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:01:46,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:46,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-14 01:01:46,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:46,803 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-14 01:01:46,804 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-14 01:01:46,822 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-14 01:01:46,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:46,961 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-14 01:01:46,961 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-14 01:01:46,998 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-14 01:01:46,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261415755] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:46,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:46,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 9] total 22 [2025-03-14 01:01:46,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250619982] [2025-03-14 01:01:46,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:46,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-14 01:01:47,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:47,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-14 01:01:47,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2025-03-14 01:01:47,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:47,099 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-14 01:01:47,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:47,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:47,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:50,574 INFO L124 PetriNetUnfolderBase]: 10365/18981 cut-off events. [2025-03-14 01:01:50,574 INFO L125 PetriNetUnfolderBase]: For 248441/248791 co-relation queries the response was YES. [2025-03-14 01:01:50,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124732 conditions, 18981 events. 10365/18981 cut-off events. For 248441/248791 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 161599 event pairs, 1835 based on Foata normal form. 32/18929 useless extension candidates. Maximal degree in co-relation 124647. Up to 6871 conditions per place. [2025-03-14 01:01:50,773 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 317 selfloop transitions, 287 changer transitions 17/634 dead transitions. [2025-03-14 01:01:50,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 634 transitions, 12312 flow [2025-03-14 01:01:50,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-14 01:01:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-14 01:01:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 294 transitions. [2025-03-14 01:01:50,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42 [2025-03-14 01:01:50,774 INFO L175 Difference]: Start difference. First operand has 279 places, 417 transitions, 8562 flow. Second operand 25 states and 294 transitions. [2025-03-14 01:01:50,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 634 transitions, 12312 flow [2025-03-14 01:01:52,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 634 transitions, 11753 flow, removed 112 selfloop flow, removed 17 redundant places. [2025-03-14 01:01:52,038 INFO L231 Difference]: Finished difference. Result has 295 places, 484 transitions, 10060 flow [2025-03-14 01:01:52,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=8057, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=10060, PETRI_PLACES=295, PETRI_TRANSITIONS=484} [2025-03-14 01:01:52,039 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 269 predicate places. [2025-03-14 01:01:52,039 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 484 transitions, 10060 flow [2025-03-14 01:01:52,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-14 01:01:52,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:52,039 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-14 01:01:52,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-03-14 01:01:52,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2025-03-14 01:01:52,240 INFO L396 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:01:52,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:52,240 INFO L85 PathProgramCache]: Analyzing trace with hash -185195807, now seen corresponding path program 5 times [2025-03-14 01:01:52,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:52,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008751984] [2025-03-14 01:01:52,241 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:01:52,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:52,246 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:01:52,253 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:01:52,253 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:01:52,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:01:52,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:52,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008751984] [2025-03-14 01:01:52,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008751984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:52,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453070854] [2025-03-14 01:01:52,569 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:01:52,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:52,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:52,571 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:01:52,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-14 01:01:52,641 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:01:52,660 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:01:52,660 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:01:52,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:52,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-14 01:01:52,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:52,751 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-14 01:01:52,751 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-14 01:01:52,769 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-14 01:01:52,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:52,924 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-14 01:01:52,924 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 110 treesize of output 78 [2025-03-14 01:01:52,956 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-14 01:01:52,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453070854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:52,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:52,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 21 [2025-03-14 01:01:52,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506935937] [2025-03-14 01:01:52,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:52,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-14 01:01:52,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:52,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-14 01:01:52,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2025-03-14 01:01:53,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-14 01:01:53,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 484 transitions, 10060 flow. Second operand has 21 states, 21 states have (on average 7.333333333333333) internal successors, (154), 21 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:01:53,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:53,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-14 01:01:53,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand