./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-multiply-verify.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-multiply-verify.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 d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:09:11,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:09:11,572 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:11,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:09:11,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:09:11,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:09:11,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:09:11,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:09:11,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:09:11,604 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:09:11,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:09:11,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:09:11,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:09:11,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:09:11,605 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:09:11,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:09:11,606 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:09:11,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:09:11,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:09:11,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:09:11,606 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:09:11,606 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:09:11,606 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:09:11,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:09:11,606 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:09:11,606 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:09:11,606 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:09:11,606 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:09:11,606 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:09:11,607 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:09:11,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:09:11,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:09:11,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:09:11,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:09:11,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:09:11,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:09:11,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:09:11,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:09:11,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:09:11,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:09:11,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:09:11,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:09:11,608 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 -> d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 [2025-02-06 13:09:11,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:09:11,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:09:11,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:09:11,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:09:11,910 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:09:11,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2025-02-06 13:09:13,286 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3151947e/49d2d945da6143c785f4d1d68d81d625/FLAG6346df35c [2025-02-06 13:09:13,571 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:09:13,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2025-02-06 13:09:13,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3151947e/49d2d945da6143c785f4d1d68d81d625/FLAG6346df35c [2025-02-06 13:09:13,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3151947e/49d2d945da6143c785f4d1d68d81d625 [2025-02-06 13:09:13,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:09:13,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:09:13,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:09:13,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:09:13,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:09:13,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:09:13" (1/1) ... [2025-02-06 13:09:13,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d08bdda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:13, skipping insertion in model container [2025-02-06 13:09:13,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:09:13" (1/1) ... [2025-02-06 13:09:13,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:09:14,021 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:14,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:09:14,029 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:09:14,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:09:14,057 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:09:14,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:14 WrapperNode [2025-02-06 13:09:14,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:09:14,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:09:14,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:09:14,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:09:14,062 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:14" (1/1) ... [2025-02-06 13:09:14,067 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:14" (1/1) ... [2025-02-06 13:09:14,080 INFO L138 Inliner]: procedures = 25, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 164 [2025-02-06 13:09:14,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:09:14,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:09:14,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:09:14,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:09:14,087 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:14" (1/1) ... [2025-02-06 13:09:14,087 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:14" (1/1) ... [2025-02-06 13:09:14,089 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:14" (1/1) ... [2025-02-06 13:09:14,105 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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:14,105 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:14" (1/1) ... [2025-02-06 13:09:14,106 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:14" (1/1) ... [2025-02-06 13:09:14,109 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:14" (1/1) ... [2025-02-06 13:09:14,110 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:14" (1/1) ... [2025-02-06 13:09:14,111 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:14" (1/1) ... [2025-02-06 13:09:14,112 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:14" (1/1) ... [2025-02-06 13:09:14,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:09:14,113 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:09:14,113 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:09:14,113 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:09:14,114 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:14" (1/1) ... [2025-02-06 13:09:14,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:09:14,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:14,138 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:14,147 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:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:09:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 13:09:14,160 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 13:09:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 13:09:14,160 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 13:09:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 13:09:14,160 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 13:09:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:09:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:09:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:09:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:09:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 13:09:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 13:09:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:09:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:09:14,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:09:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:09:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:09:14,161 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:14,226 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:09:14,227 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:09:14,428 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:09:14,428 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:09:14,567 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:09:14,567 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:09:14,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:09:14 BoogieIcfgContainer [2025-02-06 13:09:14,568 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:09:14,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:09:14,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:09:14,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:09:14,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:09:13" (1/3) ... [2025-02-06 13:09:14,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d642fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:09:14, skipping insertion in model container [2025-02-06 13:09:14,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:14" (2/3) ... [2025-02-06 13:09:14,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d642fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:09:14, skipping insertion in model container [2025-02-06 13:09:14,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:09:14" (3/3) ... [2025-02-06 13:09:14,574 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2025-02-06 13:09:14,584 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:09:14,585 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-multiply-verify.wvr.c that has 4 procedures, 47 locations, 1 initial locations, 3 loop locations, and 12 error locations. [2025-02-06 13:09:14,585 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:09:14,626 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 13:09:14,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 119 flow [2025-02-06 13:09:14,681 INFO L124 PetriNetUnfolderBase]: 3/46 cut-off events. [2025-02-06 13:09:14,683 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 13:09:14,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 3/46 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 91 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-02-06 13:09:14,685 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 49 transitions, 119 flow [2025-02-06 13:09:14,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 45 transitions, 108 flow [2025-02-06 13:09:14,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:09:14,699 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;@2bc91576, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:09:14,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-06 13:09:14,702 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:09:14,702 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 13:09:14,702 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:09:14,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:14,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:09:14,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:09:14,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:14,706 INFO L85 PathProgramCache]: Analyzing trace with hash 449591, now seen corresponding path program 1 times [2025-02-06 13:09:14,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:14,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776647786] [2025-02-06 13:09:14,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:14,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:14,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:09:14,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:09:14,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:14,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:14,848 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:14,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:14,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776647786] [2025-02-06 13:09:14,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776647786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:14,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:14,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:09:14,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392700144] [2025-02-06 13:09:14,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:14,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:09:14,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:14,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:09:14,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:09:14,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-02-06 13:09:14,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:14,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:14,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-02-06 13:09:14,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:15,137 INFO L124 PetriNetUnfolderBase]: 1148/1869 cut-off events. [2025-02-06 13:09:15,138 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-02-06 13:09:15,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3756 conditions, 1869 events. 1148/1869 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 10322 event pairs, 1014 based on Foata normal form. 1/1481 useless extension candidates. Maximal degree in co-relation 3567. Up to 1706 conditions per place. [2025-02-06 13:09:15,151 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 30 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-02-06 13:09:15,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 166 flow [2025-02-06 13:09:15,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:09:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:09:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-02-06 13:09:15,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5170068027210885 [2025-02-06 13:09:15,161 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 108 flow. Second operand 3 states and 76 transitions. [2025-02-06 13:09:15,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 166 flow [2025-02-06 13:09:15,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 42 transitions, 154 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:09:15,168 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 94 flow [2025-02-06 13:09:15,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2025-02-06 13:09:15,172 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2025-02-06 13:09:15,173 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 94 flow [2025-02-06 13:09:15,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:15,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:15,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:09:15,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:09:15,173 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:09:15,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:15,174 INFO L85 PathProgramCache]: Analyzing trace with hash 449592, now seen corresponding path program 1 times [2025-02-06 13:09:15,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:15,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145780069] [2025-02-06 13:09:15,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:15,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:15,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:09:15,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:09:15,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:15,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:15,369 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:15,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:15,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145780069] [2025-02-06 13:09:15,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145780069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:15,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:15,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:09:15,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11023614] [2025-02-06 13:09:15,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:15,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:09:15,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:15,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:09:15,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:09:15,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-02-06 13:09:15,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 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,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:15,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-02-06 13:09:15,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:15,666 INFO L124 PetriNetUnfolderBase]: 1149/1872 cut-off events. [2025-02-06 13:09:15,666 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-06 13:09:15,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3663 conditions, 1872 events. 1149/1872 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10309 event pairs, 1014 based on Foata normal form. 0/1483 useless extension candidates. Maximal degree in co-relation 3641. Up to 1711 conditions per place. [2025-02-06 13:09:15,679 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 32 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-02-06 13:09:15,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 174 flow [2025-02-06 13:09:15,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-02-06 13:09:15,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4744897959183674 [2025-02-06 13:09:15,681 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 94 flow. Second operand 4 states and 93 transitions. [2025-02-06 13:09:15,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 174 flow [2025-02-06 13:09:15,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:15,683 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 117 flow [2025-02-06 13:09:15,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-02-06 13:09:15,683 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2025-02-06 13:09:15,684 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 117 flow [2025-02-06 13:09:15,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 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,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:15,684 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 13:09:15,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:09:15,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:09:15,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash 432072171, now seen corresponding path program 1 times [2025-02-06 13:09:15,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:15,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104895249] [2025-02-06 13:09:15,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:15,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:15,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:09:15,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:09:15,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:15,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:16,000 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:16,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:16,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104895249] [2025-02-06 13:09:16,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104895249] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:16,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910957191] [2025-02-06 13:09:16,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:16,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:16,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:16,004 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:16,005 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:16,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:09:16,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:09:16,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:16,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:16,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 13:09:16,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:16,115 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 10 treesize of output 9 [2025-02-06 13:09:16,283 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:16,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:16,367 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:16,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910957191] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:16,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:16,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-06 13:09:16,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860479042] [2025-02-06 13:09:16,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:16,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:09:16,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:16,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:09:16,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:09:16,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-02-06 13:09:16,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 117 flow. Second operand has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 0 states have call successors, (0), 0 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,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:16,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-02-06 13:09:16,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:16,835 INFO L124 PetriNetUnfolderBase]: 1150/1874 cut-off events. [2025-02-06 13:09:16,835 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-06 13:09:16,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3679 conditions, 1874 events. 1150/1874 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10330 event pairs, 1014 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 3648. Up to 1708 conditions per place. [2025-02-06 13:09:16,847 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 28 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2025-02-06 13:09:16,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 201 flow [2025-02-06 13:09:16,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:09:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:09:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2025-02-06 13:09:16,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3877551020408163 [2025-02-06 13:09:16,850 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 117 flow. Second operand 8 states and 152 transitions. [2025-02-06 13:09:16,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 201 flow [2025-02-06 13:09:16,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:09:16,852 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 142 flow [2025-02-06 13:09:16,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=142, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2025-02-06 13:09:16,853 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2025-02-06 13:09:16,853 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 142 flow [2025-02-06 13:09:16,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 0 states have call successors, (0), 0 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,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:16,854 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 13:09:16,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 13:09:17,054 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:17,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:09:17,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:17,056 INFO L85 PathProgramCache]: Analyzing trace with hash 512494175, now seen corresponding path program 1 times [2025-02-06 13:09:17,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:17,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316018970] [2025-02-06 13:09:17,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:17,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:17,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:09:17,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:09:17,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:17,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:17,158 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:17,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:17,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316018970] [2025-02-06 13:09:17,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316018970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:17,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:17,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:09:17,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485619436] [2025-02-06 13:09:17,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:17,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:09:17,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:17,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:09:17,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:09:17,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-02-06 13:09:17,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 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,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:17,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-02-06 13:09:17,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:17,402 INFO L124 PetriNetUnfolderBase]: 1270/2088 cut-off events. [2025-02-06 13:09:17,402 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-06 13:09:17,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4115 conditions, 2088 events. 1270/2088 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11534 event pairs, 1101 based on Foata normal form. 62/1773 useless extension candidates. Maximal degree in co-relation 3649. Up to 1712 conditions per place. [2025-02-06 13:09:17,415 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 35 selfloop transitions, 2 changer transitions 15/61 dead transitions. [2025-02-06 13:09:17,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 277 flow [2025-02-06 13:09:17,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-02-06 13:09:17,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2025-02-06 13:09:17,417 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 142 flow. Second operand 4 states and 116 transitions. [2025-02-06 13:09:17,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 277 flow [2025-02-06 13:09:17,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 235 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-02-06 13:09:17,418 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 116 flow [2025-02-06 13:09:17,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2025-02-06 13:09:17,419 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2025-02-06 13:09:17,419 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 116 flow [2025-02-06 13:09:17,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 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,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:17,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:17,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:09:17,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:09:17,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash -151339060, now seen corresponding path program 1 times [2025-02-06 13:09:17,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:17,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057709066] [2025-02-06 13:09:17,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:17,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:17,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:09:17,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:09:17,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:17,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:17,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:17,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057709066] [2025-02-06 13:09:17,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057709066] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:17,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198389864] [2025-02-06 13:09:17,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:17,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:17,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:17,669 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:17,673 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:17,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:09:17,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:09:17,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:17,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:17,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 13:09:17,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:17,736 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:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:17,797 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:09:17,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198389864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:17,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:09:17,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-02-06 13:09:17,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999378846] [2025-02-06 13:09:17,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:17,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:09:17,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:17,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:09:17,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:09:17,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-02-06 13:09:17,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 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,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:17,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-02-06 13:09:17,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:18,111 INFO L124 PetriNetUnfolderBase]: 887/1466 cut-off events. [2025-02-06 13:09:18,111 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-02-06 13:09:18,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3195 conditions, 1466 events. 887/1466 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7784 event pairs, 768 based on Foata normal form. 0/1240 useless extension candidates. Maximal degree in co-relation 3183. Up to 1319 conditions per place. [2025-02-06 13:09:18,129 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 32 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-02-06 13:09:18,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 178 flow [2025-02-06 13:09:18,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-02-06 13:09:18,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2025-02-06 13:09:18,131 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 116 flow. Second operand 4 states and 92 transitions. [2025-02-06 13:09:18,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 178 flow [2025-02-06 13:09:18,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:18,132 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 110 flow [2025-02-06 13:09:18,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-02-06 13:09:18,132 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2025-02-06 13:09:18,132 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 110 flow [2025-02-06 13:09:18,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 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,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:18,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:18,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:09:18,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:18,341 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:09:18,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:18,341 INFO L85 PathProgramCache]: Analyzing trace with hash -151339061, now seen corresponding path program 1 times [2025-02-06 13:09:18,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:18,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399393467] [2025-02-06 13:09:18,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:18,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:18,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:09:18,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:09:18,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:18,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:18,384 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:18,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:18,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399393467] [2025-02-06 13:09:18,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399393467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:18,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:18,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:09:18,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640906841] [2025-02-06 13:09:18,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:18,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:09:18,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:18,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:09:18,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:09:18,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2025-02-06 13:09:18,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 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,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:18,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2025-02-06 13:09:18,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:18,528 INFO L124 PetriNetUnfolderBase]: 852/1381 cut-off events. [2025-02-06 13:09:18,528 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2025-02-06 13:09:18,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2897 conditions, 1381 events. 852/1381 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6588 event pairs, 724 based on Foata normal form. 0/1367 useless extension candidates. Maximal degree in co-relation 2872. Up to 1254 conditions per place. [2025-02-06 13:09:18,533 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 31 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2025-02-06 13:09:18,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 166 flow [2025-02-06 13:09:18,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-02-06 13:09:18,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-02-06 13:09:18,536 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 110 flow. Second operand 4 states and 77 transitions. [2025-02-06 13:09:18,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 166 flow [2025-02-06 13:09:18,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:18,538 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 100 flow [2025-02-06 13:09:18,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-02-06 13:09:18,539 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2025-02-06 13:09:18,540 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 100 flow [2025-02-06 13:09:18,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 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,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:18,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:18,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:09:18,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:09:18,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:18,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1206894838, now seen corresponding path program 1 times [2025-02-06 13:09:18,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:18,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330689154] [2025-02-06 13:09:18,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:18,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:18,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:09:18,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:09:18,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:18,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:09:18,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:18,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330689154] [2025-02-06 13:09:18,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330689154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:18,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:18,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:09:18,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976882609] [2025-02-06 13:09:18,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:18,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:09:18,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:18,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:09:18,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:09:18,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-02-06 13:09:18,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:18,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:18,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-02-06 13:09:18,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:18,681 INFO L124 PetriNetUnfolderBase]: 467/875 cut-off events. [2025-02-06 13:09:18,681 INFO L125 PetriNetUnfolderBase]: For 115/122 co-relation queries the response was YES. [2025-02-06 13:09:18,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 875 events. 467/875 cut-off events. For 115/122 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4395 event pairs, 171 based on Foata normal form. 28/852 useless extension candidates. Maximal degree in co-relation 1749. Up to 532 conditions per place. [2025-02-06 13:09:18,685 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 45 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-02-06 13:09:18,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 232 flow [2025-02-06 13:09:18,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:09:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:09:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-02-06 13:09:18,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2025-02-06 13:09:18,687 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 100 flow. Second operand 3 states and 89 transitions. [2025-02-06 13:09:18,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 232 flow [2025-02-06 13:09:18,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:18,688 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 119 flow [2025-02-06 13:09:18,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2025-02-06 13:09:18,689 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2025-02-06 13:09:18,689 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 119 flow [2025-02-06 13:09:18,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:18,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:18,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:18,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:09:18,690 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:09:18,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2006455088, now seen corresponding path program 1 times [2025-02-06 13:09:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:18,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556513232] [2025-02-06 13:09:18,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:18,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:18,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:09:18,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:09:18,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:18,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:19,029 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:19,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:19,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556513232] [2025-02-06 13:09:19,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556513232] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:19,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116214797] [2025-02-06 13:09:19,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:19,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:19,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:19,032 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:19,040 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:19,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:09:19,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:09:19,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:19,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:19,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:09:19,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:19,158 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:19,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:19,222 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:19,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116214797] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:19,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:19,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-02-06 13:09:19,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997761521] [2025-02-06 13:09:19,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:19,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:09:19,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:19,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:09:19,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:09:19,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-02-06 13:09:19,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 119 flow. Second operand has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 0 states have call successors, (0), 0 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,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:19,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-02-06 13:09:19,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:19,830 INFO L124 PetriNetUnfolderBase]: 834/1401 cut-off events. [2025-02-06 13:09:19,830 INFO L125 PetriNetUnfolderBase]: For 461/474 co-relation queries the response was YES. [2025-02-06 13:09:19,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3228 conditions, 1401 events. 834/1401 cut-off events. For 461/474 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6673 event pairs, 194 based on Foata normal form. 53/1447 useless extension candidates. Maximal degree in co-relation 2132. Up to 434 conditions per place. [2025-02-06 13:09:19,836 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 54 selfloop transitions, 9 changer transitions 36/104 dead transitions. [2025-02-06 13:09:19,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 104 transitions, 478 flow [2025-02-06 13:09:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 13:09:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 13:09:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 244 transitions. [2025-02-06 13:09:19,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45269016697588127 [2025-02-06 13:09:19,838 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 119 flow. Second operand 11 states and 244 transitions. [2025-02-06 13:09:19,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 104 transitions, 478 flow [2025-02-06 13:09:19,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 104 transitions, 451 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:19,841 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 118 flow [2025-02-06 13:09:19,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=118, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2025-02-06 13:09:19,841 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2025-02-06 13:09:19,841 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 118 flow [2025-02-06 13:09:19,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 0 states have call successors, (0), 0 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,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:19,842 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:19,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 13:09:20,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:20,046 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:09:20,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash 974841237, now seen corresponding path program 1 times [2025-02-06 13:09:20,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:20,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897309505] [2025-02-06 13:09:20,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:20,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:20,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:09:20,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:09:20,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:20,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 13:09:20,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:20,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897309505] [2025-02-06 13:09:20,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897309505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:20,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:20,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:09:20,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018324244] [2025-02-06 13:09:20,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:20,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:09:20,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:20,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:09:20,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:09:20,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-02-06 13:09:20,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:20,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:20,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-02-06 13:09:20,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:20,201 INFO L124 PetriNetUnfolderBase]: 304/540 cut-off events. [2025-02-06 13:09:20,201 INFO L125 PetriNetUnfolderBase]: For 183/187 co-relation queries the response was YES. [2025-02-06 13:09:20,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 540 events. 304/540 cut-off events. For 183/187 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2155 event pairs, 99 based on Foata normal form. 39/573 useless extension candidates. Maximal degree in co-relation 1172. Up to 201 conditions per place. [2025-02-06 13:09:20,205 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 48 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2025-02-06 13:09:20,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 266 flow [2025-02-06 13:09:20,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-02-06 13:09:20,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5612244897959183 [2025-02-06 13:09:20,206 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 118 flow. Second operand 4 states and 110 transitions. [2025-02-06 13:09:20,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 266 flow [2025-02-06 13:09:20,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 252 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:09:20,208 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 120 flow [2025-02-06 13:09:20,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2025-02-06 13:09:20,209 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2025-02-06 13:09:20,209 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 120 flow [2025-02-06 13:09:20,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:20,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:20,209 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:20,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:09:20,209 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:09:20,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:20,210 INFO L85 PathProgramCache]: Analyzing trace with hash -901612292, now seen corresponding path program 1 times [2025-02-06 13:09:20,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:20,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908370131] [2025-02-06 13:09:20,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:20,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:20,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:09:20,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:09:20,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:20,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 13:09:20,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:20,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908370131] [2025-02-06 13:09:20,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908370131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:20,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:20,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:09:20,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259168034] [2025-02-06 13:09:20,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:20,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:09:20,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:20,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:09:20,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:09:20,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-02-06 13:09:20,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 120 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 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:20,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:20,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-02-06 13:09:20,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:20,439 INFO L124 PetriNetUnfolderBase]: 320/547 cut-off events. [2025-02-06 13:09:20,439 INFO L125 PetriNetUnfolderBase]: For 245/252 co-relation queries the response was YES. [2025-02-06 13:09:20,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 547 events. 320/547 cut-off events. For 245/252 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2083 event pairs, 93 based on Foata normal form. 6/547 useless extension candidates. Maximal degree in co-relation 1285. Up to 201 conditions per place. [2025-02-06 13:09:20,442 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 53 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2025-02-06 13:09:20,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 290 flow [2025-02-06 13:09:20,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:09:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:09:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2025-02-06 13:09:20,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43537414965986393 [2025-02-06 13:09:20,443 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 120 flow. Second operand 6 states and 128 transitions. [2025-02-06 13:09:20,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 290 flow [2025-02-06 13:09:20,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 63 transitions, 280 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:20,444 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 120 flow [2025-02-06 13:09:20,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-02-06 13:09:20,445 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2025-02-06 13:09:20,445 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 120 flow [2025-02-06 13:09:20,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 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:20,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:20,445 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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:20,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:09:20,445 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:09:20,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:20,446 INFO L85 PathProgramCache]: Analyzing trace with hash 452522556, now seen corresponding path program 1 times [2025-02-06 13:09:20,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:20,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815177747] [2025-02-06 13:09:20,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:20,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:20,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:09:20,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:09:20,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:20,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:22,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:22,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815177747] [2025-02-06 13:09:22,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815177747] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:22,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823646507] [2025-02-06 13:09:22,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:22,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:22,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:22,223 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:22,225 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:22,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:09:22,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:09:22,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:22,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:22,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 13:09:22,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:22,378 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 23 treesize of output 1 [2025-02-06 13:09:22,824 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-02-06 13:09:22,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 34 [2025-02-06 13:09:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:22,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:23,601 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 81 treesize of output 73 [2025-02-06 13:09:23,655 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-02-06 13:09:23,656 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 136 treesize of output 134 [2025-02-06 13:09:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:24,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823646507] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:24,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:24,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2025-02-06 13:09:24,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254620145] [2025-02-06 13:09:24,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:24,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 13:09:24,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:24,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 13:09:25,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 13:09:26,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-02-06 13:09:26,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 120 flow. Second operand has 34 states, 34 states have (on average 16.38235294117647) internal successors, (557), 34 states have internal predecessors, (557), 0 states have call successors, (0), 0 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:26,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:26,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-02-06 13:09:26,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:30,539 INFO L124 PetriNetUnfolderBase]: 1188/2070 cut-off events. [2025-02-06 13:09:30,539 INFO L125 PetriNetUnfolderBase]: For 1011/1011 co-relation queries the response was YES. [2025-02-06 13:09:30,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5071 conditions, 2070 events. 1188/2070 cut-off events. For 1011/1011 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11185 event pairs, 416 based on Foata normal form. 1/2065 useless extension candidates. Maximal degree in co-relation 3716. Up to 521 conditions per place. [2025-02-06 13:09:30,553 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 146 selfloop transitions, 35 changer transitions 23/208 dead transitions. [2025-02-06 13:09:30,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 208 transitions, 1024 flow [2025-02-06 13:09:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 13:09:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-06 13:09:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 539 transitions. [2025-02-06 13:09:30,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-02-06 13:09:30,556 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 120 flow. Second operand 24 states and 539 transitions. [2025-02-06 13:09:30,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 208 transitions, 1024 flow [2025-02-06 13:09:30,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 208 transitions, 960 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-06 13:09:30,560 INFO L231 Difference]: Finished difference. Result has 84 places, 69 transitions, 382 flow [2025-02-06 13:09:30,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=382, PETRI_PLACES=84, PETRI_TRANSITIONS=69} [2025-02-06 13:09:30,560 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 32 predicate places. [2025-02-06 13:09:30,560 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 69 transitions, 382 flow [2025-02-06 13:09:30,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 16.38235294117647) internal successors, (557), 34 states have internal predecessors, (557), 0 states have call successors, (0), 0 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:30,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:30,561 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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:30,567 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:30,765 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,SelfDestructingSolverStorable10 [2025-02-06 13:09:30,765 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:09:30,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:30,766 INFO L85 PathProgramCache]: Analyzing trace with hash 349636158, now seen corresponding path program 2 times [2025-02-06 13:09:30,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:30,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111920634] [2025-02-06 13:09:30,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:30,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:30,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-06 13:09:30,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 29 statements. [2025-02-06 13:09:30,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:09:30,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:09:31,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:31,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111920634] [2025-02-06 13:09:31,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111920634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:31,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:31,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 13:09:31,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588730744] [2025-02-06 13:09:31,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:31,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:09:31,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:31,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:09:31,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:09:31,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-02-06 13:09:31,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 69 transitions, 382 flow. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 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:31,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:31,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-02-06 13:09:31,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:32,045 INFO L124 PetriNetUnfolderBase]: 2183/3834 cut-off events. [2025-02-06 13:09:32,045 INFO L125 PetriNetUnfolderBase]: For 5431/5436 co-relation queries the response was YES. [2025-02-06 13:09:32,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11166 conditions, 3834 events. 2183/3834 cut-off events. For 5431/5436 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 23535 event pairs, 877 based on Foata normal form. 5/3838 useless extension candidates. Maximal degree in co-relation 11112. Up to 1598 conditions per place. [2025-02-06 13:09:32,060 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 105 selfloop transitions, 32 changer transitions 35/176 dead transitions. [2025-02-06 13:09:32,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 176 transitions, 1223 flow [2025-02-06 13:09:32,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:09:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 13:09:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions. [2025-02-06 13:09:32,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2025-02-06 13:09:32,062 INFO L175 Difference]: Start difference. First operand has 84 places, 69 transitions, 382 flow. Second operand 10 states and 254 transitions. [2025-02-06 13:09:32,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 176 transitions, 1223 flow [2025-02-06 13:09:32,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 176 transitions, 1179 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-02-06 13:09:32,077 INFO L231 Difference]: Finished difference. Result has 91 places, 94 transitions, 719 flow [2025-02-06 13:09:32,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=719, PETRI_PLACES=91, PETRI_TRANSITIONS=94} [2025-02-06 13:09:32,077 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 39 predicate places. [2025-02-06 13:09:32,077 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 94 transitions, 719 flow [2025-02-06 13:09:32,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 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:32,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:32,078 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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:32,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:09:32,078 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:09:32,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:32,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1190196566, now seen corresponding path program 3 times [2025-02-06 13:09:32,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:32,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193188272] [2025-02-06 13:09:32,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:09:32,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:32,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-02-06 13:09:32,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 29 statements. [2025-02-06 13:09:32,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 13:09:32,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:09:32,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:32,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193188272] [2025-02-06 13:09:32,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193188272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:32,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:32,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 13:09:32,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501465398] [2025-02-06 13:09:32,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:32,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:09:32,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:32,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:09:32,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:09:32,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-02-06 13:09:32,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 94 transitions, 719 flow. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 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:32,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:32,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-02-06 13:09:32,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:33,136 INFO L124 PetriNetUnfolderBase]: 3079/5437 cut-off events. [2025-02-06 13:09:33,137 INFO L125 PetriNetUnfolderBase]: For 13897/13905 co-relation queries the response was YES. [2025-02-06 13:09:33,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17474 conditions, 5437 events. 3079/5437 cut-off events. For 13897/13905 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 35304 event pairs, 1574 based on Foata normal form. 2/5435 useless extension candidates. Maximal degree in co-relation 17382. Up to 2699 conditions per place. [2025-02-06 13:09:33,159 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 119 selfloop transitions, 35 changer transitions 30/188 dead transitions. [2025-02-06 13:09:33,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 188 transitions, 1584 flow [2025-02-06 13:09:33,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:09:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:09:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2025-02-06 13:09:33,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-02-06 13:09:33,167 INFO L175 Difference]: Start difference. First operand has 91 places, 94 transitions, 719 flow. Second operand 9 states and 231 transitions. [2025-02-06 13:09:33,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 188 transitions, 1584 flow [2025-02-06 13:09:33,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 188 transitions, 1520 flow, removed 32 selfloop flow, removed 4 redundant places. [2025-02-06 13:09:33,211 INFO L231 Difference]: Finished difference. Result has 98 places, 109 transitions, 1002 flow [2025-02-06 13:09:33,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1002, PETRI_PLACES=98, PETRI_TRANSITIONS=109} [2025-02-06 13:09:33,212 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 46 predicate places. [2025-02-06 13:09:33,212 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 109 transitions, 1002 flow [2025-02-06 13:09:33,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 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:33,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:33,212 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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:33,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:09:33,212 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:09:33,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:33,213 INFO L85 PathProgramCache]: Analyzing trace with hash 417093862, now seen corresponding path program 4 times [2025-02-06 13:09:33,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:33,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462197062] [2025-02-06 13:09:33,213 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:09:33,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:33,221 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-02-06 13:09:33,253 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:09:33,254 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:09:33,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:34,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:34,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462197062] [2025-02-06 13:09:34,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462197062] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:34,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248950226] [2025-02-06 13:09:34,096 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:09:34,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:34,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:34,100 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:34,106 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:34,150 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-02-06 13:09:34,171 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:09:34,172 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:09:34,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:34,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 13:09:34,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:34,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:34,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:09:34,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 60 [2025-02-06 13:09:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:35,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248950226] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:35,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:35,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-02-06 13:09:35,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752709449] [2025-02-06 13:09:35,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:35,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 13:09:35,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:35,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 13:09:35,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 13:09:35,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-02-06 13:09:35,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 109 transitions, 1002 flow. Second operand has 34 states, 34 states have (on average 16.38235294117647) internal successors, (557), 34 states have internal predecessors, (557), 0 states have call successors, (0), 0 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:35,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:35,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-02-06 13:09:35,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:37,290 INFO L124 PetriNetUnfolderBase]: 2939/5184 cut-off events. [2025-02-06 13:09:37,290 INFO L125 PetriNetUnfolderBase]: For 17408/17416 co-relation queries the response was YES. [2025-02-06 13:09:37,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17589 conditions, 5184 events. 2939/5184 cut-off events. For 17408/17416 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 33192 event pairs, 810 based on Foata normal form. 2/5182 useless extension candidates. Maximal degree in co-relation 17501. Up to 2751 conditions per place. [2025-02-06 13:09:37,315 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 140 selfloop transitions, 48 changer transitions 56/248 dead transitions. [2025-02-06 13:09:37,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 248 transitions, 2085 flow [2025-02-06 13:09:37,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 13:09:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 13:09:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 484 transitions. [2025-02-06 13:09:37,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4703595724003887 [2025-02-06 13:09:37,321 INFO L175 Difference]: Start difference. First operand has 98 places, 109 transitions, 1002 flow. Second operand 21 states and 484 transitions. [2025-02-06 13:09:37,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 248 transitions, 2085 flow [2025-02-06 13:09:37,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 248 transitions, 2019 flow, removed 22 selfloop flow, removed 5 redundant places. [2025-02-06 13:09:37,386 INFO L231 Difference]: Finished difference. Result has 120 places, 117 transitions, 1211 flow [2025-02-06 13:09:37,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1211, PETRI_PLACES=120, PETRI_TRANSITIONS=117} [2025-02-06 13:09:37,388 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 68 predicate places. [2025-02-06 13:09:37,388 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 117 transitions, 1211 flow [2025-02-06 13:09:37,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 16.38235294117647) internal successors, (557), 34 states have internal predecessors, (557), 0 states have call successors, (0), 0 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:37,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:37,389 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 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:37,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 13:09:37,593 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,SelfDestructingSolverStorable13 [2025-02-06 13:09:37,593 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:09:37,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:37,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2114186275, now seen corresponding path program 5 times [2025-02-06 13:09:37,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:37,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267004906] [2025-02-06 13:09:37,595 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:09:37,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:37,603 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 5 equivalence classes. [2025-02-06 13:09:37,649 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:09:37,649 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 13:09:37,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:38,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:38,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267004906] [2025-02-06 13:09:38,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267004906] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:38,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730767718] [2025-02-06 13:09:38,926 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:09:38,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:38,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:38,928 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:38,932 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:38,975 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 5 equivalence classes. [2025-02-06 13:09:39,030 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:09:39,030 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 13:09:39,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:39,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-06 13:09:39,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:39,095 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:39,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-02-06 13:09:39,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:09:39,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 31 [2025-02-06 13:09:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:39,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:53,454 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 146 treesize of output 138 [2025-02-06 13:09:53,519 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-02-06 13:09:53,519 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 41970 treesize of output 38541 [2025-02-06 13:09:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:54,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730767718] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:54,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:54,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 41 [2025-02-06 13:09:54,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555727071] [2025-02-06 13:09:54,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:54,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-06 13:09:54,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:54,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-06 13:09:54,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1458, Unknown=3, NotChecked=0, Total=1722 [2025-02-06 13:09:58,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:10:03,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:10:07,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:10:11,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:10:16,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:10:20,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:10:20,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 49 [2025-02-06 13:10:20,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 117 transitions, 1211 flow. Second operand has 42 states, 42 states have (on average 10.071428571428571) internal successors, (423), 42 states have internal predecessors, (423), 0 states have call successors, (0), 0 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:20,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:10:20,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 49 [2025-02-06 13:10:20,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:10:29,196 INFO L124 PetriNetUnfolderBase]: 4909/8486 cut-off events. [2025-02-06 13:10:29,197 INFO L125 PetriNetUnfolderBase]: For 40396/40404 co-relation queries the response was YES. [2025-02-06 13:10:29,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32199 conditions, 8486 events. 4909/8486 cut-off events. For 40396/40404 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 57188 event pairs, 1191 based on Foata normal form. 2/8484 useless extension candidates. Maximal degree in co-relation 32084. Up to 3268 conditions per place. [2025-02-06 13:10:29,244 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 231 selfloop transitions, 127 changer transitions 57/419 dead transitions. [2025-02-06 13:10:29,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 419 transitions, 4036 flow [2025-02-06 13:10:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-06 13:10:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-02-06 13:10:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 578 transitions. [2025-02-06 13:10:29,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33702623906705537 [2025-02-06 13:10:29,246 INFO L175 Difference]: Start difference. First operand has 120 places, 117 transitions, 1211 flow. Second operand 35 states and 578 transitions. [2025-02-06 13:10:29,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 419 transitions, 4036 flow [2025-02-06 13:10:29,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 419 transitions, 3725 flow, removed 140 selfloop flow, removed 14 redundant places. [2025-02-06 13:10:29,409 INFO L231 Difference]: Finished difference. Result has 148 places, 201 transitions, 2547 flow [2025-02-06 13:10:29,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2547, PETRI_PLACES=148, PETRI_TRANSITIONS=201} [2025-02-06 13:10:29,409 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 96 predicate places. [2025-02-06 13:10:29,410 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 201 transitions, 2547 flow [2025-02-06 13:10:29,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 10.071428571428571) internal successors, (423), 42 states have internal predecessors, (423), 0 states have call successors, (0), 0 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:29,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:10:29,410 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1] [2025-02-06 13:10:29,418 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:10:29,611 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,SelfDestructingSolverStorable14 [2025-02-06 13:10:29,611 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:10:29,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:10:29,612 INFO L85 PathProgramCache]: Analyzing trace with hash -25009309, now seen corresponding path program 1 times [2025-02-06 13:10:29,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:10:29,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875312389] [2025-02-06 13:10:29,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:10:29,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:10:29,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 13:10:29,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:10:29,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:10:29,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:10:29,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:10:29,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875312389] [2025-02-06 13:10:29,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875312389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:10:29,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:10:29,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:10:29,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662790227] [2025-02-06 13:10:29,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:10:29,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:10:29,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:10:29,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:10:29,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:10:29,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-02-06 13:10:29,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 201 transitions, 2547 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:29,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:10:29,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-02-06 13:10:29,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:10:30,761 INFO L124 PetriNetUnfolderBase]: 7240/11824 cut-off events. [2025-02-06 13:10:30,761 INFO L125 PetriNetUnfolderBase]: For 60819/60821 co-relation queries the response was YES. [2025-02-06 13:10:30,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45387 conditions, 11824 events. 7240/11824 cut-off events. For 60819/60821 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 78377 event pairs, 4056 based on Foata normal form. 1/10594 useless extension candidates. Maximal degree in co-relation 45264. Up to 8586 conditions per place. [2025-02-06 13:10:30,827 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 267 selfloop transitions, 26 changer transitions 10/306 dead transitions. [2025-02-06 13:10:30,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 306 transitions, 4301 flow [2025-02-06 13:10:30,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:10:30,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:10:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-02-06 13:10:30,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-02-06 13:10:30,828 INFO L175 Difference]: Start difference. First operand has 148 places, 201 transitions, 2547 flow. Second operand 5 states and 134 transitions. [2025-02-06 13:10:30,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 306 transitions, 4301 flow [2025-02-06 13:10:31,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 306 transitions, 4169 flow, removed 59 selfloop flow, removed 14 redundant places. [2025-02-06 13:10:31,129 INFO L231 Difference]: Finished difference. Result has 133 places, 213 transitions, 2616 flow [2025-02-06 13:10:31,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2419, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2616, PETRI_PLACES=133, PETRI_TRANSITIONS=213} [2025-02-06 13:10:31,130 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 81 predicate places. [2025-02-06 13:10:31,130 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 213 transitions, 2616 flow [2025-02-06 13:10:31,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:31,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:10:31,130 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1] [2025-02-06 13:10:31,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 13:10:31,130 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:10:31,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:10:31,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1964304271, now seen corresponding path program 2 times [2025-02-06 13:10:31,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:10:31,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911373916] [2025-02-06 13:10:31,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:10:31,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:10:31,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-06 13:10:31,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:10:31,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:10:31,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:10:31,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:10:31,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911373916] [2025-02-06 13:10:31,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911373916] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:10:31,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035962910] [2025-02-06 13:10:31,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:10:31,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:31,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:10:31,251 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:10:31,252 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:10:31,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-06 13:10:31,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:10:31,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:10:31,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:31,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:10:31,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:10:31,349 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:10:31,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:10:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:10:31,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035962910] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:10:31,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:10:31,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 5] total 10 [2025-02-06 13:10:31,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567623275] [2025-02-06 13:10:31,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:10:31,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:10:31,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:10:31,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:10:31,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:10:31,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-02-06 13:10:31,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 213 transitions, 2616 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:31,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:10:31,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-02-06 13:10:31,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:10:32,442 INFO L124 PetriNetUnfolderBase]: 7433/12120 cut-off events. [2025-02-06 13:10:32,442 INFO L125 PetriNetUnfolderBase]: For 62753/62755 co-relation queries the response was YES. [2025-02-06 13:10:32,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50282 conditions, 12120 events. 7433/12120 cut-off events. For 62753/62755 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 79692 event pairs, 1588 based on Foata normal form. 108/12228 useless extension candidates. Maximal degree in co-relation 48959. Up to 6405 conditions per place. [2025-02-06 13:10:32,492 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 296 selfloop transitions, 16 changer transitions 0/315 dead transitions. [2025-02-06 13:10:32,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 315 transitions, 4514 flow [2025-02-06 13:10:32,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:10:32,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:10:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-02-06 13:10:32,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2025-02-06 13:10:32,493 INFO L175 Difference]: Start difference. First operand has 133 places, 213 transitions, 2616 flow. Second operand 4 states and 116 transitions. [2025-02-06 13:10:32,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 315 transitions, 4514 flow [2025-02-06 13:10:32,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 315 transitions, 4508 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-06 13:10:32,719 INFO L231 Difference]: Finished difference. Result has 139 places, 218 transitions, 2719 flow [2025-02-06 13:10:32,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2610, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2719, PETRI_PLACES=139, PETRI_TRANSITIONS=218} [2025-02-06 13:10:32,720 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 87 predicate places. [2025-02-06 13:10:32,720 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 218 transitions, 2719 flow [2025-02-06 13:10:32,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:32,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:10:32,720 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1] [2025-02-06 13:10:32,726 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:10:32,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:32,921 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:10:32,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:10:32,922 INFO L85 PathProgramCache]: Analyzing trace with hash 812685529, now seen corresponding path program 3 times [2025-02-06 13:10:32,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:10:32,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632085897] [2025-02-06 13:10:32,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:10:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:10:32,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-02-06 13:10:32,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 32 statements. [2025-02-06 13:10:32,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 13:10:32,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:10:33,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:10:33,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632085897] [2025-02-06 13:10:33,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632085897] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:10:33,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166833925] [2025-02-06 13:10:33,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:10:33,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:33,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:10:33,026 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:10:33,027 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:10:33,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-02-06 13:10:33,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 32 statements. [2025-02-06 13:10:33,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 13:10:33,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:33,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:10:33,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:10:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:10:33,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:10:33,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166833925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:10:33,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:10:33,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-02-06 13:10:33,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120978652] [2025-02-06 13:10:33,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:10:33,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:10:33,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:10:33,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:10:33,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:10:33,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-02-06 13:10:33,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 218 transitions, 2719 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:33,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:10:33,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-02-06 13:10:33,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:10:34,358 INFO L124 PetriNetUnfolderBase]: 7649/12484 cut-off events. [2025-02-06 13:10:34,359 INFO L125 PetriNetUnfolderBase]: For 72372/72374 co-relation queries the response was YES. [2025-02-06 13:10:34,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55495 conditions, 12484 events. 7649/12484 cut-off events. For 72372/72374 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 82799 event pairs, 4083 based on Foata normal form. 45/12529 useless extension candidates. Maximal degree in co-relation 54145. Up to 8990 conditions per place. [2025-02-06 13:10:34,522 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 252 selfloop transitions, 35 changer transitions 10/300 dead transitions. [2025-02-06 13:10:34,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 300 transitions, 4232 flow [2025-02-06 13:10:34,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:10:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:10:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-02-06 13:10:34,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-02-06 13:10:34,523 INFO L175 Difference]: Start difference. First operand has 139 places, 218 transitions, 2719 flow. Second operand 5 states and 131 transitions. [2025-02-06 13:10:34,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 300 transitions, 4232 flow [2025-02-06 13:10:34,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 300 transitions, 4226 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-06 13:10:34,858 INFO L231 Difference]: Finished difference. Result has 146 places, 229 transitions, 2951 flow [2025-02-06 13:10:34,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2717, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2951, PETRI_PLACES=146, PETRI_TRANSITIONS=229} [2025-02-06 13:10:34,859 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 94 predicate places. [2025-02-06 13:10:34,859 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 229 transitions, 2951 flow [2025-02-06 13:10:34,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:34,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:10:34,859 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1] [2025-02-06 13:10:34,865 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:10:35,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 13:10:35,060 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:10:35,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:10:35,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1110763376, now seen corresponding path program 1 times [2025-02-06 13:10:35,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:10:35,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155636600] [2025-02-06 13:10:35,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:10:35,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:10:35,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 13:10:35,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:10:35,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:10:35,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:10:35,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:10:35,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155636600] [2025-02-06 13:10:35,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155636600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:10:35,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:10:35,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:10:35,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073072882] [2025-02-06 13:10:35,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:10:35,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:10:35,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:10:35,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:10:35,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:10:35,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-02-06 13:10:35,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 229 transitions, 2951 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 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,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:10:35,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-02-06 13:10:35,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:10:36,519 INFO L124 PetriNetUnfolderBase]: 7930/13004 cut-off events. [2025-02-06 13:10:36,519 INFO L125 PetriNetUnfolderBase]: For 85223/85227 co-relation queries the response was YES. [2025-02-06 13:10:36,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60898 conditions, 13004 events. 7930/13004 cut-off events. For 85223/85227 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 86758 event pairs, 3633 based on Foata normal form. 229/13233 useless extension candidates. Maximal degree in co-relation 59472. Up to 8671 conditions per place. [2025-02-06 13:10:36,588 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 270 selfloop transitions, 45 changer transitions 14/332 dead transitions. [2025-02-06 13:10:36,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 332 transitions, 4978 flow [2025-02-06 13:10:36,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:10:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:10:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2025-02-06 13:10:36,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5387755102040817 [2025-02-06 13:10:36,590 INFO L175 Difference]: Start difference. First operand has 146 places, 229 transitions, 2951 flow. Second operand 5 states and 132 transitions. [2025-02-06 13:10:36,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 332 transitions, 4978 flow [2025-02-06 13:10:36,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 332 transitions, 4929 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-06 13:10:36,879 INFO L231 Difference]: Finished difference. Result has 150 places, 235 transitions, 3207 flow [2025-02-06 13:10:36,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2859, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3207, PETRI_PLACES=150, PETRI_TRANSITIONS=235} [2025-02-06 13:10:36,880 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 98 predicate places. [2025-02-06 13:10:36,880 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 235 transitions, 3207 flow [2025-02-06 13:10:36,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:36,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:10:36,880 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1] [2025-02-06 13:10:36,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 13:10:36,880 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:10:36,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:10:36,881 INFO L85 PathProgramCache]: Analyzing trace with hash -234579120, now seen corresponding path program 2 times [2025-02-06 13:10:36,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:10:36,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136873959] [2025-02-06 13:10:36,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:10:36,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:10:36,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-06 13:10:36,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:10:36,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:10:36,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:10:36,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:10:36,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136873959] [2025-02-06 13:10:36,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136873959] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:10:36,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824407986] [2025-02-06 13:10:36,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:10:36,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:36,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:10:36,997 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:10:36,998 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:10:37,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-06 13:10:37,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:10:37,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:10:37,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:37,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:10:37,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:10:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:10:37,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:10:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:10:37,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824407986] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:10:37,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:10:37,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 5] total 10 [2025-02-06 13:10:37,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424629805] [2025-02-06 13:10:37,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:10:37,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:10:37,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:10:37,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:10:37,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:10:37,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-02-06 13:10:37,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 235 transitions, 3207 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 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,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:10:37,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-02-06 13:10:37,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:10:38,273 INFO L124 PetriNetUnfolderBase]: 7898/12967 cut-off events. [2025-02-06 13:10:38,273 INFO L125 PetriNetUnfolderBase]: For 91446/91448 co-relation queries the response was YES. [2025-02-06 13:10:38,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63836 conditions, 12967 events. 7898/12967 cut-off events. For 91446/91448 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 86674 event pairs, 1578 based on Foata normal form. 113/13080 useless extension candidates. Maximal degree in co-relation 62708. Up to 6676 conditions per place. [2025-02-06 13:10:38,373 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 283 selfloop transitions, 28 changer transitions 0/314 dead transitions. [2025-02-06 13:10:38,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 314 transitions, 4841 flow [2025-02-06 13:10:38,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:10:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:10:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-02-06 13:10:38,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5969387755102041 [2025-02-06 13:10:38,375 INFO L175 Difference]: Start difference. First operand has 150 places, 235 transitions, 3207 flow. Second operand 4 states and 117 transitions. [2025-02-06 13:10:38,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 314 transitions, 4841 flow [2025-02-06 13:10:38,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 314 transitions, 4833 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-02-06 13:10:38,818 INFO L231 Difference]: Finished difference. Result has 153 places, 239 transitions, 3405 flow [2025-02-06 13:10:38,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3176, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3405, PETRI_PLACES=153, PETRI_TRANSITIONS=239} [2025-02-06 13:10:38,818 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 101 predicate places. [2025-02-06 13:10:38,819 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 239 transitions, 3405 flow [2025-02-06 13:10:38,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:38,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:10:38,819 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1] [2025-02-06 13:10:38,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 13:10:39,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:39,019 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:10:39,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:10:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2106728538, now seen corresponding path program 3 times [2025-02-06 13:10:39,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:10:39,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046247536] [2025-02-06 13:10:39,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:10:39,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:10:39,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-02-06 13:10:39,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 32 statements. [2025-02-06 13:10:39,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 13:10:39,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:10:39,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:10:39,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046247536] [2025-02-06 13:10:39,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046247536] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:10:39,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601540091] [2025-02-06 13:10:39,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:10:39,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:39,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:10:39,101 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:10:39,102 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:10:39,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-02-06 13:10:39,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 32 statements. [2025-02-06 13:10:39,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 13:10:39,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:39,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:10:39,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:10:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:10:39,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:10:39,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601540091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:10:39,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:10:39,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 13:10:39,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10230809] [2025-02-06 13:10:39,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:10:39,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:10:39,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:10:39,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:10:39,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:10:39,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-02-06 13:10:39,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 239 transitions, 3405 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:39,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:10:39,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-02-06 13:10:39,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:10:40,540 INFO L124 PetriNetUnfolderBase]: 6740/11017 cut-off events. [2025-02-06 13:10:40,541 INFO L125 PetriNetUnfolderBase]: For 94064/94064 co-relation queries the response was YES. [2025-02-06 13:10:40,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57644 conditions, 11017 events. 6740/11017 cut-off events. For 94064/94064 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 70480 event pairs, 2623 based on Foata normal form. 204/11221 useless extension candidates. Maximal degree in co-relation 57294. Up to 6030 conditions per place. [2025-02-06 13:10:40,614 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 199 selfloop transitions, 38 changer transitions 32/272 dead transitions. [2025-02-06 13:10:40,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 272 transitions, 4139 flow [2025-02-06 13:10:40,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:10:40,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:10:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-02-06 13:10:40,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2025-02-06 13:10:40,618 INFO L175 Difference]: Start difference. First operand has 153 places, 239 transitions, 3405 flow. Second operand 5 states and 137 transitions. [2025-02-06 13:10:40,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 272 transitions, 4139 flow [2025-02-06 13:10:40,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 272 transitions, 4092 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-02-06 13:10:40,920 INFO L231 Difference]: Finished difference. Result has 156 places, 195 transitions, 2736 flow [2025-02-06 13:10:40,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3042, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2736, PETRI_PLACES=156, PETRI_TRANSITIONS=195} [2025-02-06 13:10:40,921 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 104 predicate places. [2025-02-06 13:10:40,921 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 195 transitions, 2736 flow [2025-02-06 13:10:40,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:40,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:10:40,922 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1] [2025-02-06 13:10:40,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 13:10:41,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:41,122 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:10:41,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:10:41,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1384730931, now seen corresponding path program 4 times [2025-02-06 13:10:41,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:10:41,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643998677] [2025-02-06 13:10:41,123 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:10:41,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:10:41,128 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-06 13:10:41,133 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:10:41,133 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:10:41,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:10:41,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:10:41,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643998677] [2025-02-06 13:10:41,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643998677] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:10:41,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697642109] [2025-02-06 13:10:41,216 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:10:41,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:41,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:10:41,222 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:10:41,223 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:10:41,263 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-06 13:10:41,283 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:10:41,284 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:10:41,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:41,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:10:41,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:10:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:10:41,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:10:41,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697642109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:10:41,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:10:41,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 13:10:41,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626068517] [2025-02-06 13:10:41,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:10:41,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:10:41,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:10:41,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:10:41,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:10:41,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-02-06 13:10:41,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 195 transitions, 2736 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:41,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:10:41,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-02-06 13:10:41,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:10:42,164 INFO L124 PetriNetUnfolderBase]: 5597/8999 cut-off events. [2025-02-06 13:10:42,165 INFO L125 PetriNetUnfolderBase]: For 76370/76370 co-relation queries the response was YES. [2025-02-06 13:10:42,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48023 conditions, 8999 events. 5597/8999 cut-off events. For 76370/76370 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 53616 event pairs, 1930 based on Foata normal form. 96/9095 useless extension candidates. Maximal degree in co-relation 47972. Up to 4924 conditions per place. [2025-02-06 13:10:42,221 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 181 selfloop transitions, 23 changer transitions 29/236 dead transitions. [2025-02-06 13:10:42,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 236 transitions, 3569 flow [2025-02-06 13:10:42,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:10:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:10:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-02-06 13:10:42,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-02-06 13:10:42,222 INFO L175 Difference]: Start difference. First operand has 156 places, 195 transitions, 2736 flow. Second operand 5 states and 133 transitions. [2025-02-06 13:10:42,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 236 transitions, 3569 flow [2025-02-06 13:10:42,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 236 transitions, 3361 flow, removed 26 selfloop flow, removed 7 redundant places. [2025-02-06 13:10:42,431 INFO L231 Difference]: Finished difference. Result has 150 places, 173 transitions, 2278 flow [2025-02-06 13:10:42,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2410, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2278, PETRI_PLACES=150, PETRI_TRANSITIONS=173} [2025-02-06 13:10:42,431 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 98 predicate places. [2025-02-06 13:10:42,431 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 173 transitions, 2278 flow [2025-02-06 13:10:42,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:42,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:10:42,431 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1] [2025-02-06 13:10:42,437 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:42,634 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,SelfDestructingSolverStorable21 [2025-02-06 13:10:42,634 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-06 13:10:42,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:10:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash -982350401, now seen corresponding path program 1 times [2025-02-06 13:10:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:10:42,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888075454] [2025-02-06 13:10:42,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:10:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:10:42,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 13:10:42,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:10:42,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:10:42,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:10:43,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:10:43,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888075454] [2025-02-06 13:10:43,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888075454] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:10:43,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170572700] [2025-02-06 13:10:43,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:10:43,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:10:43,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:10:43,696 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:43,697 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:43,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 13:10:43,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:10:43,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:10:43,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:10:43,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-06 13:10:43,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:10:43,842 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 25 treesize of output 1 [2025-02-06 13:10:43,880 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 23 treesize of output 1 [2025-02-06 13:10:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:10:44,311 INFO L312 TraceCheckSpWp]: Computing backward predicates...