./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c4f9d381010c40c0aeec814019363f065d1b11569cf33ee927950bcd4ef29f20 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:54:25,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:54:25,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:54:25,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:54:25,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:54:25,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:54:25,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:54:25,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:54:25,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:54:25,411 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:54:25,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:54:25,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:54:25,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:54:25,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:54:25,415 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:54:25,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:54:25,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:54:25,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:54:25,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:54:25,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:54:25,419 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:54:25,419 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:54:25,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:54:25,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:54:25,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:54:25,420 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c4f9d381010c40c0aeec814019363f065d1b11569cf33ee927950bcd4ef29f20 [2025-02-06 12:54:25,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:54:25,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:54:25,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:54:25,658 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:54:25,658 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:54:25,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i [2025-02-06 12:54:26,976 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32df5f869/cd393f4e28fa49a1a336b5433842f351/FLAGb498144a9 [2025-02-06 12:54:27,311 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:54:27,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i [2025-02-06 12:54:27,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32df5f869/cd393f4e28fa49a1a336b5433842f351/FLAGb498144a9 [2025-02-06 12:54:27,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32df5f869/cd393f4e28fa49a1a336b5433842f351 [2025-02-06 12:54:27,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:54:27,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:54:27,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:54:27,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:54:27,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:54:27,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:54:27" (1/1) ... [2025-02-06 12:54:27,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235e7df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:27, skipping insertion in model container [2025-02-06 12:54:27,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:54:27" (1/1) ... [2025-02-06 12:54:27,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:54:27,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:54:27,963 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:54:28,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:54:28,081 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:54:28,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:28 WrapperNode [2025-02-06 12:54:28,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:54:28,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:54:28,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:54:28,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:54:28,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:28" (1/1) ... [2025-02-06 12:54:28,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:28" (1/1) ... [2025-02-06 12:54:28,135 INFO L138 Inliner]: procedures = 372, calls = 88, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 182 [2025-02-06 12:54:28,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:54:28,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:54:28,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:54:28,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:54:28,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:28" (1/1) ... [2025-02-06 12:54:28,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:28" (1/1) ... [2025-02-06 12:54:28,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:28" (1/1) ... [2025-02-06 12:54:28,163 INFO L175 MemorySlicer]: Split 78 memory accesses to 3 slices as follows [50, 14, 14]. 64 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-02-06 12:54:28,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:28" (1/1) ... [2025-02-06 12:54:28,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:28" (1/1) ... [2025-02-06 12:54:28,170 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:28" (1/1) ... [2025-02-06 12:54:28,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:28" (1/1) ... [2025-02-06 12:54:28,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:28" (1/1) ... [2025-02-06 12:54:28,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:28" (1/1) ... [2025-02-06 12:54:28,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:54:28,175 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:54:28,176 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:54:28,176 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:54:28,176 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:28" (1/1) ... [2025-02-06 12:54:28,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:54:28,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:28,199 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 12:54:28,203 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 12:54:28,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:54:28,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:54:28,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:54:28,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 12:54:28,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 12:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 12:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:54:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:54:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 12:54:28,216 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 12:54:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:54:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:54:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:54:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:54:28,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:54:28,217 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 12:54:28,320 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:54:28,322 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:54:28,710 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:54:28,710 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:54:28,991 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:54:28,991 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:54:28,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:54:28 BoogieIcfgContainer [2025-02-06 12:54:28,992 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:54:28,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:54:28,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:54:28,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:54:28,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:54:27" (1/3) ... [2025-02-06 12:54:28,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9d6bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:54:28, skipping insertion in model container [2025-02-06 12:54:28,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:28" (2/3) ... [2025-02-06 12:54:28,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9d6bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:54:28, skipping insertion in model container [2025-02-06 12:54:28,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:54:28" (3/3) ... [2025-02-06 12:54:28,998 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr.i [2025-02-06 12:54:29,008 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:54:29,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_11-arraylist_nr.i that has 2 procedures, 72 locations, 1 initial locations, 2 loop locations, and 37 error locations. [2025-02-06 12:54:29,009 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:54:29,057 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:54:29,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 73 transitions, 150 flow [2025-02-06 12:54:29,111 INFO L124 PetriNetUnfolderBase]: 2/72 cut-off events. [2025-02-06 12:54:29,113 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:54:29,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 277 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-02-06 12:54:29,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 73 transitions, 150 flow [2025-02-06 12:54:29,117 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 72 transitions, 147 flow [2025-02-06 12:54:29,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:54:29,134 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=None, 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;@411d921, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:54:29,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-02-06 12:54:29,138 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:54:29,139 INFO L124 PetriNetUnfolderBase]: 1/7 cut-off events. [2025-02-06 12:54:29,139 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:54:29,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:29,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:54:29,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:29,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:29,143 INFO L85 PathProgramCache]: Analyzing trace with hash 16143636, now seen corresponding path program 1 times [2025-02-06 12:54:29,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:29,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279596153] [2025-02-06 12:54:29,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:29,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:29,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:54:29,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:54:29,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:29,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:29,371 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 12:54:29,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:29,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279596153] [2025-02-06 12:54:29,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279596153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:29,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:29,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:54:29,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582331430] [2025-02-06 12:54:29,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:29,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:29,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:29,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:29,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:29,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-02-06 12:54:29,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 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 12:54:29,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:29,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-02-06 12:54:29,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:29,555 INFO L124 PetriNetUnfolderBase]: 65/269 cut-off events. [2025-02-06 12:54:29,557 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:54:29,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 269 events. 65/269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1398 event pairs, 63 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 377. Up to 155 conditions per place. [2025-02-06 12:54:29,561 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 27 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-02-06 12:54:29,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 73 transitions, 207 flow [2025-02-06 12:54:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-02-06 12:54:29,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7534246575342466 [2025-02-06 12:54:29,572 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 147 flow. Second operand 3 states and 165 transitions. [2025-02-06 12:54:29,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 73 transitions, 207 flow [2025-02-06 12:54:29,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 73 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:29,579 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 158 flow [2025-02-06 12:54:29,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2025-02-06 12:54:29,583 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 2 predicate places. [2025-02-06 12:54:29,584 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 158 flow [2025-02-06 12:54:29,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 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 12:54:29,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:29,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:54:29,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:54:29,585 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:29,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:29,586 INFO L85 PathProgramCache]: Analyzing trace with hash 500366550, now seen corresponding path program 1 times [2025-02-06 12:54:29,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:29,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533729102] [2025-02-06 12:54:29,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:29,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:29,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:54:29,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:54:29,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:29,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:29,673 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 12:54:29,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:29,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533729102] [2025-02-06 12:54:29,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533729102] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:54:29,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238320005] [2025-02-06 12:54:29,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:29,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:29,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:29,675 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 12:54:29,677 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 12:54:29,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:54:29,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:54:29,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:29,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:29,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:54:29,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:29,853 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 12:54:29,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:54:29,867 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 12:54:29,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238320005] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:54:29,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:54:29,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 12:54:29,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536908424] [2025-02-06 12:54:29,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:54:29,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:54:29,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:29,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:54:29,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:54:29,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-02-06 12:54:29,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 0 states have call successors, (0), 0 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 12:54:29,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:29,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-02-06 12:54:29,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:29,977 INFO L124 PetriNetUnfolderBase]: 65/272 cut-off events. [2025-02-06 12:54:29,978 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:54:29,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 272 events. 65/272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1400 event pairs, 63 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 433. Up to 155 conditions per place. [2025-02-06 12:54:29,980 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 27 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-02-06 12:54:29,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 76 transitions, 234 flow [2025-02-06 12:54:29,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:54:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:54:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 305 transitions. [2025-02-06 12:54:29,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6963470319634704 [2025-02-06 12:54:29,984 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 158 flow. Second operand 6 states and 305 transitions. [2025-02-06 12:54:29,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 76 transitions, 234 flow [2025-02-06 12:54:29,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 230 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:29,986 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 190 flow [2025-02-06 12:54:29,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2025-02-06 12:54:29,987 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 9 predicate places. [2025-02-06 12:54:29,987 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 190 flow [2025-02-06 12:54:29,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 0 states have call successors, (0), 0 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 12:54:29,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:29,988 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-02-06 12:54:29,997 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 12:54:30,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:30,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:30,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:30,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1497156204, now seen corresponding path program 2 times [2025-02-06 12:54:30,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:30,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631997958] [2025-02-06 12:54:30,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:54:30,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:30,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-06 12:54:30,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-02-06 12:54:30,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:54:30,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:30,310 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 12:54:30,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:30,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631997958] [2025-02-06 12:54:30,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631997958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:30,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:30,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:54:30,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804128560] [2025-02-06 12:54:30,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:30,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:30,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:30,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:30,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:30,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 73 [2025-02-06 12:54:30,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:30,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:30,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 73 [2025-02-06 12:54:30,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:30,462 INFO L124 PetriNetUnfolderBase]: 65/268 cut-off events. [2025-02-06 12:54:30,462 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:54:30,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 268 events. 65/268 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1365 event pairs, 63 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 422. Up to 157 conditions per place. [2025-02-06 12:54:30,464 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 30 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2025-02-06 12:54:30,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 72 transitions, 250 flow [2025-02-06 12:54:30,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:30,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-02-06 12:54:30,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6894977168949772 [2025-02-06 12:54:30,465 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 190 flow. Second operand 3 states and 151 transitions. [2025-02-06 12:54:30,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 72 transitions, 250 flow [2025-02-06 12:54:30,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 72 transitions, 236 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:30,467 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 176 flow [2025-02-06 12:54:30,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2025-02-06 12:54:30,468 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 6 predicate places. [2025-02-06 12:54:30,468 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 176 flow [2025-02-06 12:54:30,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:30,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:30,469 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-02-06 12:54:30,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:54:30,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:30,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:30,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1497156203, now seen corresponding path program 1 times [2025-02-06 12:54:30,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:30,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529652659] [2025-02-06 12:54:30,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:30,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:30,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:54:30,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:54:30,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:30,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:30,603 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 12:54:30,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:30,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529652659] [2025-02-06 12:54:30,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529652659] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:54:30,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170453867] [2025-02-06 12:54:30,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:30,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:30,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:30,606 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 12:54:30,608 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 12:54:30,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:54:30,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:54:30,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:30,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:30,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:54:30,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:30,712 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 12:54:30,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:54:30,765 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 12:54:30,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170453867] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:54:30,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:54:30,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 12:54:30,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454074793] [2025-02-06 12:54:30,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:54:30,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:54:30,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:30,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:54:30,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:54:30,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-02-06 12:54:30,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 176 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 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 12:54:30,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:30,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-02-06 12:54:30,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:30,876 INFO L124 PetriNetUnfolderBase]: 65/274 cut-off events. [2025-02-06 12:54:30,876 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-06 12:54:30,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 274 events. 65/274 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1356 event pairs, 63 based on Foata normal form. 6/223 useless extension candidates. Maximal degree in co-relation 432. Up to 155 conditions per place. [2025-02-06 12:54:30,878 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 27 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2025-02-06 12:54:30,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 78 transitions, 288 flow [2025-02-06 12:54:30,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:54:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 12:54:30,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 584 transitions. [2025-02-06 12:54:30,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-06 12:54:30,880 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 176 flow. Second operand 12 states and 584 transitions. [2025-02-06 12:54:30,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 78 transitions, 288 flow [2025-02-06 12:54:30,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 78 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:54:30,882 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 252 flow [2025-02-06 12:54:30,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=252, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2025-02-06 12:54:30,884 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 21 predicate places. [2025-02-06 12:54:30,884 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 252 flow [2025-02-06 12:54:30,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 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 12:54:30,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:30,885 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-02-06 12:54:30,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:54:31,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:31,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:31,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:31,086 INFO L85 PathProgramCache]: Analyzing trace with hash 107253333, now seen corresponding path program 2 times [2025-02-06 12:54:31,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:31,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071868092] [2025-02-06 12:54:31,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:54:31,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:31,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 12:54:31,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-02-06 12:54:31,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:54:31,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:54:31,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:31,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071868092] [2025-02-06 12:54:31,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071868092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:31,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:31,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:54:31,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973516806] [2025-02-06 12:54:31,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:31,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:31,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:31,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:31,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:31,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 73 [2025-02-06 12:54:31,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:31,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:31,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 73 [2025-02-06 12:54:31,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:31,301 INFO L124 PetriNetUnfolderBase]: 65/270 cut-off events. [2025-02-06 12:54:31,302 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-02-06 12:54:31,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 270 events. 65/270 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1329 event pairs, 63 based on Foata normal form. 2/216 useless extension candidates. Maximal degree in co-relation 422. Up to 163 conditions per place. [2025-02-06 12:54:31,306 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 34 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-02-06 12:54:31,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 74 transitions, 320 flow [2025-02-06 12:54:31,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-02-06 12:54:31,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7077625570776256 [2025-02-06 12:54:31,307 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 252 flow. Second operand 3 states and 155 transitions. [2025-02-06 12:54:31,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 74 transitions, 320 flow [2025-02-06 12:54:31,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 74 transitions, 272 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-02-06 12:54:31,312 INFO L231 Difference]: Finished difference. Result has 88 places, 74 transitions, 204 flow [2025-02-06 12:54:31,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=88, PETRI_TRANSITIONS=74} [2025-02-06 12:54:31,314 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 14 predicate places. [2025-02-06 12:54:31,314 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 74 transitions, 204 flow [2025-02-06 12:54:31,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:31,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:31,315 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:31,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:54:31,315 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:31,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash -8748253, now seen corresponding path program 1 times [2025-02-06 12:54:31,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:31,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258787432] [2025-02-06 12:54:31,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:31,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:31,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:54:31,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:54:31,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:31,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:54:31,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:31,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258787432] [2025-02-06 12:54:31,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258787432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:31,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:31,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:54:31,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021744325] [2025-02-06 12:54:31,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:31,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:54:31,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:31,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:54:31,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:54:31,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 73 [2025-02-06 12:54:31,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 74 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 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 12:54:31,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:31,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 73 [2025-02-06 12:54:31,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:31,777 INFO L124 PetriNetUnfolderBase]: 74/288 cut-off events. [2025-02-06 12:54:31,780 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-02-06 12:54:31,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 288 events. 74/288 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1411 event pairs, 72 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 471. Up to 185 conditions per place. [2025-02-06 12:54:31,781 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 40 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2025-02-06 12:54:31,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 70 transitions, 278 flow [2025-02-06 12:54:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:31,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-02-06 12:54:31,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680365296803653 [2025-02-06 12:54:31,783 INFO L175 Difference]: Start difference. First operand has 88 places, 74 transitions, 204 flow. Second operand 3 states and 149 transitions. [2025-02-06 12:54:31,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 70 transitions, 278 flow [2025-02-06 12:54:31,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:54:31,785 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 190 flow [2025-02-06 12:54:31,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2025-02-06 12:54:31,786 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 10 predicate places. [2025-02-06 12:54:31,786 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 190 flow [2025-02-06 12:54:31,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 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 12:54:31,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:31,786 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:31,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:54:31,786 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:31,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:31,786 INFO L85 PathProgramCache]: Analyzing trace with hash -8748252, now seen corresponding path program 1 times [2025-02-06 12:54:31,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:31,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871369338] [2025-02-06 12:54:31,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:31,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:31,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:54:31,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:54:31,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:31,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:54:31,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:31,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871369338] [2025-02-06 12:54:31,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871369338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:31,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:31,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:54:31,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879899934] [2025-02-06 12:54:31,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:31,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:54:31,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:31,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:54:31,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:54:32,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 73 [2025-02-06 12:54:32,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 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 12:54:32,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:32,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 73 [2025-02-06 12:54:32,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:32,328 INFO L124 PetriNetUnfolderBase]: 65/277 cut-off events. [2025-02-06 12:54:32,330 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-02-06 12:54:32,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 277 events. 65/277 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1264 event pairs, 63 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 472. Up to 166 conditions per place. [2025-02-06 12:54:32,332 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 40 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2025-02-06 12:54:32,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 298 flow [2025-02-06 12:54:32,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:54:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:54:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2025-02-06 12:54:32,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.589041095890411 [2025-02-06 12:54:32,335 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 190 flow. Second operand 5 states and 215 transitions. [2025-02-06 12:54:32,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 298 flow [2025-02-06 12:54:32,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 77 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:32,339 INFO L231 Difference]: Finished difference. Result has 89 places, 75 transitions, 239 flow [2025-02-06 12:54:32,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=89, PETRI_TRANSITIONS=75} [2025-02-06 12:54:32,340 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 15 predicate places. [2025-02-06 12:54:32,340 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 239 flow [2025-02-06 12:54:32,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 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 12:54:32,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:32,341 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:32,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:54:32,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:32,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:32,344 INFO L85 PathProgramCache]: Analyzing trace with hash -344325093, now seen corresponding path program 1 times [2025-02-06 12:54:32,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:32,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610469133] [2025-02-06 12:54:32,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:32,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:32,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:54:32,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:54:32,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:32,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:32,635 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:54:32,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:32,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610469133] [2025-02-06 12:54:32,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610469133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:32,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:32,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:54:32,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601993484] [2025-02-06 12:54:32,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:32,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:54:32,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:32,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:54:32,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:54:33,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 73 [2025-02-06 12:54:33,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 75 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 0 states have call successors, (0), 0 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 12:54:33,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:33,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 73 [2025-02-06 12:54:33,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:33,205 INFO L124 PetriNetUnfolderBase]: 65/273 cut-off events. [2025-02-06 12:54:33,206 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-02-06 12:54:33,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 273 events. 65/273 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1236 event pairs, 63 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 491. Up to 160 conditions per place. [2025-02-06 12:54:33,207 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 35 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2025-02-06 12:54:33,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 73 transitions, 327 flow [2025-02-06 12:54:33,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:54:33,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:54:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 285 transitions. [2025-02-06 12:54:33,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5577299412915852 [2025-02-06 12:54:33,209 INFO L175 Difference]: Start difference. First operand has 89 places, 75 transitions, 239 flow. Second operand 7 states and 285 transitions. [2025-02-06 12:54:33,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 73 transitions, 327 flow [2025-02-06 12:54:33,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 73 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:54:33,212 INFO L231 Difference]: Finished difference. Result has 91 places, 73 transitions, 253 flow [2025-02-06 12:54:33,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=253, PETRI_PLACES=91, PETRI_TRANSITIONS=73} [2025-02-06 12:54:33,214 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 17 predicate places. [2025-02-06 12:54:33,214 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 73 transitions, 253 flow [2025-02-06 12:54:33,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 0 states have call successors, (0), 0 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 12:54:33,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:33,214 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:33,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:54:33,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:33,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:33,214 INFO L85 PathProgramCache]: Analyzing trace with hash -344325092, now seen corresponding path program 1 times [2025-02-06 12:54:33,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:33,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815392789] [2025-02-06 12:54:33,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:33,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:33,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:54:33,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:54:33,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:33,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:54:33,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:33,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815392789] [2025-02-06 12:54:33,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815392789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:33,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:33,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:54:33,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792988007] [2025-02-06 12:54:33,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:33,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:54:33,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:33,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:54:33,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:54:33,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 73 [2025-02-06 12:54:33,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 73 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 0 states have call successors, (0), 0 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 12:54:33,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:33,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 73 [2025-02-06 12:54:33,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:34,174 INFO L124 PetriNetUnfolderBase]: 65/269 cut-off events. [2025-02-06 12:54:34,175 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-02-06 12:54:34,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 269 events. 65/269 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1211 event pairs, 63 based on Foata normal form. 2/227 useless extension candidates. Maximal degree in co-relation 492. Up to 160 conditions per place. [2025-02-06 12:54:34,177 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 32 selfloop transitions, 11 changer transitions 0/71 dead transitions. [2025-02-06 12:54:34,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 71 transitions, 335 flow [2025-02-06 12:54:34,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:54:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:54:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 303 transitions. [2025-02-06 12:54:34,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5929549902152642 [2025-02-06 12:54:34,179 INFO L175 Difference]: Start difference. First operand has 91 places, 73 transitions, 253 flow. Second operand 7 states and 303 transitions. [2025-02-06 12:54:34,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 71 transitions, 335 flow [2025-02-06 12:54:34,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 71 transitions, 313 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 12:54:34,182 INFO L231 Difference]: Finished difference. Result has 89 places, 71 transitions, 249 flow [2025-02-06 12:54:34,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=89, PETRI_TRANSITIONS=71} [2025-02-06 12:54:34,183 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 15 predicate places. [2025-02-06 12:54:34,183 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 71 transitions, 249 flow [2025-02-06 12:54:34,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 0 states have call successors, (0), 0 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 12:54:34,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:34,183 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:34,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:54:34,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:34,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash -183914674, now seen corresponding path program 1 times [2025-02-06 12:54:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:34,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619952727] [2025-02-06 12:54:34,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:34,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:34,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:54:34,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:54:34,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:34,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:34,392 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:54:34,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:34,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619952727] [2025-02-06 12:54:34,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619952727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:34,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:34,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:54:34,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771843870] [2025-02-06 12:54:34,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:34,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:54:34,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:34,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:54:34,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:54:34,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 73 [2025-02-06 12:54:34,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 71 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 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 12:54:34,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:34,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 73 [2025-02-06 12:54:34,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:34,800 INFO L124 PetriNetUnfolderBase]: 65/267 cut-off events. [2025-02-06 12:54:34,800 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-02-06 12:54:34,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 267 events. 65/267 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1196 event pairs, 63 based on Foata normal form. 2/227 useless extension candidates. Maximal degree in co-relation 490. Up to 162 conditions per place. [2025-02-06 12:54:34,802 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 32 selfloop transitions, 11 changer transitions 0/70 dead transitions. [2025-02-06 12:54:34,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 70 transitions, 333 flow [2025-02-06 12:54:34,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:54:34,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:54:34,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2025-02-06 12:54:34,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6273972602739726 [2025-02-06 12:54:34,803 INFO L175 Difference]: Start difference. First operand has 89 places, 71 transitions, 249 flow. Second operand 5 states and 229 transitions. [2025-02-06 12:54:34,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 70 transitions, 333 flow [2025-02-06 12:54:34,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 70 transitions, 311 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 12:54:34,805 INFO L231 Difference]: Finished difference. Result has 86 places, 70 transitions, 247 flow [2025-02-06 12:54:34,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=86, PETRI_TRANSITIONS=70} [2025-02-06 12:54:34,805 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 12 predicate places. [2025-02-06 12:54:34,805 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 70 transitions, 247 flow [2025-02-06 12:54:34,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 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 12:54:34,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:34,806 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:34,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:54:34,806 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:34,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash -183914675, now seen corresponding path program 1 times [2025-02-06 12:54:34,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:34,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322940970] [2025-02-06 12:54:34,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:34,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:34,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:54:34,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:54:34,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:34,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:54:34,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:34,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322940970] [2025-02-06 12:54:34,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322940970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:34,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:34,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:54:34,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544581055] [2025-02-06 12:54:34,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:34,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:54:34,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:34,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:54:34,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:54:35,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 73 [2025-02-06 12:54:35,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 70 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 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 12:54:35,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:35,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 73 [2025-02-06 12:54:35,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:35,096 INFO L124 PetriNetUnfolderBase]: 65/265 cut-off events. [2025-02-06 12:54:35,097 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-02-06 12:54:35,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 265 events. 65/265 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1185 event pairs, 63 based on Foata normal form. 2/225 useless extension candidates. Maximal degree in co-relation 492. Up to 162 conditions per place. [2025-02-06 12:54:35,098 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 34 selfloop transitions, 11 changer transitions 0/69 dead transitions. [2025-02-06 12:54:35,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 69 transitions, 335 flow [2025-02-06 12:54:35,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:54:35,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:54:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2025-02-06 12:54:35,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054794520547945 [2025-02-06 12:54:35,103 INFO L175 Difference]: Start difference. First operand has 86 places, 70 transitions, 247 flow. Second operand 5 states and 221 transitions. [2025-02-06 12:54:35,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 69 transitions, 335 flow [2025-02-06 12:54:35,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 69 transitions, 313 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:54:35,104 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 245 flow [2025-02-06 12:54:35,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2025-02-06 12:54:35,105 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 11 predicate places. [2025-02-06 12:54:35,105 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 245 flow [2025-02-06 12:54:35,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 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 12:54:35,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:35,105 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:35,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:54:35,105 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:35,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:35,106 INFO L85 PathProgramCache]: Analyzing trace with hash -270516443, now seen corresponding path program 1 times [2025-02-06 12:54:35,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:35,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448025219] [2025-02-06 12:54:35,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:35,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:35,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:54:35,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:54:35,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:35,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:54:35,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:35,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448025219] [2025-02-06 12:54:35,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448025219] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:54:35,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635184548] [2025-02-06 12:54:35,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:35,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:35,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:35,438 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 12:54:35,440 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 12:54:35,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:54:35,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:54:35,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:35,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:35,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-06 12:54:35,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:35,661 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:54:35,662 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:54:35,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:54:35,755 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:54:35,755 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:54:35,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:54:35,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 12:54:35,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:54:35,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:54:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:54:35,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:54:36,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:54:36,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-02-06 12:54:36,240 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 12:54:36,240 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-06 12:54:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:54:36,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635184548] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:54:36,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:54:36,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 5] total 19 [2025-02-06 12:54:36,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464227360] [2025-02-06 12:54:36,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:54:36,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 12:54:36,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:36,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 12:54:36,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-02-06 12:54:38,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 73 [2025-02-06 12:54:38,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 245 flow. Second operand has 21 states, 21 states have (on average 35.857142857142854) internal successors, (753), 21 states have internal predecessors, (753), 0 states have call successors, (0), 0 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 12:54:38,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:38,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 73 [2025-02-06 12:54:38,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:38,634 INFO L124 PetriNetUnfolderBase]: 74/315 cut-off events. [2025-02-06 12:54:38,635 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-02-06 12:54:38,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 315 events. 74/315 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1298 event pairs, 72 based on Foata normal form. 9/279 useless extension candidates. Maximal degree in co-relation 602. Up to 179 conditions per place. [2025-02-06 12:54:38,636 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 53 selfloop transitions, 11 changer transitions 0/87 dead transitions. [2025-02-06 12:54:38,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 465 flow [2025-02-06 12:54:38,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:54:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 12:54:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 437 transitions. [2025-02-06 12:54:38,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5442092154420921 [2025-02-06 12:54:38,637 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 245 flow. Second operand 11 states and 437 transitions. [2025-02-06 12:54:38,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 87 transitions, 465 flow [2025-02-06 12:54:38,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 87 transitions, 411 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:54:38,639 INFO L231 Difference]: Finished difference. Result has 94 places, 71 transitions, 278 flow [2025-02-06 12:54:38,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=278, PETRI_PLACES=94, PETRI_TRANSITIONS=71} [2025-02-06 12:54:38,641 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 20 predicate places. [2025-02-06 12:54:38,642 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 71 transitions, 278 flow [2025-02-06 12:54:38,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 35.857142857142854) internal successors, (753), 21 states have internal predecessors, (753), 0 states have call successors, (0), 0 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 12:54:38,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:38,642 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2025-02-06 12:54:38,649 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 12:54:38,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:38,846 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:38,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:38,847 INFO L85 PathProgramCache]: Analyzing trace with hash 345367464, now seen corresponding path program 2 times [2025-02-06 12:54:38,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:38,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711085038] [2025-02-06 12:54:38,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:54:38,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:38,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-06 12:54:39,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 12:54:39,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:54:39,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:40,765 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:54:40,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:40,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711085038] [2025-02-06 12:54:40,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711085038] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:54:40,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061083342] [2025-02-06 12:54:40,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:54:40,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:40,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:40,767 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 12:54:40,773 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 12:54:40,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-06 12:54:41,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 12:54:41,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:54:41,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:41,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-02-06 12:54:41,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:41,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:54:41,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:54:41,205 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:54:41,205 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:54:41,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:54:41,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:54:41,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:54:41,416 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:54:41,416 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:54:41,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:54:41,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:54:41,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:54:41,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:54:41,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:54:41,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:54:41,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:54:41,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:54:41,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:54:41,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:54:41,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:54:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:54:41,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:54:42,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:54:42,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-02-06 12:54:42,108 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 12:54:42,108 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-06 12:54:42,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:54:42,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-02-06 12:54:42,355 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 12:54:42,355 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-06 12:54:42,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:54:42,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-02-06 12:54:42,607 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 12:54:42,607 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-06 12:54:42,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:54:42,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-02-06 12:54:42,885 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 12:54:42,885 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-06 12:54:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:54:43,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061083342] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:54:43,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:54:43,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 11] total 46 [2025-02-06 12:54:43,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588169950] [2025-02-06 12:54:43,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:54:43,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-06 12:54:43,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:43,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 12:54:43,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1920, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 12:54:50,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 73 [2025-02-06 12:54:50,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 71 transitions, 278 flow. Second operand has 48 states, 48 states have (on average 35.145833333333336) internal successors, (1687), 48 states have internal predecessors, (1687), 0 states have call successors, (0), 0 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 12:54:50,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:50,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 73 [2025-02-06 12:54:50,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:51,427 INFO L124 PetriNetUnfolderBase]: 74/375 cut-off events. [2025-02-06 12:54:51,428 INFO L125 PetriNetUnfolderBase]: For 231/231 co-relation queries the response was YES. [2025-02-06 12:54:51,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 375 events. 74/375 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1298 event pairs, 72 based on Foata normal form. 12/342 useless extension candidates. Maximal degree in co-relation 755. Up to 179 conditions per place. [2025-02-06 12:54:51,429 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 76 selfloop transitions, 30 changer transitions 0/129 dead transitions. [2025-02-06 12:54:51,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 129 transitions, 738 flow [2025-02-06 12:54:51,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 12:54:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 12:54:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 768 transitions. [2025-02-06 12:54:51,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5260273972602739 [2025-02-06 12:54:51,432 INFO L175 Difference]: Start difference. First operand has 94 places, 71 transitions, 278 flow. Second operand 20 states and 768 transitions. [2025-02-06 12:54:51,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 129 transitions, 738 flow [2025-02-06 12:54:51,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 129 transitions, 727 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:54:51,435 INFO L231 Difference]: Finished difference. Result has 123 places, 91 transitions, 536 flow [2025-02-06 12:54:51,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=536, PETRI_PLACES=123, PETRI_TRANSITIONS=91} [2025-02-06 12:54:51,436 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 49 predicate places. [2025-02-06 12:54:51,436 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 91 transitions, 536 flow [2025-02-06 12:54:51,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 35.145833333333336) internal successors, (1687), 48 states have internal predecessors, (1687), 0 states have call successors, (0), 0 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 12:54:51,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:51,438 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1] [2025-02-06 12:54:51,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:54:51,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 12:54:51,638 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:51,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:51,640 INFO L85 PathProgramCache]: Analyzing trace with hash 103532270, now seen corresponding path program 3 times [2025-02-06 12:54:51,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:51,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307553216] [2025-02-06 12:54:51,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:54:51,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:51,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 11 equivalence classes. [2025-02-06 12:54:52,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 12:54:52,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 12:54:52,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 399 proven. 91 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 12:54:52,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:52,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307553216] [2025-02-06 12:54:52,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307553216] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:54:52,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50409890] [2025-02-06 12:54:52,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:54:52,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:52,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:52,780 INFO L229 MonitoredProcess]: Starting monitored process 6 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 12:54:52,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:54:52,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 11 equivalence classes.