./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c --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/weaver/popl20-more-min-array-hom.wvr.c -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 0224e82797c7b26c7800eaf85be5e5678e7961d21aa4e2312eda2860d261b33a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:09:04,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:09:04,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 13:09:04,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:09:04,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:09:04,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:09:04,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:09:04,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:09:04,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:09:04,291 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:09:04,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:09:04,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:09:04,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:09:04,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:09:04,291 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:09:04,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:09:04,292 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:09:04,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:09:04,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:09:04,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:09:04,292 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:09:04,292 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:09:04,292 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:09:04,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:09:04,292 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:09:04,292 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:09:04,292 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:09:04,293 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:09:04,293 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:09:04,293 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:09:04,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:09:04,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:09:04,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:09:04,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:09:04,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:09:04,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:09:04,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:09:04,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:09:04,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:09:04,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:09:04,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:09:04,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:09:04,294 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 -> 0224e82797c7b26c7800eaf85be5e5678e7961d21aa4e2312eda2860d261b33a [2025-02-06 13:09:04,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:09:04,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:09:04,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:09:04,480 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:09:04,481 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:09:04,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2025-02-06 13:09:05,651 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9735dc4b/fcfef78ff205418481805b5d0c2d952e/FLAG7ac22294a [2025-02-06 13:09:05,918 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:09:05,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2025-02-06 13:09:05,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9735dc4b/fcfef78ff205418481805b5d0c2d952e/FLAG7ac22294a [2025-02-06 13:09:06,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9735dc4b/fcfef78ff205418481805b5d0c2d952e [2025-02-06 13:09:06,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:09:06,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:09:06,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:09:06,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:09:06,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:09:06,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:09:06" (1/1) ... [2025-02-06 13:09:06,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0fd008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:06, skipping insertion in model container [2025-02-06 13:09:06,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:09:06" (1/1) ... [2025-02-06 13:09:06,234 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:09:06,353 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:09:06,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:09:06,360 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:09:06,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:09:06,384 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:09:06,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:06 WrapperNode [2025-02-06 13:09:06,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:09:06,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:09:06,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:09:06,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:09:06,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:06" (1/1) ... [2025-02-06 13:09:06,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:06" (1/1) ... [2025-02-06 13:09:06,406 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-02-06 13:09:06,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:09:06,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:09:06,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:09:06,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:09:06,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:06" (1/1) ... [2025-02-06 13:09:06,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:06" (1/1) ... [2025-02-06 13:09:06,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:06" (1/1) ... [2025-02-06 13:09:06,424 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-06 13:09:06,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:06" (1/1) ... [2025-02-06 13:09:06,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:06" (1/1) ... [2025-02-06 13:09:06,429 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:06" (1/1) ... [2025-02-06 13:09:06,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:06" (1/1) ... [2025-02-06 13:09:06,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:06" (1/1) ... [2025-02-06 13:09:06,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:06" (1/1) ... [2025-02-06 13:09:06,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:09:06,433 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:09:06,433 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:09:06,433 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:09:06,433 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:06" (1/1) ... [2025-02-06 13:09:06,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:09:06,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:06,457 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 13:09:06,459 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 13:09:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:09:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 13:09:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 13:09:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 13:09:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 13:09:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 13:09:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 13:09:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:09:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:09:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:09:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:09:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 13:09:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 13:09:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:09:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:09:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:09:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:09:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:09:06,476 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 13:09:06,539 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:09:06,540 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:09:06,794 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:09:06,794 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:09:07,026 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:09:07,027 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:09:07,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:09:07 BoogieIcfgContainer [2025-02-06 13:09:07,027 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:09:07,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:09:07,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:09:07,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:09:07,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:09:06" (1/3) ... [2025-02-06 13:09:07,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8e43d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:09:07, skipping insertion in model container [2025-02-06 13:09:07,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:06" (2/3) ... [2025-02-06 13:09:07,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8e43d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:09:07, skipping insertion in model container [2025-02-06 13:09:07,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:09:07" (3/3) ... [2025-02-06 13:09:07,038 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2025-02-06 13:09:07,049 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:09:07,050 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-min-array-hom.wvr.c that has 4 procedures, 47 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-02-06 13:09:07,050 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:09:07,111 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 13:09:07,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 121 flow [2025-02-06 13:09:07,168 INFO L124 PetriNetUnfolderBase]: 4/47 cut-off events. [2025-02-06 13:09:07,171 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 13:09:07,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 4/47 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-02-06 13:09:07,176 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 50 transitions, 121 flow [2025-02-06 13:09:07,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 46 transitions, 110 flow [2025-02-06 13:09:07,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:09:07,198 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;@1cd045e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:09:07,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-02-06 13:09:07,203 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:09:07,204 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 13:09:07,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:09:07,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:07,204 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:09:07,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:07,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:07,209 INFO L85 PathProgramCache]: Analyzing trace with hash 405260, now seen corresponding path program 1 times [2025-02-06 13:09:07,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:07,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906221918] [2025-02-06 13:09:07,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:07,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:07,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:09:07,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:09:07,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:07,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:07,414 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 13:09:07,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:07,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906221918] [2025-02-06 13:09:07,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906221918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:07,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:07,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:09:07,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043828270] [2025-02-06 13:09:07,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:07,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:09:07,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:07,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:09:07,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:09:07,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-06 13:09:07,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:07,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:07,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-06 13:09:07,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:07,777 INFO L124 PetriNetUnfolderBase]: 1316/1960 cut-off events. [2025-02-06 13:09:07,778 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-02-06 13:09:07,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3973 conditions, 1960 events. 1316/1960 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 10117 event pairs, 1060 based on Foata normal form. 1/1443 useless extension candidates. Maximal degree in co-relation 3667. Up to 1877 conditions per place. [2025-02-06 13:09:07,799 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 30 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-02-06 13:09:07,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 156 flow [2025-02-06 13:09:07,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:09:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:09:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-02-06 13:09:07,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2025-02-06 13:09:07,814 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 110 flow. Second operand 3 states and 67 transitions. [2025-02-06 13:09:07,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 156 flow [2025-02-06 13:09:07,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 144 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:09:07,824 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 84 flow [2025-02-06 13:09:07,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-02-06 13:09:07,830 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -13 predicate places. [2025-02-06 13:09:07,831 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 84 flow [2025-02-06 13:09:07,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:07,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:07,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:09:07,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:09:07,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:07,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:07,832 INFO L85 PathProgramCache]: Analyzing trace with hash 405261, now seen corresponding path program 1 times [2025-02-06 13:09:07,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:07,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158056665] [2025-02-06 13:09:07,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:07,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:07,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:09:07,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:09:07,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:07,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:08,074 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 13:09:08,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:08,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158056665] [2025-02-06 13:09:08,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158056665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:08,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:08,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:09:08,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314644272] [2025-02-06 13:09:08,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:08,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:09:08,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:08,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:09:08,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:09:08,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-06 13:09:08,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 13:09:08,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:08,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-06 13:09:08,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:08,280 INFO L124 PetriNetUnfolderBase]: 1317/1963 cut-off events. [2025-02-06 13:09:08,280 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 13:09:08,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3895 conditions, 1963 events. 1317/1963 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 10157 event pairs, 1060 based on Foata normal form. 0/1445 useless extension candidates. Maximal degree in co-relation 3873. Up to 1882 conditions per place. [2025-02-06 13:09:08,290 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 32 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-02-06 13:09:08,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 164 flow [2025-02-06 13:09:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-02-06 13:09:08,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.365 [2025-02-06 13:09:08,291 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 84 flow. Second operand 4 states and 73 transitions. [2025-02-06 13:09:08,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 164 flow [2025-02-06 13:09:08,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:08,293 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 107 flow [2025-02-06 13:09:08,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2025-02-06 13:09:08,293 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2025-02-06 13:09:08,294 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 107 flow [2025-02-06 13:09:08,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 13:09:08,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:08,294 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 13:09:08,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:09:08,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:08,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:08,294 INFO L85 PathProgramCache]: Analyzing trace with hash 389468033, now seen corresponding path program 1 times [2025-02-06 13:09:08,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:08,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412212244] [2025-02-06 13:09:08,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:08,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:08,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:09:08,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:09:08,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:08,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:08,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:08,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:08,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412212244] [2025-02-06 13:09:08,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412212244] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:08,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903957787] [2025-02-06 13:09:08,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:08,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:08,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:08,555 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 13:09:08,557 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 13:09:08,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:09:08,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:09:08,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:08,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:08,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 13:09:08,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:08,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 13:09:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:08,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:08,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903957787] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:08,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:08,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-06 13:09:08,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128666338] [2025-02-06 13:09:08,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:08,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:09:08,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:08,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:09:08,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:09:08,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-06 13:09:08,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 107 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 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 13:09:08,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:08,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-06 13:09:08,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:09,159 INFO L124 PetriNetUnfolderBase]: 1318/1965 cut-off events. [2025-02-06 13:09:09,159 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 13:09:09,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3911 conditions, 1965 events. 1318/1965 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 10167 event pairs, 1060 based on Foata normal form. 0/1446 useless extension candidates. Maximal degree in co-relation 3880. Up to 1879 conditions per place. [2025-02-06 13:09:09,168 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 28 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2025-02-06 13:09:09,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 191 flow [2025-02-06 13:09:09,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:09:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:09:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2025-02-06 13:09:09,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28 [2025-02-06 13:09:09,169 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 107 flow. Second operand 8 states and 112 transitions. [2025-02-06 13:09:09,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 191 flow [2025-02-06 13:09:09,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:09:09,170 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 132 flow [2025-02-06 13:09:09,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=132, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-02-06 13:09:09,171 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-02-06 13:09:09,171 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 132 flow [2025-02-06 13:09:09,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 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 13:09:09,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:09,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 13:09:09,178 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 13:09:09,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:09,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:09,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:09,375 INFO L85 PathProgramCache]: Analyzing trace with hash -808665208, now seen corresponding path program 1 times [2025-02-06 13:09:09,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:09,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907093226] [2025-02-06 13:09:09,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:09,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:09,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:09:09,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:09:09,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:09,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:09,425 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 13:09:09,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:09,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907093226] [2025-02-06 13:09:09,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907093226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:09,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:09,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:09:09,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657846284] [2025-02-06 13:09:09,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:09,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:09:09,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:09,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:09:09,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:09:09,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-06 13:09:09,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:09,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:09,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-06 13:09:09,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:09,550 INFO L124 PetriNetUnfolderBase]: 794/1200 cut-off events. [2025-02-06 13:09:09,550 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 13:09:09,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2400 conditions, 1200 events. 794/1200 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5512 event pairs, 608 based on Foata normal form. 0/1009 useless extension candidates. Maximal degree in co-relation 2362. Up to 1136 conditions per place. [2025-02-06 13:09:09,555 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 31 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2025-02-06 13:09:09,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 196 flow [2025-02-06 13:09:09,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:09,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-02-06 13:09:09,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34 [2025-02-06 13:09:09,557 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 132 flow. Second operand 4 states and 68 transitions. [2025-02-06 13:09:09,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 196 flow [2025-02-06 13:09:09,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 154 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-02-06 13:09:09,558 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 92 flow [2025-02-06 13:09:09,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2025-02-06 13:09:09,558 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -12 predicate places. [2025-02-06 13:09:09,559 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 92 flow [2025-02-06 13:09:09,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:09,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:09,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 13:09:09,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:09:09,559 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:09,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash -808665207, now seen corresponding path program 1 times [2025-02-06 13:09:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:09,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124669937] [2025-02-06 13:09:09,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:09,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:09:09,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:09:09,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:09,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:09,619 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 13:09:09,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:09,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124669937] [2025-02-06 13:09:09,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124669937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:09,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:09,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:09:09,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380416049] [2025-02-06 13:09:09,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:09,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:09:09,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:09,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:09:09,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:09:09,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-02-06 13:09:09,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 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 13:09:09,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:09,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-02-06 13:09:09,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:09,713 INFO L124 PetriNetUnfolderBase]: 793/1199 cut-off events. [2025-02-06 13:09:09,713 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 13:09:09,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2378 conditions, 1199 events. 793/1199 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5502 event pairs, 608 based on Foata normal form. 1/1011 useless extension candidates. Maximal degree in co-relation 2354. Up to 1141 conditions per place. [2025-02-06 13:09:09,718 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 32 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2025-02-06 13:09:09,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2025-02-06 13:09:09,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:09:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:09:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-02-06 13:09:09,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41333333333333333 [2025-02-06 13:09:09,719 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 92 flow. Second operand 3 states and 62 transitions. [2025-02-06 13:09:09,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2025-02-06 13:09:09,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:09,720 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 88 flow [2025-02-06 13:09:09,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-02-06 13:09:09,720 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -12 predicate places. [2025-02-06 13:09:09,720 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 88 flow [2025-02-06 13:09:09,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 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 13:09:09,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:09,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:09,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:09:09,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:09,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:09,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1938610837, now seen corresponding path program 1 times [2025-02-06 13:09:09,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:09,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356669461] [2025-02-06 13:09:09,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:09,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:09,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:09:09,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:09:09,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:09,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:09,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:09,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356669461] [2025-02-06 13:09:09,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356669461] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:09,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305142911] [2025-02-06 13:09:09,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:09,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:09,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:09,970 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 13:09:09,971 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 13:09:10,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:09:10,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:09:10,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:10,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:10,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 13:09:10,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:10,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 13:09:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:10,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:10,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305142911] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:10,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:09:10,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 10 [2025-02-06 13:09:10,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650037089] [2025-02-06 13:09:10,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:10,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:09:10,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:10,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:09:10,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:09:10,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-02-06 13:09:10,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:10,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:10,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-02-06 13:09:10,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:10,365 INFO L124 PetriNetUnfolderBase]: 1002/1521 cut-off events. [2025-02-06 13:09:10,365 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 13:09:10,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2978 conditions, 1521 events. 1002/1521 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7334 event pairs, 483 based on Foata normal form. 0/1309 useless extension candidates. Maximal degree in co-relation 2967. Up to 926 conditions per place. [2025-02-06 13:09:10,371 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 43 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2025-02-06 13:09:10,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 226 flow [2025-02-06 13:09:10,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:09:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:09:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2025-02-06 13:09:10,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2025-02-06 13:09:10,372 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 88 flow. Second operand 6 states and 109 transitions. [2025-02-06 13:09:10,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 226 flow [2025-02-06 13:09:10,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:10,374 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 120 flow [2025-02-06 13:09:10,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-02-06 13:09:10,374 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2025-02-06 13:09:10,374 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 120 flow [2025-02-06 13:09:10,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:10,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:10,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:10,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 13:09:10,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:10,575 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:10,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:10,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1045004102, now seen corresponding path program 1 times [2025-02-06 13:09:10,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:10,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5324697] [2025-02-06 13:09:10,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:10,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:10,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:09:10,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:09:10,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:10,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:10,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:10,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5324697] [2025-02-06 13:09:10,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5324697] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:10,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782630963] [2025-02-06 13:09:10,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:10,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:10,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:10,669 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 13:09:10,673 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 13:09:10,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:09:10,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:09:10,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:10,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:10,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:09:10,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:10,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:10,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782630963] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:10,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:10,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-06 13:09:10,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6235304] [2025-02-06 13:09:10,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:10,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 13:09:10,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:10,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 13:09:10,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:09:10,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-06 13:09:10,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 120 flow. Second operand has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 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 13:09:10,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:10,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-06 13:09:10,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:11,142 INFO L124 PetriNetUnfolderBase]: 1728/2583 cut-off events. [2025-02-06 13:09:11,143 INFO L125 PetriNetUnfolderBase]: For 1676/1676 co-relation queries the response was YES. [2025-02-06 13:09:11,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6361 conditions, 2583 events. 1728/2583 cut-off events. For 1676/1676 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12391 event pairs, 1148 based on Foata normal form. 0/2309 useless extension candidates. Maximal degree in co-relation 4292. Up to 1681 conditions per place. [2025-02-06 13:09:11,153 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 69 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2025-02-06 13:09:11,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 406 flow [2025-02-06 13:09:11,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:09:11,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 13:09:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-02-06 13:09:11,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2025-02-06 13:09:11,155 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 120 flow. Second operand 7 states and 135 transitions. [2025-02-06 13:09:11,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 406 flow [2025-02-06 13:09:11,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 400 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:09:11,157 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 145 flow [2025-02-06 13:09:11,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=145, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2025-02-06 13:09:11,157 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2025-02-06 13:09:11,157 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 145 flow [2025-02-06 13:09:11,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 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 13:09:11,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:11,158 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:11,174 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 13:09:11,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:11,359 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:11,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:11,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1269291935, now seen corresponding path program 1 times [2025-02-06 13:09:11,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:11,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100616917] [2025-02-06 13:09:11,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:11,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:11,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:09:11,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:09:11,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:11,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:11,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:11,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100616917] [2025-02-06 13:09:11,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100616917] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:11,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297697159] [2025-02-06 13:09:11,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:11,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:11,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:11,430 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 13:09:11,435 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 13:09:11,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:09:11,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:09:11,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:11,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:11,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:09:11,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:11,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:11,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297697159] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:11,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:11,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-06 13:09:11,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145945251] [2025-02-06 13:09:11,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:11,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 13:09:11,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:11,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 13:09:11,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:09:11,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-06 13:09:11,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 145 flow. Second operand has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:11,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:11,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-06 13:09:11,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:11,910 INFO L124 PetriNetUnfolderBase]: 1788/2666 cut-off events. [2025-02-06 13:09:11,910 INFO L125 PetriNetUnfolderBase]: For 1604/1691 co-relation queries the response was YES. [2025-02-06 13:09:11,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6835 conditions, 2666 events. 1788/2666 cut-off events. For 1604/1691 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12890 event pairs, 1114 based on Foata normal form. 38/2471 useless extension candidates. Maximal degree in co-relation 4668. Up to 1826 conditions per place. [2025-02-06 13:09:11,921 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 74 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2025-02-06 13:09:11,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 445 flow [2025-02-06 13:09:11,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:09:11,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:09:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2025-02-06 13:09:11,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3875 [2025-02-06 13:09:11,923 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 145 flow. Second operand 8 states and 155 transitions. [2025-02-06 13:09:11,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 445 flow [2025-02-06 13:09:11,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 87 transitions, 434 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:09:11,925 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 195 flow [2025-02-06 13:09:11,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=195, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2025-02-06 13:09:11,926 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2025-02-06 13:09:11,926 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 195 flow [2025-02-06 13:09:11,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:11,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:11,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:11,932 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 13:09:12,127 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,SelfDestructingSolverStorable7 [2025-02-06 13:09:12,127 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:12,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash 741636397, now seen corresponding path program 1 times [2025-02-06 13:09:12,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:12,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32562876] [2025-02-06 13:09:12,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:12,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:12,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:09:12,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:09:12,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:12,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:12,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:12,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32562876] [2025-02-06 13:09:12,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32562876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:12,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:12,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:09:12,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406684562] [2025-02-06 13:09:12,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:12,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:09:12,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:12,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:09:12,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:09:12,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-02-06 13:09:12,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 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 13:09:12,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:12,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-02-06 13:09:12,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:12,686 INFO L124 PetriNetUnfolderBase]: 1759/2715 cut-off events. [2025-02-06 13:09:12,687 INFO L125 PetriNetUnfolderBase]: For 3910/4000 co-relation queries the response was YES. [2025-02-06 13:09:12,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7613 conditions, 2715 events. 1759/2715 cut-off events. For 3910/4000 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13804 event pairs, 874 based on Foata normal form. 0/2504 useless extension candidates. Maximal degree in co-relation 4948. Up to 1692 conditions per place. [2025-02-06 13:09:12,701 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 58 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2025-02-06 13:09:12,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 445 flow [2025-02-06 13:09:12,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:09:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:09:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-02-06 13:09:12,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-02-06 13:09:12,703 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 195 flow. Second operand 5 states and 95 transitions. [2025-02-06 13:09:12,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 445 flow [2025-02-06 13:09:12,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 430 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 13:09:12,707 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 216 flow [2025-02-06 13:09:12,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2025-02-06 13:09:12,707 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2025-02-06 13:09:12,707 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 216 flow [2025-02-06 13:09:12,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 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 13:09:12,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:12,708 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:12,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:09:12,708 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:12,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:12,708 INFO L85 PathProgramCache]: Analyzing trace with hash 43660742, now seen corresponding path program 2 times [2025-02-06 13:09:12,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:12,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659434756] [2025-02-06 13:09:12,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:12,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:12,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-06 13:09:12,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:09:12,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:12,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:09:12,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659434756] [2025-02-06 13:09:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659434756] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542822072] [2025-02-06 13:09:12,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:12,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:12,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:12,820 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 13:09:12,825 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 13:09:12,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-06 13:09:12,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:09:12,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:12,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:12,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 13:09:12,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:12,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:13,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-06 13:09:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:13,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542822072] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:13,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:13,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-02-06 13:09:13,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602386974] [2025-02-06 13:09:13,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:13,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 13:09:13,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:13,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 13:09:13,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-02-06 13:09:13,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-06 13:09:13,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 216 flow. Second operand has 16 states, 16 states have (on average 11.125) internal successors, (178), 16 states have internal predecessors, (178), 0 states have call successors, (0), 0 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 13:09:13,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:13,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-06 13:09:13,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:13,797 INFO L124 PetriNetUnfolderBase]: 2578/3674 cut-off events. [2025-02-06 13:09:13,797 INFO L125 PetriNetUnfolderBase]: For 6611/6719 co-relation queries the response was YES. [2025-02-06 13:09:13,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12004 conditions, 3674 events. 2578/3674 cut-off events. For 6611/6719 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16899 event pairs, 556 based on Foata normal form. 0/3493 useless extension candidates. Maximal degree in co-relation 9027. Up to 999 conditions per place. [2025-02-06 13:09:13,811 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 123 selfloop transitions, 13 changer transitions 0/139 dead transitions. [2025-02-06 13:09:13,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 139 transitions, 920 flow [2025-02-06 13:09:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 13:09:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 13:09:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2025-02-06 13:09:13,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2025-02-06 13:09:13,813 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 216 flow. Second operand 11 states and 215 transitions. [2025-02-06 13:09:13,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 139 transitions, 920 flow [2025-02-06 13:09:13,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 139 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:13,818 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 252 flow [2025-02-06 13:09:13,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=252, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2025-02-06 13:09:13,818 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2025-02-06 13:09:13,818 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 252 flow [2025-02-06 13:09:13,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.125) internal successors, (178), 16 states have internal predecessors, (178), 0 states have call successors, (0), 0 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 13:09:13,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:13,819 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:13,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 13:09:14,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 13:09:14,020 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:14,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:14,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1880420139, now seen corresponding path program 2 times [2025-02-06 13:09:14,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:14,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075809221] [2025-02-06 13:09:14,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:14,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:14,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-06 13:09:14,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:09:14,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:14,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:09:14,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:14,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075809221] [2025-02-06 13:09:14,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075809221] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:14,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803389300] [2025-02-06 13:09:14,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:14,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:14,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:14,177 INFO L229 MonitoredProcess]: Starting monitored process 7 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 13:09:14,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:09:14,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-06 13:09:14,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:09:14,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:14,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:14,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 13:09:14,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:14,334 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:14,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:14,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-06 13:09:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:14,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803389300] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:14,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:14,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-02-06 13:09:14,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212616133] [2025-02-06 13:09:14,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:14,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 13:09:14,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:14,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 13:09:14,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-02-06 13:09:14,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-06 13:09:14,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 252 flow. Second operand has 20 states, 20 states have (on average 10.9) internal successors, (218), 20 states have internal predecessors, (218), 0 states have call successors, (0), 0 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 13:09:14,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:14,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-06 13:09:14,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:15,608 INFO L124 PetriNetUnfolderBase]: 3434/4821 cut-off events. [2025-02-06 13:09:15,608 INFO L125 PetriNetUnfolderBase]: For 7547/7834 co-relation queries the response was YES. [2025-02-06 13:09:15,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16699 conditions, 4821 events. 3434/4821 cut-off events. For 7547/7834 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 22823 event pairs, 475 based on Foata normal form. 172/4987 useless extension candidates. Maximal degree in co-relation 13098. Up to 954 conditions per place. [2025-02-06 13:09:15,626 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 166 selfloop transitions, 18 changer transitions 0/188 dead transitions. [2025-02-06 13:09:15,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 188 transitions, 1230 flow [2025-02-06 13:09:15,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 13:09:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 13:09:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 284 transitions. [2025-02-06 13:09:15,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4057142857142857 [2025-02-06 13:09:15,628 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 252 flow. Second operand 14 states and 284 transitions. [2025-02-06 13:09:15,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 188 transitions, 1230 flow [2025-02-06 13:09:15,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 188 transitions, 1174 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-02-06 13:09:15,635 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 303 flow [2025-02-06 13:09:15,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=303, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2025-02-06 13:09:15,636 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2025-02-06 13:09:15,636 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 54 transitions, 303 flow [2025-02-06 13:09:15,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.9) internal successors, (218), 20 states have internal predecessors, (218), 0 states have call successors, (0), 0 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 13:09:15,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:15,637 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:15,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 13:09:15,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 13:09:15,841 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:15,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:15,842 INFO L85 PathProgramCache]: Analyzing trace with hash 778642587, now seen corresponding path program 1 times [2025-02-06 13:09:15,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:15,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334123675] [2025-02-06 13:09:15,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:15,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:15,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:09:15,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:09:15,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:15,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:15,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:15,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334123675] [2025-02-06 13:09:15,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334123675] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:15,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055872399] [2025-02-06 13:09:15,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:15,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:15,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:15,921 INFO L229 MonitoredProcess]: Starting monitored process 8 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 13:09:15,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:09:15,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:09:15,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:09:15,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:15,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:15,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 13:09:15,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:16,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:16,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055872399] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:16,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:16,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-06 13:09:16,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809582524] [2025-02-06 13:09:16,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:16,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 13:09:16,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:16,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 13:09:16,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:09:16,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-06 13:09:16,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 54 transitions, 303 flow. Second operand has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 0 states have call successors, (0), 0 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 13:09:16,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:16,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-06 13:09:16,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:16,579 INFO L124 PetriNetUnfolderBase]: 3196/4549 cut-off events. [2025-02-06 13:09:16,579 INFO L125 PetriNetUnfolderBase]: For 12554/12814 co-relation queries the response was YES. [2025-02-06 13:09:16,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16549 conditions, 4549 events. 3196/4549 cut-off events. For 12554/12814 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 20742 event pairs, 2017 based on Foata normal form. 34/4553 useless extension candidates. Maximal degree in co-relation 13631. Up to 3650 conditions per place. [2025-02-06 13:09:16,628 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 75 selfloop transitions, 10 changer transitions 0/91 dead transitions. [2025-02-06 13:09:16,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 91 transitions, 667 flow [2025-02-06 13:09:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:09:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:09:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2025-02-06 13:09:16,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.365 [2025-02-06 13:09:16,632 INFO L175 Difference]: Start difference. First operand has 73 places, 54 transitions, 303 flow. Second operand 8 states and 146 transitions. [2025-02-06 13:09:16,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 91 transitions, 667 flow [2025-02-06 13:09:16,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 582 flow, removed 9 selfloop flow, removed 10 redundant places. [2025-02-06 13:09:16,650 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 313 flow [2025-02-06 13:09:16,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=313, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2025-02-06 13:09:16,655 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2025-02-06 13:09:16,655 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 313 flow [2025-02-06 13:09:16,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 0 states have call successors, (0), 0 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 13:09:16,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:16,655 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:16,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 13:09:16,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:16,856 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:16,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:16,856 INFO L85 PathProgramCache]: Analyzing trace with hash -183978225, now seen corresponding path program 2 times [2025-02-06 13:09:16,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:16,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092464651] [2025-02-06 13:09:16,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:16,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:16,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-06 13:09:16,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:09:16,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:16,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:09:17,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:17,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092464651] [2025-02-06 13:09:17,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092464651] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:17,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955409082] [2025-02-06 13:09:17,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:17,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:17,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:17,029 INFO L229 MonitoredProcess]: Starting monitored process 9 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 13:09:17,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 13:09:17,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-06 13:09:17,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:09:17,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:17,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:17,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 13:09:17,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:09:17,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:17,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-02-06 13:09:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:09:17,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955409082] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:17,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:17,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-02-06 13:09:17,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478556739] [2025-02-06 13:09:17,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:17,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 13:09:17,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:17,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 13:09:17,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-02-06 13:09:17,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-06 13:09:17,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 313 flow. Second operand has 19 states, 19 states have (on average 11.368421052631579) internal successors, (216), 19 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 13:09:17,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:17,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-06 13:09:17,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:18,050 INFO L124 PetriNetUnfolderBase]: 3196/4498 cut-off events. [2025-02-06 13:09:18,050 INFO L125 PetriNetUnfolderBase]: For 8097/8325 co-relation queries the response was YES. [2025-02-06 13:09:18,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16007 conditions, 4498 events. 3196/4498 cut-off events. For 8097/8325 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 20463 event pairs, 673 based on Foata normal form. 103/4593 useless extension candidates. Maximal degree in co-relation 13140. Up to 1506 conditions per place. [2025-02-06 13:09:18,081 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 106 selfloop transitions, 13 changer transitions 0/125 dead transitions. [2025-02-06 13:09:18,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 125 transitions, 919 flow [2025-02-06 13:09:18,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:09:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 13:09:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2025-02-06 13:09:18,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3657142857142857 [2025-02-06 13:09:18,086 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 313 flow. Second operand 7 states and 128 transitions. [2025-02-06 13:09:18,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 125 transitions, 919 flow [2025-02-06 13:09:18,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 125 transitions, 906 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-06 13:09:18,105 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 342 flow [2025-02-06 13:09:18,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2025-02-06 13:09:18,106 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2025-02-06 13:09:18,106 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 342 flow [2025-02-06 13:09:18,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.368421052631579) internal successors, (216), 19 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 13:09:18,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:18,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:18,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 13:09:18,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:18,307 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:18,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:18,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2043700778, now seen corresponding path program 1 times [2025-02-06 13:09:18,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:18,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927622363] [2025-02-06 13:09:18,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:18,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:18,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:09:18,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:09:18,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:18,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:18,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:09:18,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:18,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927622363] [2025-02-06 13:09:18,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927622363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:18,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:18,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:09:18,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994902690] [2025-02-06 13:09:18,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:18,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:09:18,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:18,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:09:18,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:09:18,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-02-06 13:09:18,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:18,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:18,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-02-06 13:09:18,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:18,681 INFO L124 PetriNetUnfolderBase]: 2704/4080 cut-off events. [2025-02-06 13:09:18,681 INFO L125 PetriNetUnfolderBase]: For 10574/10755 co-relation queries the response was YES. [2025-02-06 13:09:18,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15575 conditions, 4080 events. 2704/4080 cut-off events. For 10574/10755 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 19842 event pairs, 632 based on Foata normal form. 2/4068 useless extension candidates. Maximal degree in co-relation 12432. Up to 3332 conditions per place. [2025-02-06 13:09:18,702 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 69 selfloop transitions, 4 changer transitions 1/82 dead transitions. [2025-02-06 13:09:18,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 82 transitions, 615 flow [2025-02-06 13:09:18,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:09:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:09:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-02-06 13:09:18,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2025-02-06 13:09:18,703 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 342 flow. Second operand 3 states and 74 transitions. [2025-02-06 13:09:18,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 82 transitions, 615 flow [2025-02-06 13:09:18,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 82 transitions, 581 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-06 13:09:18,714 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 346 flow [2025-02-06 13:09:18,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2025-02-06 13:09:18,714 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2025-02-06 13:09:18,714 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 346 flow [2025-02-06 13:09:18,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:18,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:18,715 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:18,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 13:09:18,715 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:18,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:18,715 INFO L85 PathProgramCache]: Analyzing trace with hash 52912290, now seen corresponding path program 1 times [2025-02-06 13:09:18,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:18,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77589655] [2025-02-06 13:09:18,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:18,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:18,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:09:18,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:09:18,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:18,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:18,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:18,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77589655] [2025-02-06 13:09:18,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77589655] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:18,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046622077] [2025-02-06 13:09:18,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:18,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:18,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:18,817 INFO L229 MonitoredProcess]: Starting monitored process 10 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 13:09:18,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 13:09:18,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:09:18,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:09:18,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:18,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:18,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:09:18,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:18,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:18,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046622077] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:18,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:09:18,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2025-02-06 13:09:18,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659322849] [2025-02-06 13:09:18,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:18,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:09:18,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:18,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:09:18,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:09:18,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-06 13:09:18,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:18,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:18,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-06 13:09:18,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:19,174 INFO L124 PetriNetUnfolderBase]: 3264/4718 cut-off events. [2025-02-06 13:09:19,174 INFO L125 PetriNetUnfolderBase]: For 11401/11610 co-relation queries the response was YES. [2025-02-06 13:09:19,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17782 conditions, 4718 events. 3264/4718 cut-off events. For 11401/11610 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 22544 event pairs, 929 based on Foata normal form. 142/4768 useless extension candidates. Maximal degree in co-relation 14717. Up to 2677 conditions per place. [2025-02-06 13:09:19,198 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 72 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2025-02-06 13:09:19,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 87 transitions, 657 flow [2025-02-06 13:09:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:09:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:09:19,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2025-02-06 13:09:19,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.352 [2025-02-06 13:09:19,199 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 346 flow. Second operand 5 states and 88 transitions. [2025-02-06 13:09:19,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 87 transitions, 657 flow [2025-02-06 13:09:19,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 87 transitions, 633 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:19,212 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 356 flow [2025-02-06 13:09:19,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=356, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2025-02-06 13:09:19,212 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2025-02-06 13:09:19,212 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 356 flow [2025-02-06 13:09:19,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:19,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:19,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:19,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 13:09:19,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:19,413 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:19,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:19,413 INFO L85 PathProgramCache]: Analyzing trace with hash 458515338, now seen corresponding path program 1 times [2025-02-06 13:09:19,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:19,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147070645] [2025-02-06 13:09:19,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:19,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:19,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:09:19,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:09:19,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:19,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 13:09:19,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:19,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147070645] [2025-02-06 13:09:19,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147070645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:19,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:19,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:09:19,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595614467] [2025-02-06 13:09:19,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:19,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:09:19,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:19,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:09:19,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:09:19,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-06 13:09:19,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 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 13:09:19,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:19,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-06 13:09:19,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:19,799 INFO L124 PetriNetUnfolderBase]: 2927/4251 cut-off events. [2025-02-06 13:09:19,800 INFO L125 PetriNetUnfolderBase]: For 12177/12401 co-relation queries the response was YES. [2025-02-06 13:09:19,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16036 conditions, 4251 events. 2927/4251 cut-off events. For 12177/12401 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 20310 event pairs, 912 based on Foata normal form. 141/4287 useless extension candidates. Maximal degree in co-relation 13417. Up to 2246 conditions per place. [2025-02-06 13:09:19,821 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 68 selfloop transitions, 8 changer transitions 0/83 dead transitions. [2025-02-06 13:09:19,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 83 transitions, 642 flow [2025-02-06 13:09:19,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-02-06 13:09:19,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-02-06 13:09:19,822 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 356 flow. Second operand 4 states and 76 transitions. [2025-02-06 13:09:19,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 83 transitions, 642 flow [2025-02-06 13:09:19,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 83 transitions, 619 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-02-06 13:09:19,832 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 339 flow [2025-02-06 13:09:19,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=339, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2025-02-06 13:09:19,832 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2025-02-06 13:09:19,832 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 339 flow [2025-02-06 13:09:19,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 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 13:09:19,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:19,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:19,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 13:09:19,833 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:19,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:19,833 INFO L85 PathProgramCache]: Analyzing trace with hash -372921764, now seen corresponding path program 1 times [2025-02-06 13:09:19,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:19,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863438243] [2025-02-06 13:09:19,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:19,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:19,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:09:19,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:09:19,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:19,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:20,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:09:20,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:20,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863438243] [2025-02-06 13:09:20,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863438243] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:20,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014029347] [2025-02-06 13:09:20,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:20,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:20,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:20,399 INFO L229 MonitoredProcess]: Starting monitored process 11 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 13:09:20,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 13:09:20,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:09:20,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:09:20,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:20,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:20,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 13:09:20,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:20,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 13:09:20,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 65 [2025-02-06 13:09:20,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2025-02-06 13:09:20,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2025-02-06 13:09:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:20,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:21,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 173 [2025-02-06 13:09:21,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 169 [2025-02-06 13:09:22,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 229 [2025-02-06 13:09:22,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:09:22,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 282 treesize of output 312 [2025-02-06 13:09:48,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 254 [2025-02-06 13:09:48,105 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-02-06 13:09:48,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 372 treesize of output 1 [2025-02-06 13:09:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:48,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014029347] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:48,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:48,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-02-06 13:09:48,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306610383] [2025-02-06 13:09:48,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:48,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 13:09:48,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:48,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 13:09:48,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-02-06 13:09:48,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-02-06 13:09:48,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 339 flow. Second operand has 25 states, 25 states have (on average 11.12) internal successors, (278), 25 states have internal predecessors, (278), 0 states have call successors, (0), 0 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 13:09:48,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:48,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-02-06 13:09:48,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:51,297 INFO L124 PetriNetUnfolderBase]: 4862/7118 cut-off events. [2025-02-06 13:09:51,297 INFO L125 PetriNetUnfolderBase]: For 17645/17923 co-relation queries the response was YES. [2025-02-06 13:09:51,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27131 conditions, 7118 events. 4862/7118 cut-off events. For 17645/17923 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 36497 event pairs, 562 based on Foata normal form. 5/7122 useless extension candidates. Maximal degree in co-relation 21130. Up to 4870 conditions per place. [2025-02-06 13:09:51,335 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 155 selfloop transitions, 49 changer transitions 83/290 dead transitions. [2025-02-06 13:09:51,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 290 transitions, 2034 flow [2025-02-06 13:09:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 13:09:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-06 13:09:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 502 transitions. [2025-02-06 13:09:51,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33466666666666667 [2025-02-06 13:09:51,337 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 339 flow. Second operand 30 states and 502 transitions. [2025-02-06 13:09:51,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 290 transitions, 2034 flow [2025-02-06 13:09:51,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 290 transitions, 1984 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:09:51,365 INFO L231 Difference]: Finished difference. Result has 118 places, 98 transitions, 753 flow [2025-02-06 13:09:51,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=753, PETRI_PLACES=118, PETRI_TRANSITIONS=98} [2025-02-06 13:09:51,365 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 66 predicate places. [2025-02-06 13:09:51,365 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 98 transitions, 753 flow [2025-02-06 13:09:51,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.12) internal successors, (278), 25 states have internal predecessors, (278), 0 states have call successors, (0), 0 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 13:09:51,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:51,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:51,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 13:09:51,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 13:09:51,570 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:09:51,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash 973833020, now seen corresponding path program 2 times [2025-02-06 13:09:51,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:51,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796342054] [2025-02-06 13:09:51,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:51,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:51,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 13:09:51,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:09:51,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:51,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:09:51,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:51,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796342054] [2025-02-06 13:09:51,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796342054] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:51,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873242213] [2025-02-06 13:09:51,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:51,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:51,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:51,858 INFO L229 MonitoredProcess]: Starting monitored process 12 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 13:09:51,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 13:09:51,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 13:09:51,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:09:51,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:51,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:51,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 13:09:51,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:51,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 13:09:52,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 55 [2025-02-06 13:09:52,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2025-02-06 13:09:52,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2025-02-06 13:09:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:52,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:52,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 173 [2025-02-06 13:09:52,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 169 [2025-02-06 13:09:53,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 229 [2025-02-06 13:09:54,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:09:54,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 282 treesize of output 312 [2025-02-06 13:10:22,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 254 [2025-02-06 13:10:22,043 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-02-06 13:10:22,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 372 treesize of output 1 [2025-02-06 13:10:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:10:22,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873242213] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:10:22,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:10:22,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-02-06 13:10:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149266363] [2025-02-06 13:10:22,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:10:22,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 13:10:22,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:10:22,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 13:10:22,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-02-06 13:10:22,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-06 13:10:22,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 98 transitions, 753 flow. Second operand has 25 states, 25 states have (on average 11.88) internal successors, (297), 25 states have internal predecessors, (297), 0 states have call successors, (0), 0 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 13:10:22,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:10:22,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-06 13:10:22,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:10:24,635 INFO L124 PetriNetUnfolderBase]: 3966/6146 cut-off events. [2025-02-06 13:10:24,635 INFO L125 PetriNetUnfolderBase]: For 24945/25195 co-relation queries the response was YES. [2025-02-06 13:10:24,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26806 conditions, 6146 events. 3966/6146 cut-off events. For 24945/25195 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 34867 event pairs, 670 based on Foata normal form. 8/5986 useless extension candidates. Maximal degree in co-relation 26746. Up to 4770 conditions per place. [2025-02-06 13:10:24,661 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 144 selfloop transitions, 81 changer transitions 43/279 dead transitions. [2025-02-06 13:10:24,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 279 transitions, 2542 flow [2025-02-06 13:10:24,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-06 13:10:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-02-06 13:10:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 482 transitions. [2025-02-06 13:10:24,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30125 [2025-02-06 13:10:24,662 INFO L175 Difference]: Start difference. First operand has 118 places, 98 transitions, 753 flow. Second operand 32 states and 482 transitions. [2025-02-06 13:10:24,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 279 transitions, 2542 flow [2025-02-06 13:10:24,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 279 transitions, 2350 flow, removed 76 selfloop flow, removed 11 redundant places. [2025-02-06 13:10:24,690 INFO L231 Difference]: Finished difference. Result has 148 places, 163 transitions, 1539 flow [2025-02-06 13:10:24,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1539, PETRI_PLACES=148, PETRI_TRANSITIONS=163} [2025-02-06 13:10:24,690 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 96 predicate places. [2025-02-06 13:10:24,690 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 163 transitions, 1539 flow [2025-02-06 13:10:24,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.88) internal successors, (297), 25 states have internal predecessors, (297), 0 states have call successors, (0), 0 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 13:10:24,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:10:24,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:10:24,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 13:10:24,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 13:10:24,895 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:10:24,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:10:24,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1276342224, now seen corresponding path program 3 times [2025-02-06 13:10:24,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:10:24,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066313837] [2025-02-06 13:10:24,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:10:24,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:10:24,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-02-06 13:10:24,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 27 statements. [2025-02-06 13:10:24,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 13:10:24,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:10:25,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:10:25,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066313837] [2025-02-06 13:10:25,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066313837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:10:25,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:10:25,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 13:10:25,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598029106] [2025-02-06 13:10:25,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:10:25,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:10:25,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:10:25,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:10:25,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:10:25,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-06 13:10:25,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 163 transitions, 1539 flow. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 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 13:10:25,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:10:25,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-06 13:10:25,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:10:25,827 INFO L124 PetriNetUnfolderBase]: 3876/6081 cut-off events. [2025-02-06 13:10:25,827 INFO L125 PetriNetUnfolderBase]: For 31396/31712 co-relation queries the response was YES. [2025-02-06 13:10:25,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28843 conditions, 6081 events. 3876/6081 cut-off events. For 31396/31712 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 35175 event pairs, 705 based on Foata normal form. 38/5951 useless extension candidates. Maximal degree in co-relation 28772. Up to 5137 conditions per place. [2025-02-06 13:10:25,870 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 163 selfloop transitions, 69 changer transitions 14/257 dead transitions. [2025-02-06 13:10:25,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 257 transitions, 2820 flow [2025-02-06 13:10:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 13:10:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 13:10:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2025-02-06 13:10:25,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3418181818181818 [2025-02-06 13:10:25,871 INFO L175 Difference]: Start difference. First operand has 148 places, 163 transitions, 1539 flow. Second operand 11 states and 188 transitions. [2025-02-06 13:10:25,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 257 transitions, 2820 flow [2025-02-06 13:10:25,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 257 transitions, 2664 flow, removed 68 selfloop flow, removed 9 redundant places. [2025-02-06 13:10:25,922 INFO L231 Difference]: Finished difference. Result has 150 places, 199 transitions, 2044 flow [2025-02-06 13:10:25,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2044, PETRI_PLACES=150, PETRI_TRANSITIONS=199} [2025-02-06 13:10:25,922 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 98 predicate places. [2025-02-06 13:10:25,922 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 199 transitions, 2044 flow [2025-02-06 13:10:25,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 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 13:10:25,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:10:25,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:10:25,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 13:10:25,923 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:10:25,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:10:25,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1862471732, now seen corresponding path program 4 times [2025-02-06 13:10:25,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:10:25,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324549965] [2025-02-06 13:10:25,923 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:10:25,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:10:25,930 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-02-06 13:10:25,940 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:10:25,940 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:10:25,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:26,375 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:10:26,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:10:26,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324549965] [2025-02-06 13:10:26,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324549965] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:10:26,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016074662] [2025-02-06 13:10:26,375 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:10:26,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:26,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:10:26,379 INFO L229 MonitoredProcess]: Starting monitored process 13 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 13:10:26,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 13:10:26,417 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-02-06 13:10:26,434 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:10:26,434 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:10:26,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:26,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 13:10:26,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:10:26,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 65 [2025-02-06 13:10:26,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2025-02-06 13:10:26,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2025-02-06 13:10:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:10:26,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:10:26,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:10:26,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 121 [2025-02-06 13:10:26,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 109 [2025-02-06 13:10:26,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 105 [2025-02-06 13:10:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:10:27,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016074662] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:10:27,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:10:27,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 25 [2025-02-06 13:10:27,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580343504] [2025-02-06 13:10:27,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:10:27,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 13:10:27,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:10:27,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 13:10:27,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2025-02-06 13:10:27,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-06 13:10:27,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 199 transitions, 2044 flow. Second operand has 26 states, 26 states have (on average 11.538461538461538) internal successors, (300), 26 states have internal predecessors, (300), 0 states have call successors, (0), 0 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 13:10:27,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:10:27,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-06 13:10:27,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:10:28,645 INFO L124 PetriNetUnfolderBase]: 4806/7523 cut-off events. [2025-02-06 13:10:28,646 INFO L125 PetriNetUnfolderBase]: For 42352/42676 co-relation queries the response was YES. [2025-02-06 13:10:28,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36412 conditions, 7523 events. 4806/7523 cut-off events. For 42352/42676 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 44611 event pairs, 961 based on Foata normal form. 36/7395 useless extension candidates. Maximal degree in co-relation 35567. Up to 5667 conditions per place. [2025-02-06 13:10:28,702 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 188 selfloop transitions, 114 changer transitions 18/331 dead transitions. [2025-02-06 13:10:28,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 331 transitions, 3891 flow [2025-02-06 13:10:28,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 13:10:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 13:10:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 241 transitions. [2025-02-06 13:10:28,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32133333333333336 [2025-02-06 13:10:28,703 INFO L175 Difference]: Start difference. First operand has 150 places, 199 transitions, 2044 flow. Second operand 15 states and 241 transitions. [2025-02-06 13:10:28,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 331 transitions, 3891 flow [2025-02-06 13:10:28,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 331 transitions, 3764 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-02-06 13:10:28,787 INFO L231 Difference]: Finished difference. Result has 170 places, 254 transitions, 3021 flow [2025-02-06 13:10:28,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3021, PETRI_PLACES=170, PETRI_TRANSITIONS=254} [2025-02-06 13:10:28,787 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 118 predicate places. [2025-02-06 13:10:28,787 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 254 transitions, 3021 flow [2025-02-06 13:10:28,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.538461538461538) internal successors, (300), 26 states have internal predecessors, (300), 0 states have call successors, (0), 0 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 13:10:28,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:10:28,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:10:28,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 13:10:28,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:28,992 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:10:28,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:10:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1357618, now seen corresponding path program 5 times [2025-02-06 13:10:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:10:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245339626] [2025-02-06 13:10:28,993 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:10:28,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:10:28,997 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-02-06 13:10:29,007 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:10:29,008 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 13:10:29,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:29,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:10:29,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:10:29,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245339626] [2025-02-06 13:10:29,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245339626] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:10:29,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980823490] [2025-02-06 13:10:29,396 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:10:29,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:29,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:10:29,398 INFO L229 MonitoredProcess]: Starting monitored process 14 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 13:10:29,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 13:10:29,435 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-02-06 13:10:29,454 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:10:29,454 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 13:10:29,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:29,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 13:10:29,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:10:29,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 13:10:29,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 65 [2025-02-06 13:10:29,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2025-02-06 13:10:29,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2025-02-06 13:10:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:10:29,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:10:30,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 165 [2025-02-06 13:10:30,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 161 [2025-02-06 13:10:31,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 188 [2025-02-06 13:10:31,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:10:31,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 236 treesize of output 240 [2025-02-06 13:10:34,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 99 [2025-02-06 13:10:34,490 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:10:34,491 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 128 treesize of output 118 [2025-02-06 13:10:34,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 195 [2025-02-06 13:10:34,797 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-02-06 13:10:34,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 296 treesize of output 1 [2025-02-06 13:10:34,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:10:34,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980823490] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:10:34,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:10:34,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-02-06 13:10:34,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773729463] [2025-02-06 13:10:34,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:10:34,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 13:10:34,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:10:34,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 13:10:34,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-02-06 13:10:35,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-02-06 13:10:35,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 254 transitions, 3021 flow. Second operand has 25 states, 25 states have (on average 12.88) internal successors, (322), 25 states have internal predecessors, (322), 0 states have call successors, (0), 0 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 13:10:35,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:10:35,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-02-06 13:10:35,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:10:37,325 INFO L124 PetriNetUnfolderBase]: 4352/6945 cut-off events. [2025-02-06 13:10:37,326 INFO L125 PetriNetUnfolderBase]: For 53622/54115 co-relation queries the response was YES. [2025-02-06 13:10:37,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37205 conditions, 6945 events. 4352/6945 cut-off events. For 53622/54115 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 42258 event pairs, 951 based on Foata normal form. 158/7052 useless extension candidates. Maximal degree in co-relation 36385. Up to 5636 conditions per place. [2025-02-06 13:10:37,368 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 212 selfloop transitions, 67 changer transitions 40/333 dead transitions. [2025-02-06 13:10:37,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 333 transitions, 4266 flow [2025-02-06 13:10:37,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 13:10:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-06 13:10:37,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 320 transitions. [2025-02-06 13:10:37,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3368421052631579 [2025-02-06 13:10:37,370 INFO L175 Difference]: Start difference. First operand has 170 places, 254 transitions, 3021 flow. Second operand 19 states and 320 transitions. [2025-02-06 13:10:37,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 333 transitions, 4266 flow [2025-02-06 13:10:37,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 333 transitions, 4080 flow, removed 71 selfloop flow, removed 4 redundant places. [2025-02-06 13:10:37,462 INFO L231 Difference]: Finished difference. Result has 190 places, 249 transitions, 2941 flow [2025-02-06 13:10:37,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2844, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2941, PETRI_PLACES=190, PETRI_TRANSITIONS=249} [2025-02-06 13:10:37,462 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 138 predicate places. [2025-02-06 13:10:37,462 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 249 transitions, 2941 flow [2025-02-06 13:10:37,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 12.88) internal successors, (322), 25 states have internal predecessors, (322), 0 states have call successors, (0), 0 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 13:10:37,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:10:37,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:10:37,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 13:10:37,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:37,667 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 13:10:37,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:10:37,668 INFO L85 PathProgramCache]: Analyzing trace with hash -219244762, now seen corresponding path program 6 times [2025-02-06 13:10:37,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:10:37,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784812544] [2025-02-06 13:10:37,668 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:10:37,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:10:37,677 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 3 equivalence classes. [2025-02-06 13:10:37,684 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:10:37,685 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 13:10:37,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:38,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:10:38,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:10:38,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784812544] [2025-02-06 13:10:38,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784812544] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:10:38,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728282579] [2025-02-06 13:10:38,059 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:10:38,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:38,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:10:38,060 INFO L229 MonitoredProcess]: Starting monitored process 15 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 13:10:38,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 13:10:38,102 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 3 equivalence classes. [2025-02-06 13:10:38,123 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:10:38,123 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 13:10:38,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:38,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 13:10:38,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:10:38,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 13:10:38,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 55 [2025-02-06 13:10:38,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2025-02-06 13:10:38,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2025-02-06 13:10:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:10:38,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:10:38,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 173 [2025-02-06 13:10:38,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 169 [2025-02-06 13:10:40,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 229 [2025-02-06 13:10:40,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:10:40,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 282 treesize of output 312