./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue_ok.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:14:20,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:14:20,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:14:20,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:14:20,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:14:20,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:14:20,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:14:20,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:14:20,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:14:20,555 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:14:20,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:14:20,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:14:20,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:14:20,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:14:20,555 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:14:20,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:14:20,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:14:20,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:14:20,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:14:20,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:14:20,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:14:20,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:14:20,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:14:20,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:14:20,557 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-jdk21/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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2025-02-06 04:14:20,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:14:20,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:14:20,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:14:20,803 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:14:20,803 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:14:20,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok.i [2025-02-06 04:14:22,048 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/996539f3a/0b4604731d0c4ec887b942e4c8367f99/FLAG82de8d0ca [2025-02-06 04:14:22,478 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:14:22,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok.i [2025-02-06 04:14:22,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/996539f3a/0b4604731d0c4ec887b942e4c8367f99/FLAG82de8d0ca [2025-02-06 04:14:22,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/996539f3a/0b4604731d0c4ec887b942e4c8367f99 [2025-02-06 04:14:22,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:14:22,615 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:14:22,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:14:22,616 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:14:22,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:14:22,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:14:22" (1/1) ... [2025-02-06 04:14:22,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ccf8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:14:22, skipping insertion in model container [2025-02-06 04:14:22,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:14:22" (1/1) ... [2025-02-06 04:14:22,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:14:22,873 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2025-02-06 04:14:22,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2025-02-06 04:14:22,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:14:22,892 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:14:22,933 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2025-02-06 04:14:22,935 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2025-02-06 04:14:22,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:14:22,990 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:14:22,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:14:22 WrapperNode [2025-02-06 04:14:22,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:14:22,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:14:22,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:14:22,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:14:22,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:14:22" (1/1) ... [2025-02-06 04:14:23,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:14:22" (1/1) ... [2025-02-06 04:14:23,024 INFO L138 Inliner]: procedures = 274, calls = 92, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 231 [2025-02-06 04:14:23,024 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:14:23,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:14:23,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:14:23,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:14:23,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:14:22" (1/1) ... [2025-02-06 04:14:23,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:14:22" (1/1) ... [2025-02-06 04:14:23,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:14:22" (1/1) ... [2025-02-06 04:14:23,047 INFO L175 MemorySlicer]: Split 75 memory accesses to 4 slices as follows [2, 5, 22, 46]. 61 percent of accesses are in the largest equivalence class. The 50 initializations are split as follows [2, 5, 20, 23]. The 11 writes are split as follows [0, 0, 1, 10]. [2025-02-06 04:14:23,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:14:22" (1/1) ... [2025-02-06 04:14:23,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:14:22" (1/1) ... [2025-02-06 04:14:23,054 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:14:22" (1/1) ... [2025-02-06 04:14:23,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:14:22" (1/1) ... [2025-02-06 04:14:23,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:14:22" (1/1) ... [2025-02-06 04:14:23,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:14:22" (1/1) ... [2025-02-06 04:14:23,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:14:23,059 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:14:23,059 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:14:23,059 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:14:23,059 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:14:22" (1/1) ... [2025-02-06 04:14:23,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:14:23,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:14:23,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:14:23,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 04:14:23,121 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 04:14:23,121 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 04:14:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:14:23,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:14:23,122 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:14:23,218 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:14:23,220 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:14:23,449 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:14:23,449 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:14:23,655 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:14:23,655 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:14:23,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:14:23 BoogieIcfgContainer [2025-02-06 04:14:23,656 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:14:23,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:14:23,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:14:23,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:14:23,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:14:22" (1/3) ... [2025-02-06 04:14:23,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfc2f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:14:23, skipping insertion in model container [2025-02-06 04:14:23,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:14:22" (2/3) ... [2025-02-06 04:14:23,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfc2f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:14:23, skipping insertion in model container [2025-02-06 04:14:23,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:14:23" (3/3) ... [2025-02-06 04:14:23,662 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2025-02-06 04:14:23,671 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:14:23,672 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok.i that has 3 procedures, 34 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-06 04:14:23,672 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:14:23,722 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:14:23,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 40 transitions, 94 flow [2025-02-06 04:14:23,759 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2025-02-06 04:14:23,761 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:14:23,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 38 events. 7/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 30. Up to 3 conditions per place. [2025-02-06 04:14:23,763 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 40 transitions, 94 flow [2025-02-06 04:14:23,765 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 36 transitions, 81 flow [2025-02-06 04:14:23,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:14:23,776 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;@8031711, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:14:23,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 04:14:23,780 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:14:23,780 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 04:14:23,780 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:14:23,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:14:23,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 04:14:23,781 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:14:23,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:14:23,784 INFO L85 PathProgramCache]: Analyzing trace with hash 546573, now seen corresponding path program 1 times [2025-02-06 04:14:23,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:14:23,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603931588] [2025-02-06 04:14:23,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:14:23,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:14:23,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 04:14:23,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 04:14:23,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:14:23,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:14:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:14:23,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:14:23,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603931588] [2025-02-06 04:14:23,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603931588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:14:23,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:14:23,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:14:23,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380400415] [2025-02-06 04:14:23,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:14:23,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:14:23,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:14:23,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:14:23,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:14:23,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-02-06 04:14:23,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 81 flow. Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:14:23,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:14:23,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-02-06 04:14:23,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:14:24,056 INFO L124 PetriNetUnfolderBase]: 288/497 cut-off events. [2025-02-06 04:14:24,056 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-02-06 04:14:24,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 497 events. 288/497 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1974 event pairs, 197 based on Foata normal form. 15/435 useless extension candidates. Maximal degree in co-relation 910. Up to 458 conditions per place. [2025-02-06 04:14:24,063 INFO L140 encePairwiseOnDemand]: 38/40 looper letters, 25 selfloop transitions, 0 changer transitions 2/32 dead transitions. [2025-02-06 04:14:24,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 127 flow [2025-02-06 04:14:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:14:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 04:14:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2025-02-06 04:14:24,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-02-06 04:14:24,072 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 81 flow. Second operand 2 states and 45 transitions. [2025-02-06 04:14:24,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 127 flow [2025-02-06 04:14:24,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:14:24,076 INFO L231 Difference]: Finished difference. Result has 32 places, 30 transitions, 64 flow [2025-02-06 04:14:24,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=32, PETRI_TRANSITIONS=30} [2025-02-06 04:14:24,079 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2025-02-06 04:14:24,079 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 64 flow [2025-02-06 04:14:24,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:14:24,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:14:24,080 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:14:24,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:14:24,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:14:24,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:14:24,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1935570877, now seen corresponding path program 1 times [2025-02-06 04:14:24,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:14:24,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296326692] [2025-02-06 04:14:24,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:14:24,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:14:24,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:14:24,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:14:24,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:14:24,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:14:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:14:24,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:14:24,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296326692] [2025-02-06 04:14:24,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296326692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:14:24,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:14:24,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:14:24,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517143385] [2025-02-06 04:14:24,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:14:24,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:14:24,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:14:24,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:14:24,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:14:24,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-02-06 04:14:24,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:14:24,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:14:24,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-02-06 04:14:24,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:14:24,421 INFO L124 PetriNetUnfolderBase]: 147/301 cut-off events. [2025-02-06 04:14:24,421 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 04:14:24,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 301 events. 147/301 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1062 event pairs, 76 based on Foata normal form. 13/279 useless extension candidates. Maximal degree in co-relation 588. Up to 146 conditions per place. [2025-02-06 04:14:24,425 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 27 selfloop transitions, 2 changer transitions 4/38 dead transitions. [2025-02-06 04:14:24,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 149 flow [2025-02-06 04:14:24,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:14:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:14:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-02-06 04:14:24,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-02-06 04:14:24,427 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 64 flow. Second operand 3 states and 58 transitions. [2025-02-06 04:14:24,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 149 flow [2025-02-06 04:14:24,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 149 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:14:24,429 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 70 flow [2025-02-06 04:14:24,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2025-02-06 04:14:24,431 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2025-02-06 04:14:24,431 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 70 flow [2025-02-06 04:14:24,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:14:24,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:14:24,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:14:24,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:14:24,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:14:24,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:14:24,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1432794347, now seen corresponding path program 1 times [2025-02-06 04:14:24,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:14:24,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586580666] [2025-02-06 04:14:24,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:14:24,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:14:24,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:14:24,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:14:24,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:14:24,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:14:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:14:24,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:14:24,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586580666] [2025-02-06 04:14:24,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586580666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:14:24,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:14:24,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:14:24,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754196566] [2025-02-06 04:14:24,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:14:24,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:14:24,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:14:24,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:14:24,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:14:24,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-02-06 04:14:24,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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-02-06 04:14:24,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:14:24,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-02-06 04:14:24,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:14:24,613 INFO L124 PetriNetUnfolderBase]: 149/306 cut-off events. [2025-02-06 04:14:24,613 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 04:14:24,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 306 events. 149/306 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1055 event pairs, 118 based on Foata normal form. 8/294 useless extension candidates. Maximal degree in co-relation 624. Up to 257 conditions per place. [2025-02-06 04:14:24,615 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 28 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-02-06 04:14:24,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 144 flow [2025-02-06 04:14:24,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:14:24,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:14:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-02-06 04:14:24,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-02-06 04:14:24,616 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 70 flow. Second operand 3 states and 55 transitions. [2025-02-06 04:14:24,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 144 flow [2025-02-06 04:14:24,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:14:24,617 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 78 flow [2025-02-06 04:14:24,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2025-02-06 04:14:24,618 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2025-02-06 04:14:24,618 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 78 flow [2025-02-06 04:14:24,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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-02-06 04:14:24,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:14:24,618 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-02-06 04:14:24,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:14:24,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:14:24,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:14:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1864503273, now seen corresponding path program 1 times [2025-02-06 04:14:24,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:14:24,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079467989] [2025-02-06 04:14:24,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:14:24,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:14:24,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:14:24,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:14:24,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:14:24,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:14:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:14:24,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:14:24,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079467989] [2025-02-06 04:14:24,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079467989] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:14:24,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194276827] [2025-02-06 04:14:24,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:14:24,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:14:24,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:14:24,741 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:14:24,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:14:24,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:14:24,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:14:24,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:14:24,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:14:24,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:14:24,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:14:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:14:24,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:14:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:14:24,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194276827] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:14:24,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:14:24,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 04:14:24,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629117691] [2025-02-06 04:14:24,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:14:24,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:14:24,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:14:24,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:14:24,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:14:24,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-02-06 04:14:24,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 78 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:14:24,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:14:24,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-02-06 04:14:24,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:14:25,059 INFO L124 PetriNetUnfolderBase]: 176/357 cut-off events. [2025-02-06 04:14:25,059 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-02-06 04:14:25,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 357 events. 176/357 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1215 event pairs, 118 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 787. Up to 257 conditions per place. [2025-02-06 04:14:25,063 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 43 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-02-06 04:14:25,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 234 flow [2025-02-06 04:14:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:14:25,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:14:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2025-02-06 04:14:25,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4125 [2025-02-06 04:14:25,066 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 78 flow. Second operand 6 states and 99 transitions. [2025-02-06 04:14:25,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 234 flow [2025-02-06 04:14:25,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 230 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:14:25,067 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 110 flow [2025-02-06 04:14:25,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2025-02-06 04:14:25,069 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2025-02-06 04:14:25,069 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 110 flow [2025-02-06 04:14:25,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:14:25,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:14:25,070 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:14:25,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:14:25,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:14:25,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:14:25,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:14:25,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1406439873, now seen corresponding path program 2 times [2025-02-06 04:14:25,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:14:25,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205552990] [2025-02-06 04:14:25,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:14:25,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:14:25,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-06 04:14:25,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-02-06 04:14:25,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:14:25,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:14:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 04:14:25,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:14:25,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205552990] [2025-02-06 04:14:25,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205552990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:14:25,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:14:25,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:14:25,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358781533] [2025-02-06 04:14:25,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:14:25,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:14:25,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:14:25,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:14:25,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:14:25,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-02-06 04:14:25,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-02-06 04:14:25,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:14:25,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-02-06 04:14:25,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:14:25,459 INFO L124 PetriNetUnfolderBase]: 130/299 cut-off events. [2025-02-06 04:14:25,459 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-02-06 04:14:25,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 299 events. 130/299 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1017 event pairs, 33 based on Foata normal form. 16/305 useless extension candidates. Maximal degree in co-relation 699. Up to 178 conditions per place. [2025-02-06 04:14:25,461 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 31 selfloop transitions, 3 changer transitions 1/40 dead transitions. [2025-02-06 04:14:25,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 197 flow [2025-02-06 04:14:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:14:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:14:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-02-06 04:14:25,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-02-06 04:14:25,463 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 110 flow. Second operand 3 states and 57 transitions. [2025-02-06 04:14:25,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 197 flow [2025-02-06 04:14:25,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 183 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:14:25,469 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 102 flow [2025-02-06 04:14:25,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2025-02-06 04:14:25,470 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2025-02-06 04:14:25,470 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 102 flow [2025-02-06 04:14:25,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-02-06 04:14:25,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:14:25,470 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:14:25,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:14:25,470 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:14:25,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:14:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1672681707, now seen corresponding path program 1 times [2025-02-06 04:14:25,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:14:25,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992821713] [2025-02-06 04:14:25,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:14:25,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:14:25,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:14:25,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:14:25,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:14:25,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:14:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:14:25,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:14:25,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992821713] [2025-02-06 04:14:25,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992821713] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:14:25,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296597949] [2025-02-06 04:14:25,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:14:25,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:14:25,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:14:25,658 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:14:25,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:14:25,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:14:25,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:14:25,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:14:25,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:14:25,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:14:25,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:14:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:14:25,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:14:25,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:14:25,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296597949] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:14:25,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:14:25,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 04:14:25,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372436143] [2025-02-06 04:14:25,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:14:25,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:14:25,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:14:25,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:14:25,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:14:25,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-02-06 04:14:25,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 102 flow. Second operand has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:14:25,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:14:25,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-02-06 04:14:25,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:14:26,068 INFO L124 PetriNetUnfolderBase]: 166/353 cut-off events. [2025-02-06 04:14:26,068 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2025-02-06 04:14:26,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 353 events. 166/353 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1099 event pairs, 90 based on Foata normal form. 36/374 useless extension candidates. Maximal degree in co-relation 899. Up to 207 conditions per place. [2025-02-06 04:14:26,072 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 63 selfloop transitions, 11 changer transitions 0/79 dead transitions. [2025-02-06 04:14:26,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 386 flow [2025-02-06 04:14:26,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:14:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:14:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 176 transitions. [2025-02-06 04:14:26,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2025-02-06 04:14:26,074 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 102 flow. Second operand 12 states and 176 transitions. [2025-02-06 04:14:26,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 386 flow [2025-02-06 04:14:26,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:14:26,077 INFO L231 Difference]: Finished difference. Result has 58 places, 39 transitions, 183 flow [2025-02-06 04:14:26,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=183, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2025-02-06 04:14:26,077 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2025-02-06 04:14:26,077 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 39 transitions, 183 flow [2025-02-06 04:14:26,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:14:26,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:14:26,078 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:14:26,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:14:26,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:14:26,282 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:14:26,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:14:26,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2090518323, now seen corresponding path program 2 times [2025-02-06 04:14:26,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:14:26,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392568760] [2025-02-06 04:14:26,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:14:26,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:14:26,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:14:26,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:14:26,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:14:26,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:14:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:14:26,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:14:26,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392568760] [2025-02-06 04:14:26,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392568760] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:14:26,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293031437] [2025-02-06 04:14:26,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:14:26,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:14:26,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:14:26,616 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:14:26,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:14:26,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:14:26,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:14:26,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:14:26,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:14:26,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 04:14:26,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:14:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:14:26,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:14:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:14:27,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293031437] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:14:27,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:14:27,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-02-06 04:14:27,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663031318] [2025-02-06 04:14:27,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:14:27,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 04:14:27,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:14:27,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 04:14:27,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-02-06 04:14:27,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-02-06 04:14:27,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 39 transitions, 183 flow. Second operand has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 23 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:14:27,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:14:27,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-02-06 04:14:27,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:14:27,282 INFO L124 PetriNetUnfolderBase]: 226/473 cut-off events. [2025-02-06 04:14:27,282 INFO L125 PetriNetUnfolderBase]: For 2476/2476 co-relation queries the response was YES. [2025-02-06 04:14:27,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 473 events. 226/473 cut-off events. For 2476/2476 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1430 event pairs, 90 based on Foata normal form. 60/518 useless extension candidates. Maximal degree in co-relation 1463. Up to 207 conditions per place. [2025-02-06 04:14:27,285 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 103 selfloop transitions, 21 changer transitions 0/129 dead transitions. [2025-02-06 04:14:27,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 129 transitions, 711 flow [2025-02-06 04:14:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 04:14:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 04:14:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 310 transitions. [2025-02-06 04:14:27,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2025-02-06 04:14:27,287 INFO L175 Difference]: Start difference. First operand has 58 places, 39 transitions, 183 flow. Second operand 22 states and 310 transitions. [2025-02-06 04:14:27,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 129 transitions, 711 flow [2025-02-06 04:14:27,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 129 transitions, 643 flow, removed 29 selfloop flow, removed 5 redundant places. [2025-02-06 04:14:27,291 INFO L231 Difference]: Finished difference. Result has 84 places, 49 transitions, 279 flow [2025-02-06 04:14:27,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=279, PETRI_PLACES=84, PETRI_TRANSITIONS=49} [2025-02-06 04:14:27,292 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 48 predicate places. [2025-02-06 04:14:27,292 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 49 transitions, 279 flow [2025-02-06 04:14:27,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 23 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:14:27,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:14:27,292 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:14:27,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:14:27,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:14:27,493 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:14:27,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:14:27,494 INFO L85 PathProgramCache]: Analyzing trace with hash -445448243, now seen corresponding path program 3 times [2025-02-06 04:14:27,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:14:27,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240490926] [2025-02-06 04:14:27,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:14:27,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:14:27,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 11 equivalence classes. [2025-02-06 04:14:28,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 04:14:28,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 04:14:28,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:14:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:14:41,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:14:41,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240490926] [2025-02-06 04:14:41,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240490926] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:14:41,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416855494] [2025-02-06 04:14:41,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:14:41,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:14:41,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:14:41,159 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:14:41,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:14:41,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 11 equivalence classes. [2025-02-06 04:15:38,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 04:15:38,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 04:15:38,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:38,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 234 conjuncts are in the unsatisfiable core [2025-02-06 04:15:38,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:15:38,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2025-02-06 04:15:38,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:38,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 04:15:38,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2025-02-06 04:15:38,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:38,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 66 [2025-02-06 04:15:38,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2025-02-06 04:15:38,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:38,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 73 [2025-02-06 04:15:38,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2025-02-06 04:15:39,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:39,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 84 [2025-02-06 04:15:39,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2025-02-06 04:15:39,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:39,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 98 [2025-02-06 04:15:39,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 87 [2025-02-06 04:15:39,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:39,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 98 treesize of output 112 [2025-02-06 04:15:39,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 101 [2025-02-06 04:15:39,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:39,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 103 treesize of output 119 [2025-02-06 04:15:39,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 115 [2025-02-06 04:15:39,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:39,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 107 treesize of output 123 [2025-02-06 04:15:39,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 129 [2025-02-06 04:15:39,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:39,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 131 treesize of output 154 [2025-02-06 04:15:39,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 123 [2025-02-06 04:15:39,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:39,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 142 treesize of output 168 [2025-02-06 04:15:39,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 137 [2025-02-06 04:15:39,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:39,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 91 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 153 treesize of output 182 [2025-02-06 04:15:39,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 151 [2025-02-06 04:15:40,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:40,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 144 treesize of output 176 [2025-02-06 04:15:40,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 105 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 185 [2025-02-06 04:15:40,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:40,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 120 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 175 treesize of output 210 [2025-02-06 04:15:40,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 172 [2025-02-06 04:15:40,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:40,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 136 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 186 treesize of output 224 [2025-02-06 04:15:40,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 91 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 183 [2025-02-06 04:15:40,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:40,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 105 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 170 treesize of output 208 [2025-02-06 04:15:40,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 153 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 227 [2025-02-06 04:15:40,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:40,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 120 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 181 treesize of output 222 [2025-02-06 04:15:40,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 171 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 241 [2025-02-06 04:15:41,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:41,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 136 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 192 treesize of output 236 [2025-02-06 04:15:41,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 190 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 255 [2025-02-06 04:15:41,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:41,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 210 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 230 treesize of output 280 [2025-02-06 04:15:41,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 153 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 239 [2025-02-06 04:15:41,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:41,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 21 select indices, 21 select index equivalence classes, 231 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 210 case distinctions, treesize of input 241 treesize of output 294 [2025-02-06 04:15:41,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 171 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 253 [2025-02-06 04:15:41,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:41,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 190 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 225 treesize of output 278 [2025-02-06 04:15:41,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 22 select indices, 22 select index equivalence classes, 253 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 297 [2025-02-06 04:15:42,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:42,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 23 select indices, 23 select index equivalence classes, 253 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 253 case distinctions, treesize of input 249 treesize of output 153 [2025-02-06 04:15:42,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 04:15:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:42,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:15:42,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:42,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 59 [2025-02-06 04:15:43,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:43,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 10004 treesize of output 5843 [2025-02-06 04:15:44,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:15:44,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 25 case distinctions, treesize of input 653080 treesize of output 395779