./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.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/chl-chromosome-opt-symm.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 b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:01:12,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:01:12,494 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:01:12,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:01:12,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:01:12,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:01:12,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:01:12,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:01:12,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:01:12,513 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:01:12,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:01:12,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:01:12,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:01:12,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:01:12,514 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:01:12,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:01:12,514 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:01:12,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:01:12,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:01:12,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:01:12,515 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:01:12,515 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:01:12,515 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:01:12,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:01:12,515 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:01:12,515 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:01:12,515 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:01:12,515 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:01:12,515 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:01:12,515 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:01:12,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:01:12,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:01:12,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:01:12,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:01:12,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:01:12,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:01:12,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:01:12,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:01:12,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:01:12,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:01:12,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:01:12,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:01:12,517 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 -> b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a [2025-02-06 13:01:12,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:01:12,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:01:12,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:01:12,779 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:01:12,784 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:01:12,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-02-06 13:01:13,933 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06627b1d5/f33da374fe4048068e4abb5e82d00e0b/FLAGa21140552 [2025-02-06 13:01:14,212 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:01:14,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-02-06 13:01:14,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06627b1d5/f33da374fe4048068e4abb5e82d00e0b/FLAGa21140552 [2025-02-06 13:01:14,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06627b1d5/f33da374fe4048068e4abb5e82d00e0b [2025-02-06 13:01:14,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:01:14,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:01:14,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:01:14,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:01:14,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:01:14,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:01:14" (1/1) ... [2025-02-06 13:01:14,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@301e059d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:14, skipping insertion in model container [2025-02-06 13:01:14,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:01:14" (1/1) ... [2025-02-06 13:01:14,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:01:14,646 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:01:14,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:01:14,653 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:01:14,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:01:14,676 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:01:14,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:14 WrapperNode [2025-02-06 13:01:14,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:01:14,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:01:14,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:01:14,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:01:14,681 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:01:14" (1/1) ... [2025-02-06 13:01:14,685 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:01:14" (1/1) ... [2025-02-06 13:01:14,698 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 159 [2025-02-06 13:01:14,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:01:14,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:01:14,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:01:14,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:01:14,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:14" (1/1) ... [2025-02-06 13:01:14,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:14" (1/1) ... [2025-02-06 13:01:14,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:14" (1/1) ... [2025-02-06 13:01:14,715 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-06 13:01:14,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:14" (1/1) ... [2025-02-06 13:01:14,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:14" (1/1) ... [2025-02-06 13:01:14,724 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:14" (1/1) ... [2025-02-06 13:01:14,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:14" (1/1) ... [2025-02-06 13:01:14,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:14" (1/1) ... [2025-02-06 13:01:14,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:14" (1/1) ... [2025-02-06 13:01:14,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:01:14,732 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:01:14,732 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:01:14,732 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:01:14,732 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:14" (1/1) ... [2025-02-06 13:01:14,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:01:14,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:14,764 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:01:14,768 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:01:14,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:01:14,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 13:01:14,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 13:01:14,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 13:01:14,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 13:01:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:01:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:01:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:01:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:01:14,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:01:14,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:01:14,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:01:14,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:01:14,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:01:14,785 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:01:14,867 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:01:14,868 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:01:15,265 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:01:15,266 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:01:15,456 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:01:15,459 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:01:15,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:01:15 BoogieIcfgContainer [2025-02-06 13:01:15,459 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:01:15,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:01:15,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:01:15,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:01:15,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:01:14" (1/3) ... [2025-02-06 13:01:15,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786aa147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:01:15, skipping insertion in model container [2025-02-06 13:01:15,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:14" (2/3) ... [2025-02-06 13:01:15,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786aa147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:01:15, skipping insertion in model container [2025-02-06 13:01:15,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:01:15" (3/3) ... [2025-02-06 13:01:15,470 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2025-02-06 13:01:15,483 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:01:15,485 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-opt-symm.wvr.c that has 3 procedures, 59 locations, 1 initial locations, 4 loop locations, and 22 error locations. [2025-02-06 13:01:15,486 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:01:15,618 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 13:01:15,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 66 transitions, 146 flow [2025-02-06 13:01:15,733 INFO L124 PetriNetUnfolderBase]: 8/64 cut-off events. [2025-02-06 13:01:15,735 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:01:15,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 8/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 191 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-02-06 13:01:15,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 66 transitions, 146 flow [2025-02-06 13:01:15,744 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 63 transitions, 138 flow [2025-02-06 13:01:15,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:01:15,765 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;@2b8e7a01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:01:15,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-02-06 13:01:15,770 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:01:15,772 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 13:01:15,772 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:01:15,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:15,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:01:15,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:15,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:15,780 INFO L85 PathProgramCache]: Analyzing trace with hash 475717, now seen corresponding path program 1 times [2025-02-06 13:01:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:15,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707897882] [2025-02-06 13:01:15,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:15,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:15,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:01:15,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:01:15,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:15,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:16,001 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:01:16,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:16,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707897882] [2025-02-06 13:01:16,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707897882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:16,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:16,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:01:16,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531432153] [2025-02-06 13:01:16,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:16,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:01:16,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:16,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:01:16,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:01:16,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-02-06 13:01:16,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:01:16,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:16,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-02-06 13:01:16,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:16,237 INFO L124 PetriNetUnfolderBase]: 167/384 cut-off events. [2025-02-06 13:01:16,238 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 13:01:16,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 384 events. 167/384 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1875 event pairs, 86 based on Foata normal form. 1/263 useless extension candidates. Maximal degree in co-relation 602. Up to 250 conditions per place. [2025-02-06 13:01:16,242 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 26 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-02-06 13:01:16,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 186 flow [2025-02-06 13:01:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:01:16,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:01:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2025-02-06 13:01:16,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6717171717171717 [2025-02-06 13:01:16,280 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 138 flow. Second operand 3 states and 133 transitions. [2025-02-06 13:01:16,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 186 flow [2025-02-06 13:01:16,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 178 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:01:16,297 INFO L231 Difference]: Finished difference. Result has 56 places, 59 transitions, 126 flow [2025-02-06 13:01:16,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=56, PETRI_TRANSITIONS=59} [2025-02-06 13:01:16,306 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-02-06 13:01:16,306 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 126 flow [2025-02-06 13:01:16,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:01:16,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:16,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:01:16,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:01:16,308 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:16,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash 475718, now seen corresponding path program 1 times [2025-02-06 13:01:16,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:16,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057554914] [2025-02-06 13:01:16,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:16,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:16,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:01:16,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:01:16,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:16,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:16,566 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:01:16,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:16,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057554914] [2025-02-06 13:01:16,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057554914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:16,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:16,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:01:16,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878754257] [2025-02-06 13:01:16,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:16,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:16,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:16,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:16,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:16,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-02-06 13:01:16,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:01:16,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:16,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-02-06 13:01:16,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:16,765 INFO L124 PetriNetUnfolderBase]: 167/388 cut-off events. [2025-02-06 13:01:16,767 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 13:01:16,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 388 events. 167/388 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1882 event pairs, 86 based on Foata normal form. 1/266 useless extension candidates. Maximal degree in co-relation 630. Up to 258 conditions per place. [2025-02-06 13:01:16,770 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 30 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2025-02-06 13:01:16,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 202 flow [2025-02-06 13:01:16,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:01:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:01:16,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2025-02-06 13:01:16,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7070707070707071 [2025-02-06 13:01:16,773 INFO L175 Difference]: Start difference. First operand has 56 places, 59 transitions, 126 flow. Second operand 3 states and 140 transitions. [2025-02-06 13:01:16,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 202 flow [2025-02-06 13:01:16,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:01:16,775 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 148 flow [2025-02-06 13:01:16,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2025-02-06 13:01:16,777 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2025-02-06 13:01:16,777 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 148 flow [2025-02-06 13:01:16,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:01:16,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:16,778 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 13:01:16,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:01:16,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:16,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:16,779 INFO L85 PathProgramCache]: Analyzing trace with hash 457179436, now seen corresponding path program 1 times [2025-02-06 13:01:16,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:16,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461697519] [2025-02-06 13:01:16,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:16,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:16,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:01:16,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:01:16,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:16,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:16,998 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:01:16,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:16,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461697519] [2025-02-06 13:01:16,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461697519] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:16,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568299442] [2025-02-06 13:01:16,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:16,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:16,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:17,005 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:01:17,007 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:01:17,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:01:17,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:01:17,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:17,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:17,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 13:01:17,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:17,131 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 6 treesize of output 5 [2025-02-06 13:01:17,180 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:01:17,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:17,248 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:01:17,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568299442] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:17,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:17,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-02-06 13:01:17,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460596305] [2025-02-06 13:01:17,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:17,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:01:17,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:17,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:01:17,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:01:17,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-02-06 13:01:17,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 148 flow. Second operand has 9 states, 9 states have (on average 35.666666666666664) internal successors, (321), 9 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:01:17,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:17,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-02-06 13:01:17,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:17,789 INFO L124 PetriNetUnfolderBase]: 173/406 cut-off events. [2025-02-06 13:01:17,792 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 13:01:17,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 406 events. 173/406 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1962 event pairs, 86 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 665. Up to 261 conditions per place. [2025-02-06 13:01:17,797 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 36 selfloop transitions, 16 changer transitions 0/81 dead transitions. [2025-02-06 13:01:17,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 319 flow [2025-02-06 13:01:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:01:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:01:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 262 transitions. [2025-02-06 13:01:17,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6616161616161617 [2025-02-06 13:01:17,801 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 148 flow. Second operand 6 states and 262 transitions. [2025-02-06 13:01:17,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 319 flow [2025-02-06 13:01:17,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:01:17,802 INFO L231 Difference]: Finished difference. Result has 64 places, 73 transitions, 260 flow [2025-02-06 13:01:17,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=64, PETRI_TRANSITIONS=73} [2025-02-06 13:01:17,803 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2025-02-06 13:01:17,803 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 73 transitions, 260 flow [2025-02-06 13:01:17,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.666666666666664) internal successors, (321), 9 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:01:17,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:17,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:17,812 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:01:18,006 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:01:18,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:18,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:18,010 INFO L85 PathProgramCache]: Analyzing trace with hash -951041298, now seen corresponding path program 1 times [2025-02-06 13:01:18,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:18,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135157657] [2025-02-06 13:01:18,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:18,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:18,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:01:18,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:01:18,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:18,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:01:18,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:18,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135157657] [2025-02-06 13:01:18,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135157657] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:18,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925202488] [2025-02-06 13:01:18,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:18,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:18,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:18,076 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:01:18,079 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:01:18,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:01:18,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:01:18,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:18,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:18,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:01:18,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:01:18,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:01:18,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925202488] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:18,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:18,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-02-06 13:01:18,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672937839] [2025-02-06 13:01:18,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:18,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 13:01:18,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:18,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 13:01:18,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:01:18,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2025-02-06 13:01:18,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 73 transitions, 260 flow. Second operand has 8 states, 8 states have (on average 38.125) internal successors, (305), 8 states have internal predecessors, (305), 0 states have call successors, (0), 0 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:01:18,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:18,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2025-02-06 13:01:18,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:18,299 INFO L124 PetriNetUnfolderBase]: 167/400 cut-off events. [2025-02-06 13:01:18,300 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-02-06 13:01:18,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 400 events. 167/400 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1865 event pairs, 86 based on Foata normal form. 6/286 useless extension candidates. Maximal degree in co-relation 654. Up to 254 conditions per place. [2025-02-06 13:01:18,313 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 30 selfloop transitions, 14 changer transitions 0/75 dead transitions. [2025-02-06 13:01:18,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 75 transitions, 322 flow [2025-02-06 13:01:18,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:01:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:01:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 264 transitions. [2025-02-06 13:01:18,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-06 13:01:18,315 INFO L175 Difference]: Start difference. First operand has 64 places, 73 transitions, 260 flow. Second operand 6 states and 264 transitions. [2025-02-06 13:01:18,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 75 transitions, 322 flow [2025-02-06 13:01:18,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 75 transitions, 306 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 13:01:18,319 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 246 flow [2025-02-06 13:01:18,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2025-02-06 13:01:18,320 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-02-06 13:01:18,320 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 246 flow [2025-02-06 13:01:18,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.125) internal successors, (305), 8 states have internal predecessors, (305), 0 states have call successors, (0), 0 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:01:18,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:18,321 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-02-06 13:01:18,328 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:01:18,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:18,521 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:18,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:18,526 INFO L85 PathProgramCache]: Analyzing trace with hash -995953442, now seen corresponding path program 2 times [2025-02-06 13:01:18,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:18,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214826339] [2025-02-06 13:01:18,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:01:18,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:18,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 13:01:18,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:01:18,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:01:18,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:18,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:18,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214826339] [2025-02-06 13:01:18,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214826339] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:18,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173661437] [2025-02-06 13:01:18,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:01:18,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:18,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:18,834 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:01:18,835 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:01:18,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 13:01:18,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:01:18,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:01:18,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:18,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 13:01:18,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:18,890 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 6 treesize of output 5 [2025-02-06 13:01:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:18,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:19,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173661437] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:19,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:19,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-02-06 13:01:19,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163806681] [2025-02-06 13:01:19,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:19,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 13:01:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:19,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 13:01:19,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-02-06 13:01:19,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-02-06 13:01:19,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 246 flow. Second operand has 18 states, 18 states have (on average 35.833333333333336) internal successors, (645), 18 states have internal predecessors, (645), 0 states have call successors, (0), 0 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:01:19,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:19,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-02-06 13:01:19,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:20,072 INFO L124 PetriNetUnfolderBase]: 169/404 cut-off events. [2025-02-06 13:01:20,072 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-02-06 13:01:20,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 404 events. 169/404 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1879 event pairs, 86 based on Foata normal form. 4/288 useless extension candidates. Maximal degree in co-relation 672. Up to 251 conditions per place. [2025-02-06 13:01:20,075 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 31 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2025-02-06 13:01:20,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 392 flow [2025-02-06 13:01:20,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:01:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:01:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 360 transitions. [2025-02-06 13:01:20,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-02-06 13:01:20,077 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 246 flow. Second operand 9 states and 360 transitions. [2025-02-06 13:01:20,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 392 flow [2025-02-06 13:01:20,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 79 transitions, 350 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-02-06 13:01:20,079 INFO L231 Difference]: Finished difference. Result has 69 places, 73 transitions, 276 flow [2025-02-06 13:01:20,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=276, PETRI_PLACES=69, PETRI_TRANSITIONS=73} [2025-02-06 13:01:20,080 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-02-06 13:01:20,080 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 73 transitions, 276 flow [2025-02-06 13:01:20,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 35.833333333333336) internal successors, (645), 18 states have internal predecessors, (645), 0 states have call successors, (0), 0 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:01:20,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:20,081 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:20,087 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:01:20,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:20,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:20,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:20,284 INFO L85 PathProgramCache]: Analyzing trace with hash 802770748, now seen corresponding path program 2 times [2025-02-06 13:01:20,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:20,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116667562] [2025-02-06 13:01:20,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:01:20,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:20,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-06 13:01:20,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 23 statements. [2025-02-06 13:01:20,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:01:20,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 13:01:20,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:20,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116667562] [2025-02-06 13:01:20,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116667562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:20,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:20,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:01:20,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366953982] [2025-02-06 13:01:20,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:20,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:20,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:20,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:20,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:20,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 66 [2025-02-06 13:01:20,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 73 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:01:20,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:20,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 66 [2025-02-06 13:01:20,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:21,009 INFO L124 PetriNetUnfolderBase]: 240/532 cut-off events. [2025-02-06 13:01:21,010 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 13:01:21,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 532 events. 240/532 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2668 event pairs, 139 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 946. Up to 362 conditions per place. [2025-02-06 13:01:21,014 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 42 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2025-02-06 13:01:21,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 69 transitions, 362 flow [2025-02-06 13:01:21,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:01:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:01:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-02-06 13:01:21,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-02-06 13:01:21,018 INFO L175 Difference]: Start difference. First operand has 69 places, 73 transitions, 276 flow. Second operand 5 states and 170 transitions. [2025-02-06 13:01:21,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 69 transitions, 362 flow [2025-02-06 13:01:21,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 325 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 13:01:21,022 INFO L231 Difference]: Finished difference. Result has 63 places, 69 transitions, 241 flow [2025-02-06 13:01:21,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=63, PETRI_TRANSITIONS=69} [2025-02-06 13:01:21,024 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2025-02-06 13:01:21,024 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 69 transitions, 241 flow [2025-02-06 13:01:21,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:01:21,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:21,024 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:21,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:01:21,025 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:21,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:21,026 INFO L85 PathProgramCache]: Analyzing trace with hash 802770749, now seen corresponding path program 1 times [2025-02-06 13:01:21,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:21,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35514772] [2025-02-06 13:01:21,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:21,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:21,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:01:21,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:01:21,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:21,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 13:01:21,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:21,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35514772] [2025-02-06 13:01:21,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35514772] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:21,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892731091] [2025-02-06 13:01:21,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:21,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:21,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:21,277 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:01:21,282 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:01:21,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:01:21,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:01:21,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:21,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:21,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:01:21,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 13:01:22,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 13:01:22,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892731091] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:22,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:22,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-02-06 13:01:22,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564626276] [2025-02-06 13:01:22,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:22,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 13:01:22,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:22,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 13:01:22,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-02-06 13:01:22,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2025-02-06 13:01:22,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 69 transitions, 241 flow. Second operand has 17 states, 17 states have (on average 38.05882352941177) internal successors, (647), 17 states have internal predecessors, (647), 0 states have call successors, (0), 0 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:01:22,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:22,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2025-02-06 13:01:22,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:23,267 INFO L124 PetriNetUnfolderBase]: 167/384 cut-off events. [2025-02-06 13:01:23,267 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 13:01:23,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 384 events. 167/384 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1671 event pairs, 86 based on Foata normal form. 2/284 useless extension candidates. Maximal degree in co-relation 616. Up to 254 conditions per place. [2025-02-06 13:01:23,271 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 32 selfloop transitions, 16 changer transitions 0/73 dead transitions. [2025-02-06 13:01:23,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 348 flow [2025-02-06 13:01:23,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:01:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:01:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 338 transitions. [2025-02-06 13:01:23,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6401515151515151 [2025-02-06 13:01:23,276 INFO L175 Difference]: Start difference. First operand has 63 places, 69 transitions, 241 flow. Second operand 8 states and 338 transitions. [2025-02-06 13:01:23,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 348 flow [2025-02-06 13:01:23,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 73 transitions, 343 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:01:23,277 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 255 flow [2025-02-06 13:01:23,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=255, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2025-02-06 13:01:23,278 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2025-02-06 13:01:23,278 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 255 flow [2025-02-06 13:01:23,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 38.05882352941177) internal successors, (647), 17 states have internal predecessors, (647), 0 states have call successors, (0), 0 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:01:23,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:23,278 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:23,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 13:01:23,482 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,SelfDestructingSolverStorable6 [2025-02-06 13:01:23,482 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:23,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:23,482 INFO L85 PathProgramCache]: Analyzing trace with hash -138997673, now seen corresponding path program 2 times [2025-02-06 13:01:23,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:23,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322032220] [2025-02-06 13:01:23,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:01:23,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:23,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 13:01:23,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 27 statements. [2025-02-06 13:01:23,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:01:23,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:01:23,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:23,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322032220] [2025-02-06 13:01:23,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322032220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:23,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:23,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:01:23,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459870564] [2025-02-06 13:01:23,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:23,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:01:23,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:23,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:01:23,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:01:24,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-02-06 13:01:24,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 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:01:24,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:24,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-02-06 13:01:24,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:24,204 INFO L124 PetriNetUnfolderBase]: 349/805 cut-off events. [2025-02-06 13:01:24,204 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 13:01:24,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 805 events. 349/805 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4269 event pairs, 112 based on Foata normal form. 26/613 useless extension candidates. Maximal degree in co-relation 1317. Up to 309 conditions per place. [2025-02-06 13:01:24,208 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 58 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-02-06 13:01:24,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 86 transitions, 422 flow [2025-02-06 13:01:24,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:01:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:01:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 243 transitions. [2025-02-06 13:01:24,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-02-06 13:01:24,209 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 255 flow. Second operand 6 states and 243 transitions. [2025-02-06 13:01:24,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 86 transitions, 422 flow [2025-02-06 13:01:24,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 86 transitions, 390 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-06 13:01:24,211 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 243 flow [2025-02-06 13:01:24,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2025-02-06 13:01:24,211 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-02-06 13:01:24,212 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 243 flow [2025-02-06 13:01:24,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 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:01:24,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:24,212 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:24,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:01:24,212 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:24,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:24,212 INFO L85 PathProgramCache]: Analyzing trace with hash -13960160, now seen corresponding path program 1 times [2025-02-06 13:01:24,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:24,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141419354] [2025-02-06 13:01:24,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:24,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:24,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 13:01:24,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:01:24,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:24,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:24,309 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-06 13:01:24,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:24,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141419354] [2025-02-06 13:01:24,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141419354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:24,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:24,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:01:24,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367035141] [2025-02-06 13:01:24,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:24,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:24,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:24,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:24,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:24,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 66 [2025-02-06 13:01:24,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 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:01:24,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:24,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 66 [2025-02-06 13:01:24,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:24,507 INFO L124 PetriNetUnfolderBase]: 447/902 cut-off events. [2025-02-06 13:01:24,507 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-06 13:01:24,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1774 conditions, 902 events. 447/902 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4641 event pairs, 275 based on Foata normal form. 0/827 useless extension candidates. Maximal degree in co-relation 1667. Up to 677 conditions per place. [2025-02-06 13:01:24,515 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 44 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-02-06 13:01:24,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 327 flow [2025-02-06 13:01:24,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:01:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:01:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2025-02-06 13:01:24,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-02-06 13:01:24,524 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 243 flow. Second operand 4 states and 143 transitions. [2025-02-06 13:01:24,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 327 flow [2025-02-06 13:01:24,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 319 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:01:24,526 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 231 flow [2025-02-06 13:01:24,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2025-02-06 13:01:24,527 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2025-02-06 13:01:24,527 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 231 flow [2025-02-06 13:01:24,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 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:01:24,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:24,527 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:24,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:01:24,527 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:24,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:24,528 INFO L85 PathProgramCache]: Analyzing trace with hash -13960159, now seen corresponding path program 1 times [2025-02-06 13:01:24,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:24,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767462440] [2025-02-06 13:01:24,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:24,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:24,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 13:01:24,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:01:24,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:24,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 13:01:24,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:24,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767462440] [2025-02-06 13:01:24,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767462440] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:24,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151302051] [2025-02-06 13:01:24,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:24,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:24,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:24,795 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:01:24,796 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:01:24,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 13:01:24,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:01:24,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:24,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:24,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 13:01:24,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:25,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:25,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-06 13:01:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:25,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151302051] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:25,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:25,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2025-02-06 13:01:25,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713430547] [2025-02-06 13:01:25,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:25,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 13:01:25,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:25,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 13:01:25,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-02-06 13:01:25,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-02-06 13:01:25,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 231 flow. Second operand has 21 states, 21 states have (on average 34.904761904761905) internal successors, (733), 21 states have internal predecessors, (733), 0 states have call successors, (0), 0 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:01:25,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:25,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-02-06 13:01:25,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:26,155 INFO L124 PetriNetUnfolderBase]: 418/894 cut-off events. [2025-02-06 13:01:26,155 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-06 13:01:26,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 894 events. 418/894 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4392 event pairs, 77 based on Foata normal form. 0/773 useless extension candidates. Maximal degree in co-relation 1596. Up to 252 conditions per place. [2025-02-06 13:01:26,158 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 70 selfloop transitions, 15 changer transitions 0/103 dead transitions. [2025-02-06 13:01:26,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 103 transitions, 497 flow [2025-02-06 13:01:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:01:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 13:01:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 415 transitions. [2025-02-06 13:01:26,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6287878787878788 [2025-02-06 13:01:26,163 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 231 flow. Second operand 10 states and 415 transitions. [2025-02-06 13:01:26,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 103 transitions, 497 flow [2025-02-06 13:01:26,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 103 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:01:26,165 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 273 flow [2025-02-06 13:01:26,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=273, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2025-02-06 13:01:26,165 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2025-02-06 13:01:26,165 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 273 flow [2025-02-06 13:01:26,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 34.904761904761905) internal successors, (733), 21 states have internal predecessors, (733), 0 states have call successors, (0), 0 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:01:26,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:26,165 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:26,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 13:01:26,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 13:01:26,366 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:26,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:26,366 INFO L85 PathProgramCache]: Analyzing trace with hash -484076634, now seen corresponding path program 1 times [2025-02-06 13:01:26,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:26,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642333980] [2025-02-06 13:01:26,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:26,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:26,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:01:26,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:01:26,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:26,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 13:01:26,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:26,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642333980] [2025-02-06 13:01:26,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642333980] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:26,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75662406] [2025-02-06 13:01:26,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:26,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:26,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:26,753 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:01:26,755 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:01:26,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:01:26,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:01:26,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:26,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:26,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 13:01:26,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:26,841 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:01:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:26,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:27,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75662406] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:27,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:01:27,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 21 [2025-02-06 13:01:27,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245782292] [2025-02-06 13:01:27,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:27,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:01:27,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:27,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:01:27,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2025-02-06 13:01:27,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-02-06 13:01:27,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 273 flow. Second operand has 10 states, 10 states have (on average 34.0) internal successors, (340), 10 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:01:27,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:27,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-02-06 13:01:27,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:27,638 INFO L124 PetriNetUnfolderBase]: 571/1235 cut-off events. [2025-02-06 13:01:27,639 INFO L125 PetriNetUnfolderBase]: For 387/387 co-relation queries the response was YES. [2025-02-06 13:01:27,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2502 conditions, 1235 events. 571/1235 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6964 event pairs, 153 based on Foata normal form. 0/1080 useless extension candidates. Maximal degree in co-relation 2384. Up to 556 conditions per place. [2025-02-06 13:01:27,645 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 55 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2025-02-06 13:01:27,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 77 transitions, 439 flow [2025-02-06 13:01:27,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:01:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:01:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2025-02-06 13:01:27,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6242424242424243 [2025-02-06 13:01:27,646 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 273 flow. Second operand 5 states and 206 transitions. [2025-02-06 13:01:27,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 77 transitions, 439 flow [2025-02-06 13:01:27,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 77 transitions, 414 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-06 13:01:27,648 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 271 flow [2025-02-06 13:01:27,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2025-02-06 13:01:27,648 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2025-02-06 13:01:27,649 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 271 flow [2025-02-06 13:01:27,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.0) internal successors, (340), 10 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:01:27,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:27,649 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:27,658 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:01:27,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 13:01:27,853 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:27,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:27,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2121473337, now seen corresponding path program 1 times [2025-02-06 13:01:27,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:27,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181164569] [2025-02-06 13:01:27,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:27,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:27,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:01:27,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:01:27,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:27,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 13:01:28,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:28,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181164569] [2025-02-06 13:01:28,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181164569] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:28,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47316745] [2025-02-06 13:01:28,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:28,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:28,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:28,082 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:01:28,085 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:01:28,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:01:28,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:01:28,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:28,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:28,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 13:01:28,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:28,182 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:01:28,184 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 6 treesize of output 5 [2025-02-06 13:01:28,267 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:01:28,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 13:01:28,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 13:01:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:28,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:28,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47316745] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:28,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:01:28,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 8] total 21 [2025-02-06 13:01:28,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822809637] [2025-02-06 13:01:28,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:28,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:01:28,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:28,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:01:28,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-02-06 13:01:29,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-02-06 13:01:29,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 271 flow. Second operand has 10 states, 10 states have (on average 35.0) internal successors, (350), 10 states have internal predecessors, (350), 0 states have call successors, (0), 0 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:01:29,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:29,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-02-06 13:01:29,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:29,357 INFO L124 PetriNetUnfolderBase]: 523/1147 cut-off events. [2025-02-06 13:01:29,357 INFO L125 PetriNetUnfolderBase]: For 404/404 co-relation queries the response was YES. [2025-02-06 13:01:29,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2456 conditions, 1147 events. 523/1147 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6354 event pairs, 151 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 2345. Up to 479 conditions per place. [2025-02-06 13:01:29,362 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 53 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2025-02-06 13:01:29,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 77 transitions, 433 flow [2025-02-06 13:01:29,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:01:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:01:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 243 transitions. [2025-02-06 13:01:29,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-02-06 13:01:29,363 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 271 flow. Second operand 6 states and 243 transitions. [2025-02-06 13:01:29,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 77 transitions, 433 flow [2025-02-06 13:01:29,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 77 transitions, 427 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:01:29,365 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 288 flow [2025-02-06 13:01:29,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2025-02-06 13:01:29,365 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2025-02-06 13:01:29,365 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 288 flow [2025-02-06 13:01:29,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.0) internal successors, (350), 10 states have internal predecessors, (350), 0 states have call successors, (0), 0 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:01:29,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:29,366 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:29,372 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:01:29,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:29,566 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:29,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:29,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1075034465, now seen corresponding path program 1 times [2025-02-06 13:01:29,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:29,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207825071] [2025-02-06 13:01:29,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:29,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:29,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 13:01:29,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 13:01:29,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:29,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:01:29,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:29,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207825071] [2025-02-06 13:01:29,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207825071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:29,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:29,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:01:29,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210369322] [2025-02-06 13:01:29,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:29,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:29,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:29,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:29,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:29,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2025-02-06 13:01:29,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:01:29,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:29,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2025-02-06 13:01:29,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:29,780 INFO L124 PetriNetUnfolderBase]: 709/1577 cut-off events. [2025-02-06 13:01:29,780 INFO L125 PetriNetUnfolderBase]: For 1039/1039 co-relation queries the response was YES. [2025-02-06 13:01:29,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3511 conditions, 1577 events. 709/1577 cut-off events. For 1039/1039 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 9411 event pairs, 283 based on Foata normal form. 36/1501 useless extension candidates. Maximal degree in co-relation 3397. Up to 700 conditions per place. [2025-02-06 13:01:29,788 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 67 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-02-06 13:01:29,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 510 flow [2025-02-06 13:01:29,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:01:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:01:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-02-06 13:01:29,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7537878787878788 [2025-02-06 13:01:29,789 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 288 flow. Second operand 4 states and 199 transitions. [2025-02-06 13:01:29,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 510 flow [2025-02-06 13:01:29,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 90 transitions, 498 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:01:29,816 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 295 flow [2025-02-06 13:01:29,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2025-02-06 13:01:29,817 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2025-02-06 13:01:29,817 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 295 flow [2025-02-06 13:01:29,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:01:29,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:29,817 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:29,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:01:29,817 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:29,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:29,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1342100486, now seen corresponding path program 1 times [2025-02-06 13:01:29,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:29,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404470959] [2025-02-06 13:01:29,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:29,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:29,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 13:01:29,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:01:29,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:29,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 13:01:30,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:30,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404470959] [2025-02-06 13:01:30,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404470959] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:30,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436399363] [2025-02-06 13:01:30,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:30,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:30,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:30,112 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:01:30,113 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:01:30,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 13:01:30,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:01:30,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:30,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:30,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 13:01:30,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:30,211 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:01:30,213 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 6 treesize of output 5 [2025-02-06 13:01:30,325 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 13:01:30,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 13:01:30,341 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:01:30,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 13:01:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:30,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:31,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436399363] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:31,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:31,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 24 [2025-02-06 13:01:31,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30392996] [2025-02-06 13:01:31,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:31,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 13:01:31,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:31,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 13:01:31,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2025-02-06 13:01:32,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2025-02-06 13:01:32,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 295 flow. Second operand has 26 states, 26 states have (on average 32.46153846153846) internal successors, (844), 26 states have internal predecessors, (844), 0 states have call successors, (0), 0 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:01:32,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:32,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2025-02-06 13:01:32,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:33,635 INFO L124 PetriNetUnfolderBase]: 1480/2923 cut-off events. [2025-02-06 13:01:33,635 INFO L125 PetriNetUnfolderBase]: For 2285/2285 co-relation queries the response was YES. [2025-02-06 13:01:33,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7019 conditions, 2923 events. 1480/2923 cut-off events. For 2285/2285 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 16788 event pairs, 95 based on Foata normal form. 108/2925 useless extension candidates. Maximal degree in co-relation 6905. Up to 631 conditions per place. [2025-02-06 13:01:33,647 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 117 selfloop transitions, 13 changer transitions 0/147 dead transitions. [2025-02-06 13:01:33,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 147 transitions, 826 flow [2025-02-06 13:01:33,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 13:01:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 13:01:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 513 transitions. [2025-02-06 13:01:33,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5979020979020979 [2025-02-06 13:01:33,649 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 295 flow. Second operand 13 states and 513 transitions. [2025-02-06 13:01:33,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 147 transitions, 826 flow [2025-02-06 13:01:33,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 147 transitions, 816 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-06 13:01:33,653 INFO L231 Difference]: Finished difference. Result has 86 places, 67 transitions, 351 flow [2025-02-06 13:01:33,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=351, PETRI_PLACES=86, PETRI_TRANSITIONS=67} [2025-02-06 13:01:33,654 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 24 predicate places. [2025-02-06 13:01:33,654 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 67 transitions, 351 flow [2025-02-06 13:01:33,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 32.46153846153846) internal successors, (844), 26 states have internal predecessors, (844), 0 states have call successors, (0), 0 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:01:33,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:33,655 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:33,664 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:01:33,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:33,859 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:33,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:33,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1452812015, now seen corresponding path program 1 times [2025-02-06 13:01:33,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:33,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778194044] [2025-02-06 13:01:33,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:33,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:33,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 13:01:33,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:01:33,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:33,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:01:33,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:33,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778194044] [2025-02-06 13:01:33,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778194044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:33,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:33,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:01:33,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033373289] [2025-02-06 13:01:33,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:33,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:33,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:33,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:33,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:33,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2025-02-06 13:01:33,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 67 transitions, 351 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:01:33,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:33,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2025-02-06 13:01:33,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:34,197 INFO L124 PetriNetUnfolderBase]: 1878/3917 cut-off events. [2025-02-06 13:01:34,198 INFO L125 PetriNetUnfolderBase]: For 3381/3381 co-relation queries the response was YES. [2025-02-06 13:01:34,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9231 conditions, 3917 events. 1878/3917 cut-off events. For 3381/3381 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 26723 event pairs, 1011 based on Foata normal form. 93/3827 useless extension candidates. Maximal degree in co-relation 9107. Up to 2100 conditions per place. [2025-02-06 13:01:34,222 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 75 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2025-02-06 13:01:34,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 98 transitions, 682 flow [2025-02-06 13:01:34,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:01:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:01:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2025-02-06 13:01:34,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7424242424242424 [2025-02-06 13:01:34,223 INFO L175 Difference]: Start difference. First operand has 86 places, 67 transitions, 351 flow. Second operand 4 states and 196 transitions. [2025-02-06 13:01:34,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 98 transitions, 682 flow [2025-02-06 13:01:34,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 98 transitions, 673 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:01:34,229 INFO L231 Difference]: Finished difference. Result has 88 places, 68 transitions, 359 flow [2025-02-06 13:01:34,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=359, PETRI_PLACES=88, PETRI_TRANSITIONS=68} [2025-02-06 13:01:34,230 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 26 predicate places. [2025-02-06 13:01:34,230 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 68 transitions, 359 flow [2025-02-06 13:01:34,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:01:34,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:34,231 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:34,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:01:34,231 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:34,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:34,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1694100285, now seen corresponding path program 1 times [2025-02-06 13:01:34,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:34,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129671161] [2025-02-06 13:01:34,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:34,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:34,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 13:01:34,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 13:01:34,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:34,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:01:34,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:34,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129671161] [2025-02-06 13:01:34,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129671161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:34,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:34,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:01:34,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888077260] [2025-02-06 13:01:34,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:34,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:34,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:34,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:34,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:34,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-02-06 13:01:34,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 68 transitions, 359 flow. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:01:34,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:34,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-02-06 13:01:34,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:34,686 INFO L124 PetriNetUnfolderBase]: 2322/4627 cut-off events. [2025-02-06 13:01:34,687 INFO L125 PetriNetUnfolderBase]: For 4642/4642 co-relation queries the response was YES. [2025-02-06 13:01:34,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11604 conditions, 4627 events. 2322/4627 cut-off events. For 4642/4642 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 30628 event pairs, 1237 based on Foata normal form. 5/4376 useless extension candidates. Maximal degree in co-relation 11479. Up to 2925 conditions per place. [2025-02-06 13:01:34,707 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 78 selfloop transitions, 5 changer transitions 2/104 dead transitions. [2025-02-06 13:01:34,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 104 transitions, 655 flow [2025-02-06 13:01:34,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:01:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:01:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2025-02-06 13:01:34,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2025-02-06 13:01:34,709 INFO L175 Difference]: Start difference. First operand has 88 places, 68 transitions, 359 flow. Second operand 5 states and 235 transitions. [2025-02-06 13:01:34,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 104 transitions, 655 flow [2025-02-06 13:01:34,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 104 transitions, 652 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:01:34,718 INFO L231 Difference]: Finished difference. Result has 93 places, 69 transitions, 378 flow [2025-02-06 13:01:34,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=378, PETRI_PLACES=93, PETRI_TRANSITIONS=69} [2025-02-06 13:01:34,719 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 31 predicate places. [2025-02-06 13:01:34,719 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 69 transitions, 378 flow [2025-02-06 13:01:34,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:01:34,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:34,719 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:34,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 13:01:34,720 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:34,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1829923275, now seen corresponding path program 2 times [2025-02-06 13:01:34,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:34,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53433792] [2025-02-06 13:01:34,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:01:34,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:34,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 13:01:34,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 37 statements. [2025-02-06 13:01:34,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:01:34,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:01:34,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:34,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53433792] [2025-02-06 13:01:34,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53433792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:34,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:34,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:01:34,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218011571] [2025-02-06 13:01:34,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:34,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:01:34,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:34,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:01:34,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:01:34,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2025-02-06 13:01:34,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 69 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:01:34,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:34,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2025-02-06 13:01:34,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:35,181 INFO L124 PetriNetUnfolderBase]: 2013/4145 cut-off events. [2025-02-06 13:01:35,182 INFO L125 PetriNetUnfolderBase]: For 5104/5104 co-relation queries the response was YES. [2025-02-06 13:01:35,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10682 conditions, 4145 events. 2013/4145 cut-off events. For 5104/5104 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 28684 event pairs, 810 based on Foata normal form. 10/4017 useless extension candidates. Maximal degree in co-relation 10554. Up to 1935 conditions per place. [2025-02-06 13:01:35,200 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 67 selfloop transitions, 3 changer transitions 1/93 dead transitions. [2025-02-06 13:01:35,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 655 flow [2025-02-06 13:01:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:01:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:01:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-02-06 13:01:35,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2025-02-06 13:01:35,202 INFO L175 Difference]: Start difference. First operand has 93 places, 69 transitions, 378 flow. Second operand 3 states and 156 transitions. [2025-02-06 13:01:35,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 655 flow [2025-02-06 13:01:35,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 643 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:01:35,208 INFO L231 Difference]: Finished difference. Result has 93 places, 71 transitions, 389 flow [2025-02-06 13:01:35,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=93, PETRI_TRANSITIONS=71} [2025-02-06 13:01:35,208 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 31 predicate places. [2025-02-06 13:01:35,208 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 71 transitions, 389 flow [2025-02-06 13:01:35,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:01:35,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:35,208 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:35,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 13:01:35,209 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:35,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:35,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1262766442, now seen corresponding path program 1 times [2025-02-06 13:01:35,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:35,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407142649] [2025-02-06 13:01:35,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:35,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:35,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 13:01:35,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 13:01:35,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:35,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 13:01:35,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:35,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407142649] [2025-02-06 13:01:35,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407142649] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:35,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55396672] [2025-02-06 13:01:35,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:35,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:35,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:35,393 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:01:35,394 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:01:35,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 13:01:35,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 13:01:35,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:35,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:35,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 13:01:35,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:35,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:35,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-06 13:01:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:35,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55396672] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:35,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:35,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 24 [2025-02-06 13:01:35,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189220637] [2025-02-06 13:01:35,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:35,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 13:01:35,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:35,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 13:01:35,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2025-02-06 13:01:36,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-02-06 13:01:36,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 71 transitions, 389 flow. Second operand has 25 states, 25 states have (on average 34.48) internal successors, (862), 25 states have internal predecessors, (862), 0 states have call successors, (0), 0 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:01:36,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:36,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-02-06 13:01:36,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:37,927 INFO L124 PetriNetUnfolderBase]: 7326/14989 cut-off events. [2025-02-06 13:01:37,927 INFO L125 PetriNetUnfolderBase]: For 15570/15570 co-relation queries the response was YES. [2025-02-06 13:01:37,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40281 conditions, 14989 events. 7326/14989 cut-off events. For 15570/15570 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 120782 event pairs, 576 based on Foata normal form. 297/14860 useless extension candidates. Maximal degree in co-relation 40152. Up to 3022 conditions per place. [2025-02-06 13:01:38,039 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 136 selfloop transitions, 17 changer transitions 0/171 dead transitions. [2025-02-06 13:01:38,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 171 transitions, 1237 flow [2025-02-06 13:01:38,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 13:01:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 13:01:38,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 504 transitions. [2025-02-06 13:01:38,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-02-06 13:01:38,042 INFO L175 Difference]: Start difference. First operand has 93 places, 71 transitions, 389 flow. Second operand 12 states and 504 transitions. [2025-02-06 13:01:38,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 171 transitions, 1237 flow [2025-02-06 13:01:38,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 171 transitions, 1227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:01:38,069 INFO L231 Difference]: Finished difference. Result has 107 places, 75 transitions, 474 flow [2025-02-06 13:01:38,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=474, PETRI_PLACES=107, PETRI_TRANSITIONS=75} [2025-02-06 13:01:38,069 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 45 predicate places. [2025-02-06 13:01:38,069 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 75 transitions, 474 flow [2025-02-06 13:01:38,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 34.48) internal successors, (862), 25 states have internal predecessors, (862), 0 states have call successors, (0), 0 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:01:38,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:38,070 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:38,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 13:01:38,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 13:01:38,274 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:38,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:38,278 INFO L85 PathProgramCache]: Analyzing trace with hash -491053609, now seen corresponding path program 1 times [2025-02-06 13:01:38,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:38,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22019969] [2025-02-06 13:01:38,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:38,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:38,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 13:01:38,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 13:01:38,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:38,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 13:01:38,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:38,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22019969] [2025-02-06 13:01:38,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22019969] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:38,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555893280] [2025-02-06 13:01:38,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:38,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:38,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:38,537 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:01:38,538 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:01:38,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 13:01:38,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 13:01:38,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:38,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:38,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 13:01:38,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:38,631 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 6 treesize of output 5 [2025-02-06 13:01:38,635 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:01:38,693 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 13:01:38,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 13:01:38,705 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:01:38,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 13:01:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:39,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:39,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555893280] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:39,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:39,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 24 [2025-02-06 13:01:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4325985] [2025-02-06 13:01:39,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:39,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 13:01:39,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:39,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 13:01:39,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2025-02-06 13:01:40,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2025-02-06 13:01:40,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 75 transitions, 474 flow. Second operand has 26 states, 26 states have (on average 33.57692307692308) internal successors, (873), 26 states have internal predecessors, (873), 0 states have call successors, (0), 0 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:01:40,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:40,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2025-02-06 13:01:40,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:41,840 INFO L124 PetriNetUnfolderBase]: 6805/14466 cut-off events. [2025-02-06 13:01:41,841 INFO L125 PetriNetUnfolderBase]: For 18583/18583 co-relation queries the response was YES. [2025-02-06 13:01:41,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38847 conditions, 14466 events. 6805/14466 cut-off events. For 18583/18583 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 118252 event pairs, 959 based on Foata normal form. 297/14345 useless extension candidates. Maximal degree in co-relation 38704. Up to 2783 conditions per place. [2025-02-06 13:01:41,909 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 133 selfloop transitions, 13 changer transitions 0/166 dead transitions. [2025-02-06 13:01:41,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 166 transitions, 1253 flow [2025-02-06 13:01:41,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 13:01:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 13:01:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 511 transitions. [2025-02-06 13:01:41,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5955710955710956 [2025-02-06 13:01:41,911 INFO L175 Difference]: Start difference. First operand has 107 places, 75 transitions, 474 flow. Second operand 13 states and 511 transitions. [2025-02-06 13:01:41,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 166 transitions, 1253 flow [2025-02-06 13:01:41,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 166 transitions, 1232 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:01:41,932 INFO L231 Difference]: Finished difference. Result has 117 places, 76 transitions, 503 flow [2025-02-06 13:01:41,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=503, PETRI_PLACES=117, PETRI_TRANSITIONS=76} [2025-02-06 13:01:41,933 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 55 predicate places. [2025-02-06 13:01:41,933 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 76 transitions, 503 flow [2025-02-06 13:01:41,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 33.57692307692308) internal successors, (873), 26 states have internal predecessors, (873), 0 states have call successors, (0), 0 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:01:41,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:41,934 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:01:41,940 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:01:42,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:42,134 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:42,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:42,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1412828195, now seen corresponding path program 1 times [2025-02-06 13:01:42,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:42,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926828579] [2025-02-06 13:01:42,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:42,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:42,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 13:01:42,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 13:01:42,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:42,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:01:42,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:42,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926828579] [2025-02-06 13:01:42,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926828579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:42,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:42,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:01:42,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579856340] [2025-02-06 13:01:42,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:42,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:42,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:42,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:42,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:42,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-02-06 13:01:42,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 76 transitions, 503 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:01:42,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:42,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-02-06 13:01:42,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:43,919 INFO L124 PetriNetUnfolderBase]: 8969/18712 cut-off events. [2025-02-06 13:01:43,919 INFO L125 PetriNetUnfolderBase]: For 31080/31080 co-relation queries the response was YES. [2025-02-06 13:01:43,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52232 conditions, 18712 events. 8969/18712 cut-off events. For 31080/31080 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 159218 event pairs, 4333 based on Foata normal form. 0/18076 useless extension candidates. Maximal degree in co-relation 52089. Up to 12905 conditions per place. [2025-02-06 13:01:44,038 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 82 selfloop transitions, 4 changer transitions 0/108 dead transitions. [2025-02-06 13:01:44,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 108 transitions, 844 flow [2025-02-06 13:01:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:01:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:01:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2025-02-06 13:01:44,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-02-06 13:01:44,039 INFO L175 Difference]: Start difference. First operand has 117 places, 76 transitions, 503 flow. Second operand 4 states and 192 transitions. [2025-02-06 13:01:44,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 108 transitions, 844 flow [2025-02-06 13:01:44,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 108 transitions, 819 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-02-06 13:01:44,251 INFO L231 Difference]: Finished difference. Result has 112 places, 80 transitions, 548 flow [2025-02-06 13:01:44,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=548, PETRI_PLACES=112, PETRI_TRANSITIONS=80} [2025-02-06 13:01:44,252 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 50 predicate places. [2025-02-06 13:01:44,252 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 80 transitions, 548 flow [2025-02-06 13:01:44,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:01:44,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:44,252 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:01:44,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 13:01:44,252 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:44,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1501104955, now seen corresponding path program 2 times [2025-02-06 13:01:44,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:44,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968981244] [2025-02-06 13:01:44,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:01:44,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:44,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-06 13:01:44,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 42 statements. [2025-02-06 13:01:44,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:01:44,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:01:44,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:44,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968981244] [2025-02-06 13:01:44,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968981244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:44,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:44,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:01:44,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261188595] [2025-02-06 13:01:44,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:44,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:44,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:44,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:44,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:44,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-02-06 13:01:44,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 80 transitions, 548 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:01:44,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:44,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-02-06 13:01:44,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:45,752 INFO L124 PetriNetUnfolderBase]: 8993/18700 cut-off events. [2025-02-06 13:01:45,752 INFO L125 PetriNetUnfolderBase]: For 32670/32670 co-relation queries the response was YES. [2025-02-06 13:01:45,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53281 conditions, 18700 events. 8993/18700 cut-off events. For 32670/32670 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 158472 event pairs, 6195 based on Foata normal form. 4/18546 useless extension candidates. Maximal degree in co-relation 53142. Up to 10230 conditions per place. [2025-02-06 13:01:45,890 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 92 selfloop transitions, 7 changer transitions 0/121 dead transitions. [2025-02-06 13:01:45,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 121 transitions, 976 flow [2025-02-06 13:01:45,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:01:45,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:01:45,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2025-02-06 13:01:45,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-02-06 13:01:45,891 INFO L175 Difference]: Start difference. First operand has 112 places, 80 transitions, 548 flow. Second operand 5 states and 231 transitions. [2025-02-06 13:01:45,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 121 transitions, 976 flow [2025-02-06 13:01:45,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 121 transitions, 976 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 13:01:45,942 INFO L231 Difference]: Finished difference. Result has 118 places, 81 transitions, 576 flow [2025-02-06 13:01:45,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=576, PETRI_PLACES=118, PETRI_TRANSITIONS=81} [2025-02-06 13:01:45,942 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 56 predicate places. [2025-02-06 13:01:45,943 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 81 transitions, 576 flow [2025-02-06 13:01:45,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:01:45,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:45,944 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:01:45,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 13:01:45,944 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:45,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:45,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2001791527, now seen corresponding path program 1 times [2025-02-06 13:01:45,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:45,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361638886] [2025-02-06 13:01:45,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:45,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:45,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 13:01:45,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 13:01:45,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:45,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:01:45,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:45,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361638886] [2025-02-06 13:01:45,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361638886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:45,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:45,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:01:45,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901504466] [2025-02-06 13:01:45,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:45,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:45,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:45,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:45,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:46,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-02-06 13:01:46,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 81 transitions, 576 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:01:46,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:46,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-02-06 13:01:46,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:47,800 INFO L124 PetriNetUnfolderBase]: 9045/18960 cut-off events. [2025-02-06 13:01:47,801 INFO L125 PetriNetUnfolderBase]: For 40077/40077 co-relation queries the response was YES. [2025-02-06 13:01:47,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55431 conditions, 18960 events. 9045/18960 cut-off events. For 40077/40077 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 161819 event pairs, 7149 based on Foata normal form. 82/18883 useless extension candidates. Maximal degree in co-relation 55288. Up to 11844 conditions per place. [2025-02-06 13:01:47,963 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 99 selfloop transitions, 5 changer transitions 0/127 dead transitions. [2025-02-06 13:01:47,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 127 transitions, 1099 flow [2025-02-06 13:01:47,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:01:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:01:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2025-02-06 13:01:47,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7689393939393939 [2025-02-06 13:01:47,965 INFO L175 Difference]: Start difference. First operand has 118 places, 81 transitions, 576 flow. Second operand 4 states and 203 transitions. [2025-02-06 13:01:47,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 127 transitions, 1099 flow [2025-02-06 13:01:48,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 127 transitions, 1073 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-06 13:01:48,060 INFO L231 Difference]: Finished difference. Result has 120 places, 83 transitions, 605 flow [2025-02-06 13:01:48,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=605, PETRI_PLACES=120, PETRI_TRANSITIONS=83} [2025-02-06 13:01:48,060 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 58 predicate places. [2025-02-06 13:01:48,060 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 83 transitions, 605 flow [2025-02-06 13:01:48,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:01:48,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:48,060 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:01:48,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 13:01:48,060 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:48,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:48,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1271464999, now seen corresponding path program 3 times [2025-02-06 13:01:48,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:48,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368251200] [2025-02-06 13:01:48,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:01:48,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:48,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 6 equivalence classes. [2025-02-06 13:01:48,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 42 statements. [2025-02-06 13:01:48,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 13:01:48,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:48,174 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:01:48,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:48,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368251200] [2025-02-06 13:01:48,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368251200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:48,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:48,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:01:48,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772536634] [2025-02-06 13:01:48,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:48,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:48,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:48,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:48,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:48,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-02-06 13:01:48,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 83 transitions, 605 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:01:48,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:48,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-02-06 13:01:48,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:50,098 INFO L124 PetriNetUnfolderBase]: 8943/18667 cut-off events. [2025-02-06 13:01:50,098 INFO L125 PetriNetUnfolderBase]: For 38035/38037 co-relation queries the response was YES. [2025-02-06 13:01:50,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54232 conditions, 18667 events. 8943/18667 cut-off events. For 38035/38037 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 158286 event pairs, 6256 based on Foata normal form. 97/18632 useless extension candidates. Maximal degree in co-relation 54088. Up to 10651 conditions per place. [2025-02-06 13:01:50,257 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 89 selfloop transitions, 8 changer transitions 2/122 dead transitions. [2025-02-06 13:01:50,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 122 transitions, 1040 flow [2025-02-06 13:01:50,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:01:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:01:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2025-02-06 13:01:50,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7462121212121212 [2025-02-06 13:01:50,258 INFO L175 Difference]: Start difference. First operand has 120 places, 83 transitions, 605 flow. Second operand 4 states and 197 transitions. [2025-02-06 13:01:50,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 122 transitions, 1040 flow [2025-02-06 13:01:50,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 1031 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 13:01:50,311 INFO L231 Difference]: Finished difference. Result has 123 places, 84 transitions, 640 flow [2025-02-06 13:01:50,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=640, PETRI_PLACES=123, PETRI_TRANSITIONS=84} [2025-02-06 13:01:50,312 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 61 predicate places. [2025-02-06 13:01:50,312 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 84 transitions, 640 flow [2025-02-06 13:01:50,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:01:50,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:50,312 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:01:50,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 13:01:50,312 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:50,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:50,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1682710503, now seen corresponding path program 2 times [2025-02-06 13:01:50,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:50,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36606049] [2025-02-06 13:01:50,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:01:50,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:50,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-06 13:01:50,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 42 statements. [2025-02-06 13:01:50,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:01:50,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:01:50,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:50,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36606049] [2025-02-06 13:01:50,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36606049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:50,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:50,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:01:50,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671066674] [2025-02-06 13:01:50,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:50,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:50,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:50,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:50,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:50,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-02-06 13:01:50,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 84 transitions, 640 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:01:50,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:50,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-02-06 13:01:50,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:52,463 INFO L124 PetriNetUnfolderBase]: 9516/20105 cut-off events. [2025-02-06 13:01:52,463 INFO L125 PetriNetUnfolderBase]: For 45749/45749 co-relation queries the response was YES. [2025-02-06 13:01:52,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59981 conditions, 20105 events. 9516/20105 cut-off events. For 45749/45749 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 175580 event pairs, 5513 based on Foata normal form. 82/20035 useless extension candidates. Maximal degree in co-relation 59836. Up to 13882 conditions per place. [2025-02-06 13:01:52,598 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 81 selfloop transitions, 6 changer transitions 3/113 dead transitions. [2025-02-06 13:01:52,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 113 transitions, 984 flow [2025-02-06 13:01:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:01:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:01:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2025-02-06 13:01:52,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7310606060606061 [2025-02-06 13:01:52,599 INFO L175 Difference]: Start difference. First operand has 123 places, 84 transitions, 640 flow. Second operand 4 states and 193 transitions. [2025-02-06 13:01:52,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 113 transitions, 984 flow [2025-02-06 13:01:52,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 113 transitions, 968 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-06 13:01:52,663 INFO L231 Difference]: Finished difference. Result has 124 places, 85 transitions, 660 flow [2025-02-06 13:01:52,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=660, PETRI_PLACES=124, PETRI_TRANSITIONS=85} [2025-02-06 13:01:52,664 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 62 predicate places. [2025-02-06 13:01:52,664 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 85 transitions, 660 flow [2025-02-06 13:01:52,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:01:52,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:52,664 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:52,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 13:01:52,664 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:52,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:52,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1496080509, now seen corresponding path program 1 times [2025-02-06 13:01:52,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:52,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757973339] [2025-02-06 13:01:52,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:52,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:52,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 13:01:52,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 13:01:52,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:52,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 13:01:53,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:53,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757973339] [2025-02-06 13:01:53,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757973339] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:53,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951392121] [2025-02-06 13:01:53,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:53,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:53,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:53,167 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:01:53,171 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:01:53,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 13:01:53,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 13:01:53,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:53,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:53,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 13:01:53,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:53,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:53,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-06 13:01:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:53,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951392121] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:53,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:53,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 27 [2025-02-06 13:01:53,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676199188] [2025-02-06 13:01:53,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:53,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 13:01:53,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:53,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 13:01:53,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2025-02-06 13:01:54,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-02-06 13:01:54,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 85 transitions, 660 flow. Second operand has 28 states, 28 states have (on average 35.32142857142857) internal successors, (989), 28 states have internal predecessors, (989), 0 states have call successors, (0), 0 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:01:54,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:54,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-02-06 13:01:54,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:57,540 INFO L124 PetriNetUnfolderBase]: 10810/22814 cut-off events. [2025-02-06 13:01:57,540 INFO L125 PetriNetUnfolderBase]: For 49494/49494 co-relation queries the response was YES. [2025-02-06 13:01:57,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67045 conditions, 22814 events. 10810/22814 cut-off events. For 49494/49494 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 199727 event pairs, 1805 based on Foata normal form. 318/22993 useless extension candidates. Maximal degree in co-relation 66900. Up to 4655 conditions per place. [2025-02-06 13:01:57,769 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 174 selfloop transitions, 21 changer transitions 0/219 dead transitions. [2025-02-06 13:01:57,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 219 transitions, 1955 flow [2025-02-06 13:01:57,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 13:01:57,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 13:01:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 573 transitions. [2025-02-06 13:01:57,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6678321678321678 [2025-02-06 13:01:57,771 INFO L175 Difference]: Start difference. First operand has 124 places, 85 transitions, 660 flow. Second operand 13 states and 573 transitions. [2025-02-06 13:01:57,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 219 transitions, 1955 flow [2025-02-06 13:01:57,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 219 transitions, 1943 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 13:01:57,826 INFO L231 Difference]: Finished difference. Result has 136 places, 87 transitions, 729 flow [2025-02-06 13:01:57,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=729, PETRI_PLACES=136, PETRI_TRANSITIONS=87} [2025-02-06 13:01:57,826 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 74 predicate places. [2025-02-06 13:01:57,827 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 87 transitions, 729 flow [2025-02-06 13:01:57,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 35.32142857142857) internal successors, (989), 28 states have internal predecessors, (989), 0 states have call successors, (0), 0 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:01:57,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:57,827 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:01:57,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 13:01:58,027 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,SelfDestructingSolverStorable24 [2025-02-06 13:01:58,028 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:01:58,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:58,028 INFO L85 PathProgramCache]: Analyzing trace with hash 336668893, now seen corresponding path program 1 times [2025-02-06 13:01:58,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:58,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346115315] [2025-02-06 13:01:58,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:58,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:58,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 13:01:58,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 13:01:58,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:58,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:01:58,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:58,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346115315] [2025-02-06 13:01:58,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346115315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:58,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:58,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 13:01:58,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841232934] [2025-02-06 13:01:58,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:58,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:01:58,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:58,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:01:58,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:01:59,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-02-06 13:01:59,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 87 transitions, 729 flow. Second operand has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:01:59,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:59,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-02-06 13:01:59,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:02,795 INFO L124 PetriNetUnfolderBase]: 14400/29215 cut-off events. [2025-02-06 13:02:02,795 INFO L125 PetriNetUnfolderBase]: For 72470/72546 co-relation queries the response was YES. [2025-02-06 13:02:03,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89217 conditions, 29215 events. 14400/29215 cut-off events. For 72470/72546 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 247577 event pairs, 10535 based on Foata normal form. 8/29187 useless extension candidates. Maximal degree in co-relation 89059. Up to 18519 conditions per place. [2025-02-06 13:02:03,128 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 152 selfloop transitions, 28 changer transitions 0/197 dead transitions. [2025-02-06 13:02:03,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 197 transitions, 1796 flow [2025-02-06 13:02:03,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 13:02:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 13:02:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 494 transitions. [2025-02-06 13:02:03,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6237373737373737 [2025-02-06 13:02:03,134 INFO L175 Difference]: Start difference. First operand has 136 places, 87 transitions, 729 flow. Second operand 12 states and 494 transitions. [2025-02-06 13:02:03,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 197 transitions, 1796 flow [2025-02-06 13:02:03,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 197 transitions, 1765 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-06 13:02:03,231 INFO L231 Difference]: Finished difference. Result has 146 places, 108 transitions, 957 flow [2025-02-06 13:02:03,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=957, PETRI_PLACES=146, PETRI_TRANSITIONS=108} [2025-02-06 13:02:03,232 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 84 predicate places. [2025-02-06 13:02:03,232 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 108 transitions, 957 flow [2025-02-06 13:02:03,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:02:03,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:03,232 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:02:03,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 13:02:03,232 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:02:03,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:03,233 INFO L85 PathProgramCache]: Analyzing trace with hash -252039171, now seen corresponding path program 2 times [2025-02-06 13:02:03,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:03,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667049525] [2025-02-06 13:02:03,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:02:03,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:03,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-02-06 13:02:03,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 47 statements. [2025-02-06 13:02:03,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:02:03,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:02:03,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:03,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667049525] [2025-02-06 13:02:03,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667049525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:02:03,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:02:03,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 13:02:03,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447916414] [2025-02-06 13:02:03,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:02:03,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:02:03,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:03,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:02:03,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:02:03,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-02-06 13:02:03,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 108 transitions, 957 flow. Second operand has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:02:03,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:03,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-02-06 13:02:03,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:07,582 INFO L124 PetriNetUnfolderBase]: 14477/29149 cut-off events. [2025-02-06 13:02:07,582 INFO L125 PetriNetUnfolderBase]: For 90550/90682 co-relation queries the response was YES. [2025-02-06 13:02:07,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97418 conditions, 29149 events. 14477/29149 cut-off events. For 90550/90682 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 246169 event pairs, 10126 based on Foata normal form. 9/29125 useless extension candidates. Maximal degree in co-relation 97261. Up to 18519 conditions per place. [2025-02-06 13:02:07,909 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 218 selfloop transitions, 35 changer transitions 0/270 dead transitions. [2025-02-06 13:02:07,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 270 transitions, 2691 flow [2025-02-06 13:02:07,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 13:02:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 13:02:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 625 transitions. [2025-02-06 13:02:07,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6313131313131313 [2025-02-06 13:02:07,913 INFO L175 Difference]: Start difference. First operand has 146 places, 108 transitions, 957 flow. Second operand 15 states and 625 transitions. [2025-02-06 13:02:07,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 270 transitions, 2691 flow [2025-02-06 13:02:08,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 270 transitions, 2656 flow, removed 16 selfloop flow, removed 2 redundant places. [2025-02-06 13:02:08,220 INFO L231 Difference]: Finished difference. Result has 167 places, 122 transitions, 1245 flow [2025-02-06 13:02:08,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1245, PETRI_PLACES=167, PETRI_TRANSITIONS=122} [2025-02-06 13:02:08,221 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 105 predicate places. [2025-02-06 13:02:08,221 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 122 transitions, 1245 flow [2025-02-06 13:02:08,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:02:08,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:08,221 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:02:08,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 13:02:08,223 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:02:08,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:08,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1968092553, now seen corresponding path program 3 times [2025-02-06 13:02:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:08,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94353797] [2025-02-06 13:02:08,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:02:08,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:08,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 6 equivalence classes. [2025-02-06 13:02:08,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 47 statements. [2025-02-06 13:02:08,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 13:02:08,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:02:08,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:08,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94353797] [2025-02-06 13:02:08,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94353797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:02:08,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:02:08,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 13:02:08,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327134818] [2025-02-06 13:02:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:02:08,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:02:08,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:08,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:02:08,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:02:08,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-02-06 13:02:08,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 122 transitions, 1245 flow. Second operand has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:02:08,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:08,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-02-06 13:02:08,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:12,538 INFO L124 PetriNetUnfolderBase]: 14443/29061 cut-off events. [2025-02-06 13:02:12,539 INFO L125 PetriNetUnfolderBase]: For 111849/111877 co-relation queries the response was YES. [2025-02-06 13:02:12,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102094 conditions, 29061 events. 14443/29061 cut-off events. For 111849/111877 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 243800 event pairs, 11377 based on Foata normal form. 8/29026 useless extension candidates. Maximal degree in co-relation 101928. Up to 18351 conditions per place. [2025-02-06 13:02:12,980 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 178 selfloop transitions, 45 changer transitions 0/240 dead transitions. [2025-02-06 13:02:12,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 240 transitions, 2511 flow [2025-02-06 13:02:12,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 13:02:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 13:02:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 586 transitions. [2025-02-06 13:02:12,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341991341991342 [2025-02-06 13:02:12,984 INFO L175 Difference]: Start difference. First operand has 167 places, 122 transitions, 1245 flow. Second operand 14 states and 586 transitions. [2025-02-06 13:02:12,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 240 transitions, 2511 flow [2025-02-06 13:02:13,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 240 transitions, 2380 flow, removed 30 selfloop flow, removed 5 redundant places. [2025-02-06 13:02:13,186 INFO L231 Difference]: Finished difference. Result has 185 places, 143 transitions, 1606 flow [2025-02-06 13:02:13,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1606, PETRI_PLACES=185, PETRI_TRANSITIONS=143} [2025-02-06 13:02:13,190 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 123 predicate places. [2025-02-06 13:02:13,190 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 143 transitions, 1606 flow [2025-02-06 13:02:13,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:02:13,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:13,190 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:02:13,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 13:02:13,191 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:02:13,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:13,191 INFO L85 PathProgramCache]: Analyzing trace with hash 15538207, now seen corresponding path program 4 times [2025-02-06 13:02:13,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:13,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703115952] [2025-02-06 13:02:13,191 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:02:13,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:13,201 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-02-06 13:02:13,209 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 47 statements. [2025-02-06 13:02:13,209 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 13:02:13,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:02:13,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:13,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703115952] [2025-02-06 13:02:13,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703115952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:02:13,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:02:13,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 13:02:13,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117618008] [2025-02-06 13:02:13,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:02:13,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:02:13,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:13,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:02:13,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:02:13,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-02-06 13:02:13,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 143 transitions, 1606 flow. Second operand has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:02:13,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:13,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-02-06 13:02:13,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:17,669 INFO L124 PetriNetUnfolderBase]: 14564/29396 cut-off events. [2025-02-06 13:02:17,669 INFO L125 PetriNetUnfolderBase]: For 127223/127299 co-relation queries the response was YES. [2025-02-06 13:02:18,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107076 conditions, 29396 events. 14564/29396 cut-off events. For 127223/127299 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 248199 event pairs, 10819 based on Foata normal form. 9/29366 useless extension candidates. Maximal degree in co-relation 106900. Up to 18378 conditions per place. [2025-02-06 13:02:18,108 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 206 selfloop transitions, 48 changer transitions 0/271 dead transitions. [2025-02-06 13:02:18,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 271 transitions, 3173 flow [2025-02-06 13:02:18,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 13:02:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 13:02:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 519 transitions. [2025-02-06 13:02:18,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6553030303030303 [2025-02-06 13:02:18,110 INFO L175 Difference]: Start difference. First operand has 185 places, 143 transitions, 1606 flow. Second operand 12 states and 519 transitions. [2025-02-06 13:02:18,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 271 transitions, 3173 flow [2025-02-06 13:02:18,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 271 transitions, 3052 flow, removed 59 selfloop flow, removed 2 redundant places. [2025-02-06 13:02:18,408 INFO L231 Difference]: Finished difference. Result has 201 places, 154 transitions, 1879 flow [2025-02-06 13:02:18,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1879, PETRI_PLACES=201, PETRI_TRANSITIONS=154} [2025-02-06 13:02:18,409 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 139 predicate places. [2025-02-06 13:02:18,409 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 154 transitions, 1879 flow [2025-02-06 13:02:18,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:02:18,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:18,409 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:02:18,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 13:02:18,409 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:02:18,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:18,410 INFO L85 PathProgramCache]: Analyzing trace with hash -598850835, now seen corresponding path program 5 times [2025-02-06 13:02:18,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:18,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570802636] [2025-02-06 13:02:18,410 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:02:18,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:18,417 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 6 equivalence classes. [2025-02-06 13:02:18,432 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 13:02:18,432 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-06 13:02:18,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-06 13:02:18,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:18,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570802636] [2025-02-06 13:02:18,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570802636] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:02:18,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132987027] [2025-02-06 13:02:18,860 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:02:18,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:18,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:02:18,863 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:02:18,864 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:02:18,936 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 6 equivalence classes. [2025-02-06 13:02:19,001 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 13:02:19,001 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-06 13:02:19,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:19,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 13:02:19,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:02:19,235 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-02-06 13:02:19,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2025-02-06 13:02:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:02:19,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:02:19,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132987027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:02:19,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:02:19,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2025-02-06 13:02:19,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216437520] [2025-02-06 13:02:19,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:02:19,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:02:19,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:19,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:02:19,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-02-06 13:02:19,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-02-06 13:02:19,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 154 transitions, 1879 flow. Second operand has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:02:19,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:19,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-02-06 13:02:19,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:23,930 INFO L124 PetriNetUnfolderBase]: 14753/29864 cut-off events. [2025-02-06 13:02:23,931 INFO L125 PetriNetUnfolderBase]: For 128890/128918 co-relation queries the response was YES. [2025-02-06 13:02:24,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106587 conditions, 29864 events. 14753/29864 cut-off events. For 128890/128918 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 252397 event pairs, 11108 based on Foata normal form. 9/29826 useless extension candidates. Maximal degree in co-relation 106405. Up to 18546 conditions per place. [2025-02-06 13:02:24,484 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 175 selfloop transitions, 58 changer transitions 0/250 dead transitions. [2025-02-06 13:02:24,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 250 transitions, 3066 flow [2025-02-06 13:02:24,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 13:02:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 13:02:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 477 transitions. [2025-02-06 13:02:24,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6570247933884298 [2025-02-06 13:02:24,485 INFO L175 Difference]: Start difference. First operand has 201 places, 154 transitions, 1879 flow. Second operand 11 states and 477 transitions. [2025-02-06 13:02:24,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 250 transitions, 3066 flow [2025-02-06 13:02:24,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 250 transitions, 2978 flow, removed 16 selfloop flow, removed 3 redundant places. [2025-02-06 13:02:24,761 INFO L231 Difference]: Finished difference. Result has 215 places, 172 transitions, 2222 flow [2025-02-06 13:02:24,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2222, PETRI_PLACES=215, PETRI_TRANSITIONS=172} [2025-02-06 13:02:24,763 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 153 predicate places. [2025-02-06 13:02:24,763 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 172 transitions, 2222 flow [2025-02-06 13:02:24,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:02:24,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:24,763 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:02:24,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 13:02:24,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:24,964 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-06 13:02:24,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:24,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1774283903, now seen corresponding path program 6 times [2025-02-06 13:02:24,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:24,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837527077] [2025-02-06 13:02:24,965 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:02:24,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:24,971 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 6 equivalence classes. [2025-02-06 13:02:24,979 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 27 of 47 statements. [2025-02-06 13:02:24,979 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 13:02:24,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:02:25,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:25,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837527077] [2025-02-06 13:02:25,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837527077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:02:25,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:02:25,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 13:02:25,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374753306] [2025-02-06 13:02:25,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:02:25,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:02:25,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:25,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:02:25,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:02:25,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-02-06 13:02:25,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 172 transitions, 2222 flow. Second operand has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:02:25,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:25,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-02-06 13:02:25,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand