./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-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-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 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:01:14,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:01:14,567 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:14,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:01:14,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:01:14,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:01:14,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:01:14,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:01:14,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:01:14,593 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:01:14,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:01:14,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:01:14,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:01:14,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:01:14,593 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:01:14,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:01:14,594 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:01:14,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:01:14,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:01:14,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:01:14,594 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:01:14,594 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:01:14,594 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:01:14,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:01:14,594 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:01:14,594 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:01:14,594 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:01:14,595 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:01:14,595 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:01:14,595 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:01:14,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:01:14,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:01:14,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:01:14,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:01:14,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:01:14,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:01:14,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:01:14,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:01:14,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:01:14,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:01:14,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:01:14,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:01:14,596 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 -> 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa [2025-02-06 13:01:14,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:01:14,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:01:14,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:01:14,825 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:01:14,825 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:01:14,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2025-02-06 13:01:15,931 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58119aacd/db3df0ded41d448faa89e39a29c8f645/FLAG7bc04003b [2025-02-06 13:01:16,193 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:01:16,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2025-02-06 13:01:16,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58119aacd/db3df0ded41d448faa89e39a29c8f645/FLAG7bc04003b [2025-02-06 13:01:16,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58119aacd/db3df0ded41d448faa89e39a29c8f645 [2025-02-06 13:01:16,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:01:16,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:01:16,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:01:16,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:01:16,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:01:16,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:01:16" (1/1) ... [2025-02-06 13:01:16,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d327a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:16, skipping insertion in model container [2025-02-06 13:01:16,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:01:16" (1/1) ... [2025-02-06 13:01:16,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:01:16,772 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:16,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:01:16,791 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:01:16,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:01:16,852 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:01:16,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:16 WrapperNode [2025-02-06 13:01:16,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:01:16,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:01:16,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:01:16,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:01:16,859 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:16" (1/1) ... [2025-02-06 13:01:16,864 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:16" (1/1) ... [2025-02-06 13:01:16,884 INFO L138 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 181 [2025-02-06 13:01:16,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:01:16,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:01:16,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:01:16,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:01:16,891 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:16" (1/1) ... [2025-02-06 13:01:16,891 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:16" (1/1) ... [2025-02-06 13:01:16,893 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:16" (1/1) ... [2025-02-06 13:01:16,901 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 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:16,901 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:16" (1/1) ... [2025-02-06 13:01:16,901 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:16" (1/1) ... [2025-02-06 13:01:16,906 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:16" (1/1) ... [2025-02-06 13:01:16,906 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:16" (1/1) ... [2025-02-06 13:01:16,907 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:16" (1/1) ... [2025-02-06 13:01:16,908 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:16" (1/1) ... [2025-02-06 13:01:16,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:01:16,910 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:01:16,910 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:01:16,910 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:01:16,911 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:16" (1/1) ... [2025-02-06 13:01:16,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:01:16,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:16,934 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:16,936 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:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:01:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 13:01:16,952 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 13:01:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 13:01:16,952 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 13:01:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:01:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:01:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:01:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:01:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:01:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:01:16,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:01:16,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:01:16,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:01:16,953 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:17,017 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:01:17,019 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:01:17,268 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:01:17,269 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:01:17,435 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:01:17,435 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:01:17,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:01:17 BoogieIcfgContainer [2025-02-06 13:01:17,435 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:01:17,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:01:17,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:01:17,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:01:17,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:01:16" (1/3) ... [2025-02-06 13:01:17,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18effb73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:01:17, skipping insertion in model container [2025-02-06 13:01:17,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:16" (2/3) ... [2025-02-06 13:01:17,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18effb73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:01:17, skipping insertion in model container [2025-02-06 13:01:17,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:01:17" (3/3) ... [2025-02-06 13:01:17,443 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2025-02-06 13:01:17,454 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:01:17,455 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-symm.wvr.c that has 3 procedures, 39 locations, 1 initial locations, 4 loop locations, and 14 error locations. [2025-02-06 13:01:17,455 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:01:17,498 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 13:01:17,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 42 transitions, 98 flow [2025-02-06 13:01:17,556 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2025-02-06 13:01:17,558 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:01:17,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 40 events. 4/40 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 87 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-02-06 13:01:17,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 42 transitions, 98 flow [2025-02-06 13:01:17,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 39 transitions, 90 flow [2025-02-06 13:01:17,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:01:17,580 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;@2b0f4fcb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:01:17,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-02-06 13:01:17,585 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:01:17,586 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 13:01:17,586 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:01:17,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:17,586 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:01:17,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:17,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:17,591 INFO L85 PathProgramCache]: Analyzing trace with hash 551281, now seen corresponding path program 1 times [2025-02-06 13:01:17,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:17,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663929977] [2025-02-06 13:01:17,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:17,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:17,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:01:17,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:01:17,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:17,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:17,730 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:17,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:17,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663929977] [2025-02-06 13:01:17,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663929977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:17,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:17,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:01:17,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103226778] [2025-02-06 13:01:17,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:17,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:01:17,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:17,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:01:17,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:01:17,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-06 13:01:17,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:17,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-06 13:01:17,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:17,844 INFO L124 PetriNetUnfolderBase]: 39/118 cut-off events. [2025-02-06 13:01:17,845 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 13:01:17,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 118 events. 39/118 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 429 event pairs, 22 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 162. Up to 68 conditions per place. [2025-02-06 13:01:17,846 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 18 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-02-06 13:01:17,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 122 flow [2025-02-06 13:01:17,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:01:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:01:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-02-06 13:01:17,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-02-06 13:01:17,859 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 90 flow. Second operand 3 states and 77 transitions. [2025-02-06 13:01:17,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 122 flow [2025-02-06 13:01:17,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 35 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:01:17,867 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 78 flow [2025-02-06 13:01:17,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2025-02-06 13:01:17,875 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -6 predicate places. [2025-02-06 13:01:17,875 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 78 flow [2025-02-06 13:01:17,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:17,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:01:17,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:01:17,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:17,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash 551282, now seen corresponding path program 1 times [2025-02-06 13:01:17,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:17,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399452762] [2025-02-06 13:01:17,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:17,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:01:17,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:01:17,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:17,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:18,094 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:18,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:18,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399452762] [2025-02-06 13:01:18,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399452762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:18,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:18,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:01:18,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688611185] [2025-02-06 13:01:18,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:18,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:18,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:18,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:18,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:18,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-06 13:01:18,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:18,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-06 13:01:18,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:18,254 INFO L124 PetriNetUnfolderBase]: 39/122 cut-off events. [2025-02-06 13:01:18,254 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:01:18,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 122 events. 39/122 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 425 event pairs, 22 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 179. Up to 76 conditions per place. [2025-02-06 13:01:18,256 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 22 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2025-02-06 13:01:18,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 138 flow [2025-02-06 13:01:18,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:01:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:01:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-02-06 13:01:18,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-06 13:01:18,258 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 78 flow. Second operand 3 states and 84 transitions. [2025-02-06 13:01:18,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 138 flow [2025-02-06 13:01:18,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:01:18,260 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 100 flow [2025-02-06 13:01:18,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2025-02-06 13:01:18,261 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2025-02-06 13:01:18,261 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 100 flow [2025-02-06 13:01:18,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:18,262 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 13:01:18,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:01:18,263 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:18,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:18,263 INFO L85 PathProgramCache]: Analyzing trace with hash 529799929, now seen corresponding path program 1 times [2025-02-06 13:01:18,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:18,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228566626] [2025-02-06 13:01:18,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:18,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:18,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:01:18,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:01:18,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:18,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:18,471 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:18,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:18,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228566626] [2025-02-06 13:01:18,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228566626] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:18,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136083526] [2025-02-06 13:01:18,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:18,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:18,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:18,479 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:18,490 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:18,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:01:18,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:01:18,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:18,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:18,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 13:01:18,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:18,573 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,608 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:18,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:18,671 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:18,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136083526] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:18,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:18,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-02-06 13:01:18,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656040560] [2025-02-06 13:01:18,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:18,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:01:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:18,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:01:18,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:01:18,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-06 13:01:18,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 100 flow. Second operand has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 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,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:18,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-06 13:01:18,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:18,940 INFO L124 PetriNetUnfolderBase]: 43/138 cut-off events. [2025-02-06 13:01:18,940 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:01:18,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 138 events. 43/138 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 473 event pairs, 22 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 211. Up to 78 conditions per place. [2025-02-06 13:01:18,941 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 28 selfloop transitions, 14 changer transitions 0/55 dead transitions. [2025-02-06 13:01:18,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 242 flow [2025-02-06 13:01:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:01:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:01:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2025-02-06 13:01:18,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2025-02-06 13:01:18,943 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 100 flow. Second operand 6 states and 158 transitions. [2025-02-06 13:01:18,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 242 flow [2025-02-06 13:01:18,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:01:18,945 INFO L231 Difference]: Finished difference. Result has 44 places, 47 transitions, 198 flow [2025-02-06 13:01:18,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=44, PETRI_TRANSITIONS=47} [2025-02-06 13:01:18,945 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2025-02-06 13:01:18,946 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 47 transitions, 198 flow [2025-02-06 13:01:18,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 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,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:18,946 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-02-06 13:01:18,952 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:19,146 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:19,147 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:19,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:19,148 INFO L85 PathProgramCache]: Analyzing trace with hash -765506290, now seen corresponding path program 2 times [2025-02-06 13:01:19,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:19,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271222953] [2025-02-06 13:01:19,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:01:19,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:19,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 13:01:19,166 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:19,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:01:19,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:19,406 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:19,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:19,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271222953] [2025-02-06 13:01:19,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271222953] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:19,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63534989] [2025-02-06 13:01:19,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:01:19,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:19,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:19,413 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:19,414 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:19,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 13:01:19,464 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:19,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:01:19,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:19,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 13:01:19,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:19,472 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:19,581 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,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:19,679 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,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63534989] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:19,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:19,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-02-06 13:01:19,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199010841] [2025-02-06 13:01:19,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:19,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 13:01:19,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:19,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 13:01:19,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-02-06 13:01:19,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-06 13:01:19,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 47 transitions, 198 flow. Second operand has 18 states, 18 states have (on average 19.833333333333332) internal successors, (357), 18 states have internal predecessors, (357), 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,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:19,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-06 13:01:19,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:20,234 INFO L124 PetriNetUnfolderBase]: 39/136 cut-off events. [2025-02-06 13:01:20,237 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-06 13:01:20,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 136 events. 39/136 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 422 event pairs, 22 based on Foata normal form. 10/122 useless extension candidates. Maximal degree in co-relation 209. Up to 68 conditions per place. [2025-02-06 13:01:20,239 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 23 selfloop transitions, 17 changer transitions 0/53 dead transitions. [2025-02-06 13:01:20,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 262 flow [2025-02-06 13:01:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:01:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:01:20,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2025-02-06 13:01:20,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608465608465608 [2025-02-06 13:01:20,240 INFO L175 Difference]: Start difference. First operand has 44 places, 47 transitions, 198 flow. Second operand 9 states and 212 transitions. [2025-02-06 13:01:20,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 262 flow [2025-02-06 13:01:20,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 220 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-02-06 13:01:20,241 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 170 flow [2025-02-06 13:01:20,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=170, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2025-02-06 13:01:20,242 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2025-02-06 13:01:20,242 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 170 flow [2025-02-06 13:01:20,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.833333333333332) internal successors, (357), 18 states have internal predecessors, (357), 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,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:20,242 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:20,252 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:20,449 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:20,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:20,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:20,450 INFO L85 PathProgramCache]: Analyzing trace with hash -247269669, now seen corresponding path program 1 times [2025-02-06 13:01:20,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:20,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841225348] [2025-02-06 13:01:20,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:20,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:20,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:01:20,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:01:20,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:20,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:20,649 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:20,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:20,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841225348] [2025-02-06 13:01:20,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841225348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:20,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:20,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:01:20,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817915463] [2025-02-06 13:01:20,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:20,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:01:20,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:20,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:01:20,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:01:20,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2025-02-06 13:01:20,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:20,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2025-02-06 13:01:20,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:20,739 INFO L124 PetriNetUnfolderBase]: 50/157 cut-off events. [2025-02-06 13:01:20,739 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-06 13:01:20,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 157 events. 50/157 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 543 event pairs, 31 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 220. Up to 86 conditions per place. [2025-02-06 13:01:20,740 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 30 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2025-02-06 13:01:20,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 232 flow [2025-02-06 13:01:20,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:01:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:01:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-02-06 13:01:20,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-02-06 13:01:20,742 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 170 flow. Second operand 5 states and 98 transitions. [2025-02-06 13:01:20,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 232 flow [2025-02-06 13:01:20,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 200 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-02-06 13:01:20,745 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 140 flow [2025-02-06 13:01:20,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2025-02-06 13:01:20,745 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2025-02-06 13:01:20,746 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 140 flow [2025-02-06 13:01:20,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:20,746 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:20,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:01:20,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:20,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:20,747 INFO L85 PathProgramCache]: Analyzing trace with hash -247269668, now seen corresponding path program 1 times [2025-02-06 13:01:20,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:20,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817160154] [2025-02-06 13:01:20,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:20,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:20,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:01:20,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:01:20,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:20,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:21,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:21,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817160154] [2025-02-06 13:01:21,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817160154] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:21,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131239154] [2025-02-06 13:01:21,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:21,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:21,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:21,214 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:21,216 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:21,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:01:21,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:01:21,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:21,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:21,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 13:01:21,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:21,310 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:21,313 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:21,434 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 13:01:21,434 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:21,454 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:01:21,454 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:21,768 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:21,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:22,120 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:22,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131239154] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:22,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:01:22,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 24 [2025-02-06 13:01:22,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105525094] [2025-02-06 13:01:22,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:22,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:01:22,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:22,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:01:22,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2025-02-06 13:01:22,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-06 13:01:22,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 140 flow. Second operand has 10 states, 10 states have (on average 19.8) internal successors, (198), 10 states have internal predecessors, (198), 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,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:22,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-06 13:01:22,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:22,431 INFO L124 PetriNetUnfolderBase]: 86/234 cut-off events. [2025-02-06 13:01:22,431 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:01:22,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 234 events. 86/234 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 920 event pairs, 31 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 365. Up to 78 conditions per place. [2025-02-06 13:01:22,433 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 39 selfloop transitions, 6 changer transitions 0/54 dead transitions. [2025-02-06 13:01:22,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 255 flow [2025-02-06 13:01:22,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:01:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:01:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2025-02-06 13:01:22,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2025-02-06 13:01:22,434 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 140 flow. Second operand 6 states and 142 transitions. [2025-02-06 13:01:22,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 255 flow [2025-02-06 13:01:22,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 250 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:01:22,435 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 160 flow [2025-02-06 13:01:22,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2025-02-06 13:01:22,436 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2025-02-06 13:01:22,436 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 160 flow [2025-02-06 13:01:22,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.8) internal successors, (198), 10 states have internal predecessors, (198), 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,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:22,436 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:22,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 13:01:22,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:22,637 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:22,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:22,637 INFO L85 PathProgramCache]: Analyzing trace with hash 924575380, now seen corresponding path program 1 times [2025-02-06 13:01:22,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:22,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818257189] [2025-02-06 13:01:22,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:22,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:22,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 13:01:22,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:01:22,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:22,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:22,860 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:22,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:22,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818257189] [2025-02-06 13:01:22,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818257189] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:22,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611455418] [2025-02-06 13:01:22,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:22,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:22,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:22,863 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:22,870 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:22,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 13:01:22,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:01:22,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:22,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:22,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 13:01:22,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:23,062 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:23,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:23,115 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:23,197 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:23,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611455418] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:23,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:23,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2025-02-06 13:01:23,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078431966] [2025-02-06 13:01:23,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:23,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 13:01:23,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:23,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 13:01:23,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-02-06 13:01:23,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-02-06 13:01:23,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 160 flow. Second operand has 21 states, 21 states have (on average 20.904761904761905) internal successors, (439), 21 states have internal predecessors, (439), 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,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:23,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-02-06 13:01:23,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:23,839 INFO L124 PetriNetUnfolderBase]: 100/297 cut-off events. [2025-02-06 13:01:23,839 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-02-06 13:01:23,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 297 events. 100/297 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1289 event pairs, 31 based on Foata normal form. 16/293 useless extension candidates. Maximal degree in co-relation 555. Up to 86 conditions per place. [2025-02-06 13:01:23,840 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 49 selfloop transitions, 14 changer transitions 0/74 dead transitions. [2025-02-06 13:01:23,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 376 flow [2025-02-06 13:01:23,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:01:23,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 13:01:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 251 transitions. [2025-02-06 13:01:23,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5976190476190476 [2025-02-06 13:01:23,842 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 160 flow. Second operand 10 states and 251 transitions. [2025-02-06 13:01:23,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 376 flow [2025-02-06 13:01:23,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 366 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:01:23,843 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 200 flow [2025-02-06 13:01:23,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=200, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2025-02-06 13:01:23,844 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2025-02-06 13:01:23,844 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 200 flow [2025-02-06 13:01:23,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 20.904761904761905) internal successors, (439), 21 states have internal predecessors, (439), 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,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:23,844 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:23,850 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:24,045 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:24,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:24,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:24,046 INFO L85 PathProgramCache]: Analyzing trace with hash 924575379, now seen corresponding path program 1 times [2025-02-06 13:01:24,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:24,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734719725] [2025-02-06 13:01:24,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:24,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:24,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 13:01:24,076 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,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:24,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:24,121 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,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:24,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734719725] [2025-02-06 13:01:24,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734719725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:24,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:24,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:01:24,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400120443] [2025-02-06 13:01:24,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:24,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:24,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:24,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:24,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:24,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2025-02-06 13:01:24,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:24,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2025-02-06 13:01:24,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:24,208 INFO L124 PetriNetUnfolderBase]: 113/289 cut-off events. [2025-02-06 13:01:24,208 INFO L125 PetriNetUnfolderBase]: For 205/210 co-relation queries the response was YES. [2025-02-06 13:01:24,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 289 events. 113/289 cut-off events. For 205/210 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1174 event pairs, 84 based on Foata normal form. 21/301 useless extension candidates. Maximal degree in co-relation 613. Up to 200 conditions per place. [2025-02-06 13:01:24,210 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 33 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2025-02-06 13:01:24,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 266 flow [2025-02-06 13:01:24,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:01:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:01:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-02-06 13:01:24,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2025-02-06 13:01:24,211 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 200 flow. Second operand 4 states and 83 transitions. [2025-02-06 13:01:24,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 266 flow [2025-02-06 13:01:24,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 245 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:01:24,212 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 179 flow [2025-02-06 13:01:24,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-02-06 13:01:24,213 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2025-02-06 13:01:24,213 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 179 flow [2025-02-06 13:01:24,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:24,213 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:24,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:01:24,213 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:24,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:24,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1425420073, now seen corresponding path program 1 times [2025-02-06 13:01:24,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:24,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141468583] [2025-02-06 13:01:24,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:24,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:24,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:01:24,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:01:24,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:24,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:24,409 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,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:24,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141468583] [2025-02-06 13:01:24,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141468583] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:24,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542318098] [2025-02-06 13:01:24,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:24,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:24,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:24,411 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,414 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,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:01:24,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:01:24,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:24,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:24,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 13:01:24,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:24,601 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:24,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:24,669 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:24,806 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:24,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542318098] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:24,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:24,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2025-02-06 13:01:24,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720669698] [2025-02-06 13:01:24,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:24,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 13:01:24,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:24,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 13:01:24,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-02-06 13:01:25,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-06 13:01:25,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 179 flow. Second operand has 21 states, 21 states have (on average 20.19047619047619) internal successors, (424), 21 states have internal predecessors, (424), 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,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:25,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-06 13:01:25,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:25,331 INFO L124 PetriNetUnfolderBase]: 257/593 cut-off events. [2025-02-06 13:01:25,332 INFO L125 PetriNetUnfolderBase]: For 479/496 co-relation queries the response was YES. [2025-02-06 13:01:25,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1428 conditions, 593 events. 257/593 cut-off events. For 479/496 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2875 event pairs, 84 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1331. Up to 183 conditions per place. [2025-02-06 13:01:25,334 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 52 selfloop transitions, 15 changer transitions 0/75 dead transitions. [2025-02-06 13:01:25,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 443 flow [2025-02-06 13:01:25,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:01:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 13:01:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 239 transitions. [2025-02-06 13:01:25,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.569047619047619 [2025-02-06 13:01:25,336 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 179 flow. Second operand 10 states and 239 transitions. [2025-02-06 13:01:25,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 443 flow [2025-02-06 13:01:25,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 75 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:01:25,337 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 225 flow [2025-02-06 13:01:25,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=225, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-02-06 13:01:25,338 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2025-02-06 13:01:25,338 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 225 flow [2025-02-06 13:01:25,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 20.19047619047619) internal successors, (424), 21 states have internal predecessors, (424), 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,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:25,338 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:25,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 13:01:25,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:25,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:25,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:25,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1238348798, now seen corresponding path program 1 times [2025-02-06 13:01:25,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:25,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559216796] [2025-02-06 13:01:25,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:25,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:25,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:01:25,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:01:25,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:25,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:25,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:25,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559216796] [2025-02-06 13:01:25,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559216796] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:25,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184294506] [2025-02-06 13:01:25,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:25,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:25,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:25,824 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:25,825 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:25,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:01:25,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:01:25,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:25,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:25,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-06 13:01:25,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:25,914 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:25,966 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 13:01:25,966 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 12 treesize of output 14 [2025-02-06 13:01:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:26,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:26,483 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:26,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184294506] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:26,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:01:26,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 9] total 25 [2025-02-06 13:01:26,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387419256] [2025-02-06 13:01:26,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:26,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:01:26,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:26,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:01:26,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2025-02-06 13:01:26,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-02-06 13:01:26,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 225 flow. Second operand has 10 states, 10 states have (on average 21.0) internal successors, (210), 10 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:26,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:26,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-02-06 13:01:26,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:26,777 INFO L124 PetriNetUnfolderBase]: 206/516 cut-off events. [2025-02-06 13:01:26,777 INFO L125 PetriNetUnfolderBase]: For 534/547 co-relation queries the response was YES. [2025-02-06 13:01:26,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 516 events. 206/516 cut-off events. For 534/547 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2507 event pairs, 128 based on Foata normal form. 17/521 useless extension candidates. Maximal degree in co-relation 1292. Up to 271 conditions per place. [2025-02-06 13:01:26,780 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 41 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2025-02-06 13:01:26,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 56 transitions, 363 flow [2025-02-06 13:01:26,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:01:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:01:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-02-06 13:01:26,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5753968253968254 [2025-02-06 13:01:26,782 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 225 flow. Second operand 6 states and 145 transitions. [2025-02-06 13:01:26,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 56 transitions, 363 flow [2025-02-06 13:01:26,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 342 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:01:26,784 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 218 flow [2025-02-06 13:01:26,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-02-06 13:01:26,785 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2025-02-06 13:01:26,785 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 218 flow [2025-02-06 13:01:26,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.0) internal successors, (210), 10 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:26,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:26,785 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:26,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 13:01:26,991 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,SelfDestructingSolverStorable9 [2025-02-06 13:01:26,991 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:26,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:26,991 INFO L85 PathProgramCache]: Analyzing trace with hash -541271463, now seen corresponding path program 1 times [2025-02-06 13:01:26,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:26,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146806797] [2025-02-06 13:01:26,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:26,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:27,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:01:27,009 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,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:27,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:27,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:27,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146806797] [2025-02-06 13:01:27,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146806797] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:27,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585830765] [2025-02-06 13:01:27,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:27,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:27,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:27,302 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:27,307 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:27,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:01:27,382 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,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:27,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:27,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 13:01:27,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:27,390 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:27,394 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:27,462 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 13:01:27,462 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:27,476 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:01:27,477 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:27,762 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:27,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:28,052 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:28,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585830765] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:28,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:28,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2025-02-06 13:01:28,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518313256] [2025-02-06 13:01:28,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:28,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 13:01:28,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:28,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 13:01:28,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2025-02-06 13:01:28,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2025-02-06 13:01:28,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 218 flow. Second operand has 29 states, 29 states have (on average 16.06896551724138) internal successors, (466), 29 states have internal predecessors, (466), 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:28,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:28,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2025-02-06 13:01:28,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:29,413 INFO L124 PetriNetUnfolderBase]: 382/897 cut-off events. [2025-02-06 13:01:29,414 INFO L125 PetriNetUnfolderBase]: For 1191/1217 co-relation queries the response was YES. [2025-02-06 13:01:29,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2511 conditions, 897 events. 382/897 cut-off events. For 1191/1217 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4843 event pairs, 72 based on Foata normal form. 48/934 useless extension candidates. Maximal degree in co-relation 2407. Up to 160 conditions per place. [2025-02-06 13:01:29,420 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 77 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2025-02-06 13:01:29,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 102 transitions, 632 flow [2025-02-06 13:01:29,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 13:01:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-06 13:01:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 326 transitions. [2025-02-06 13:01:29,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4565826330532213 [2025-02-06 13:01:29,422 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 218 flow. Second operand 17 states and 326 transitions. [2025-02-06 13:01:29,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 102 transitions, 632 flow [2025-02-06 13:01:29,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 102 transitions, 606 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 13:01:29,426 INFO L231 Difference]: Finished difference. Result has 73 places, 48 transitions, 273 flow [2025-02-06 13:01:29,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=273, PETRI_PLACES=73, PETRI_TRANSITIONS=48} [2025-02-06 13:01:29,427 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2025-02-06 13:01:29,427 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 48 transitions, 273 flow [2025-02-06 13:01:29,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 16.06896551724138) internal successors, (466), 29 states have internal predecessors, (466), 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,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:29,427 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:29,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 13:01:29,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:29,628 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:29,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2120618354, now seen corresponding path program 1 times [2025-02-06 13:01:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:29,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902441015] [2025-02-06 13:01:29,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:29,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:29,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 13:01:29,657 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,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:29,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:29,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:29,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902441015] [2025-02-06 13:01:29,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902441015] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:29,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746191814] [2025-02-06 13:01:29,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:29,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:29,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:29,893 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:29,894 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:29,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 13:01:29,989 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,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:29,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:29,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 13:01:29,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:29,998 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,002 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,052 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 13:01:30,053 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,066 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:01:30,066 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,357 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:30,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:30,638 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:30,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746191814] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:30,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:30,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2025-02-06 13:01:30,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861097256] [2025-02-06 13:01:30,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:30,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 13:01:30,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:30,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 13:01:30,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2025-02-06 13:01:31,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2025-02-06 13:01:31,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 48 transitions, 273 flow. Second operand has 28 states, 28 states have (on average 17.25) internal successors, (483), 28 states have internal predecessors, (483), 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:31,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:31,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2025-02-06 13:01:31,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:31,989 INFO L124 PetriNetUnfolderBase]: 456/1217 cut-off events. [2025-02-06 13:01:31,989 INFO L125 PetriNetUnfolderBase]: For 2098/2144 co-relation queries the response was YES. [2025-02-06 13:01:31,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3527 conditions, 1217 events. 456/1217 cut-off events. For 2098/2144 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 7694 event pairs, 138 based on Foata normal form. 81/1258 useless extension candidates. Maximal degree in co-relation 3411. Up to 306 conditions per place. [2025-02-06 13:01:32,003 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 76 selfloop transitions, 16 changer transitions 0/103 dead transitions. [2025-02-06 13:01:32,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 103 transitions, 791 flow [2025-02-06 13:01:32,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 13:01:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-06 13:01:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 331 transitions. [2025-02-06 13:01:32,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4635854341736695 [2025-02-06 13:01:32,008 INFO L175 Difference]: Start difference. First operand has 73 places, 48 transitions, 273 flow. Second operand 17 states and 331 transitions. [2025-02-06 13:01:32,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 103 transitions, 791 flow [2025-02-06 13:01:32,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 103 transitions, 723 flow, removed 10 selfloop flow, removed 8 redundant places. [2025-02-06 13:01:32,016 INFO L231 Difference]: Finished difference. Result has 84 places, 51 transitions, 309 flow [2025-02-06 13:01:32,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=309, PETRI_PLACES=84, PETRI_TRANSITIONS=51} [2025-02-06 13:01:32,017 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2025-02-06 13:01:32,017 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 51 transitions, 309 flow [2025-02-06 13:01:32,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 17.25) internal successors, (483), 28 states have internal predecessors, (483), 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,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:32,017 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:32,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 13:01:32,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:32,218 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:32,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:32,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1483714636, now seen corresponding path program 1 times [2025-02-06 13:01:32,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:32,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500470108] [2025-02-06 13:01:32,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:32,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:32,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 13:01:32,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 13:01:32,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:32,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:32,489 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 13:01:32,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:32,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500470108] [2025-02-06 13:01:32,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500470108] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:32,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219064145] [2025-02-06 13:01:32,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:32,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:32,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:32,491 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:32,494 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:32,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 13:01:32,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 13:01:32,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:32,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:32,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 13:01:32,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:32,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:32,823 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:32,912 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:32,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219064145] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:32,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:32,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 27 [2025-02-06 13:01:32,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750474570] [2025-02-06 13:01:32,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:32,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 13:01:32,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:32,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 13:01:32,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2025-02-06 13:01:33,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-02-06 13:01:33,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 51 transitions, 309 flow. Second operand has 28 states, 28 states have (on average 20.678571428571427) internal successors, (579), 28 states have internal predecessors, (579), 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,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:33,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-02-06 13:01:33,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:34,140 INFO L124 PetriNetUnfolderBase]: 559/1433 cut-off events. [2025-02-06 13:01:34,140 INFO L125 PetriNetUnfolderBase]: For 3175/3210 co-relation queries the response was YES. [2025-02-06 13:01:34,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4516 conditions, 1433 events. 559/1433 cut-off events. For 3175/3210 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8973 event pairs, 110 based on Foata normal form. 72/1475 useless extension candidates. Maximal degree in co-relation 4395. Up to 270 conditions per place. [2025-02-06 13:01:34,148 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 103 selfloop transitions, 17 changer transitions 0/131 dead transitions. [2025-02-06 13:01:34,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 131 transitions, 974 flow [2025-02-06 13:01:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 13:01:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 13:01:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 342 transitions. [2025-02-06 13:01:34,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6263736263736264 [2025-02-06 13:01:34,151 INFO L175 Difference]: Start difference. First operand has 84 places, 51 transitions, 309 flow. Second operand 13 states and 342 transitions. [2025-02-06 13:01:34,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 131 transitions, 974 flow [2025-02-06 13:01:34,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 131 transitions, 941 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-02-06 13:01:34,157 INFO L231 Difference]: Finished difference. Result has 87 places, 53 transitions, 352 flow [2025-02-06 13:01:34,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=352, PETRI_PLACES=87, PETRI_TRANSITIONS=53} [2025-02-06 13:01:34,158 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2025-02-06 13:01:34,158 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 53 transitions, 352 flow [2025-02-06 13:01:34,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 20.678571428571427) internal successors, (579), 28 states have internal predecessors, (579), 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,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:34,159 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:34,166 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:34,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:34,360 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:34,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:34,360 INFO L85 PathProgramCache]: Analyzing trace with hash 66882151, now seen corresponding path program 1 times [2025-02-06 13:01:34,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:34,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828910629] [2025-02-06 13:01:34,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:34,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:34,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 13:01:34,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:01:34,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:34,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:34,457 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,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:34,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828910629] [2025-02-06 13:01:34,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828910629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:34,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:34,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:01:34,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354907279] [2025-02-06 13:01:34,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:34,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:34,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:34,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:34,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:34,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-02-06 13:01:34,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 53 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:34,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-02-06 13:01:34,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:34,614 INFO L124 PetriNetUnfolderBase]: 522/1406 cut-off events. [2025-02-06 13:01:34,615 INFO L125 PetriNetUnfolderBase]: For 3437/3479 co-relation queries the response was YES. [2025-02-06 13:01:34,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4552 conditions, 1406 events. 522/1406 cut-off events. For 3437/3479 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 9068 event pairs, 380 based on Foata normal form. 2/1372 useless extension candidates. Maximal degree in co-relation 4427. Up to 822 conditions per place. [2025-02-06 13:01:34,622 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 60 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-02-06 13:01:34,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 75 transitions, 658 flow [2025-02-06 13:01:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:01:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:01:34,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-02-06 13:01:34,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-02-06 13:01:34,624 INFO L175 Difference]: Start difference. First operand has 87 places, 53 transitions, 352 flow. Second operand 4 states and 114 transitions. [2025-02-06 13:01:34,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 75 transitions, 658 flow [2025-02-06 13:01:34,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 75 transitions, 620 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-06 13:01:34,630 INFO L231 Difference]: Finished difference. Result has 83 places, 54 transitions, 341 flow [2025-02-06 13:01:34,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=341, PETRI_PLACES=83, PETRI_TRANSITIONS=54} [2025-02-06 13:01:34,631 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2025-02-06 13:01:34,631 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 54 transitions, 341 flow [2025-02-06 13:01:34,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:34,632 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:34,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 13:01:34,632 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:34,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:34,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2109028021, now seen corresponding path program 2 times [2025-02-06 13:01:34,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:34,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792088919] [2025-02-06 13:01:34,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:01:34,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:34,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-06 13:01:34,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 35 statements. [2025-02-06 13:01:34,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:01:34,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:34,712 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,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:34,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792088919] [2025-02-06 13:01:34,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792088919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:34,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:34,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:01:34,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615533102] [2025-02-06 13:01:34,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:34,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:34,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:34,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:34,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:34,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-02-06 13:01:34,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 54 transitions, 341 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:34,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-02-06 13:01:34,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:34,867 INFO L124 PetriNetUnfolderBase]: 519/1404 cut-off events. [2025-02-06 13:01:34,867 INFO L125 PetriNetUnfolderBase]: For 3807/3863 co-relation queries the response was YES. [2025-02-06 13:01:34,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4859 conditions, 1404 events. 519/1404 cut-off events. For 3807/3863 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8970 event pairs, 357 based on Foata normal form. 3/1364 useless extension candidates. Maximal degree in co-relation 4742. Up to 838 conditions per place. [2025-02-06 13:01:34,875 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 62 selfloop transitions, 3 changer transitions 2/79 dead transitions. [2025-02-06 13:01:34,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 79 transitions, 628 flow [2025-02-06 13:01:34,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:01:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:01:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-02-06 13:01:34,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2025-02-06 13:01:34,877 INFO L175 Difference]: Start difference. First operand has 83 places, 54 transitions, 341 flow. Second operand 4 states and 117 transitions. [2025-02-06 13:01:34,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 79 transitions, 628 flow [2025-02-06 13:01:34,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 79 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:01:34,881 INFO L231 Difference]: Finished difference. Result has 86 places, 55 transitions, 353 flow [2025-02-06 13:01:34,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=353, PETRI_PLACES=86, PETRI_TRANSITIONS=55} [2025-02-06 13:01:34,881 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2025-02-06 13:01:34,882 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 55 transitions, 353 flow [2025-02-06 13:01:34,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:34,882 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:34,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:01:34,882 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:34,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:34,882 INFO L85 PathProgramCache]: Analyzing trace with hash -790803087, now seen corresponding path program 3 times [2025-02-06 13:01:34,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:34,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520857508] [2025-02-06 13:01:34,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:01:34,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:34,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 6 equivalence classes. [2025-02-06 13:01:34,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 35 statements. [2025-02-06 13:01:34,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 13:01:34,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:34,948 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,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:34,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520857508] [2025-02-06 13:01:34,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520857508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:34,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:34,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:01:34,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907913689] [2025-02-06 13:01:34,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:34,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:34,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:34,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:34,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:34,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-02-06 13:01:34,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 55 transitions, 353 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:34,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-02-06 13:01:34,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:35,171 INFO L124 PetriNetUnfolderBase]: 786/1802 cut-off events. [2025-02-06 13:01:35,172 INFO L125 PetriNetUnfolderBase]: For 5673/5735 co-relation queries the response was YES. [2025-02-06 13:01:35,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6529 conditions, 1802 events. 786/1802 cut-off events. For 5673/5735 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 11189 event pairs, 552 based on Foata normal form. 30/1820 useless extension candidates. Maximal degree in co-relation 6410. Up to 1130 conditions per place. [2025-02-06 13:01:35,182 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 66 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2025-02-06 13:01:35,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 81 transitions, 706 flow [2025-02-06 13:01:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:01:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:01:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-02-06 13:01:35,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-02-06 13:01:35,184 INFO L175 Difference]: Start difference. First operand has 86 places, 55 transitions, 353 flow. Second operand 4 states and 114 transitions. [2025-02-06 13:01:35,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 81 transitions, 706 flow [2025-02-06 13:01:35,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 81 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:01:35,188 INFO L231 Difference]: Finished difference. Result has 89 places, 57 transitions, 384 flow [2025-02-06 13:01:35,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=384, PETRI_PLACES=89, PETRI_TRANSITIONS=57} [2025-02-06 13:01:35,189 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2025-02-06 13:01:35,189 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 57 transitions, 384 flow [2025-02-06 13:01:35,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:35,189 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:35,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 13:01:35,189 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:35,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:35,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1630752639, now seen corresponding path program 4 times [2025-02-06 13:01:35,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:35,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787339040] [2025-02-06 13:01:35,190 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:01:35,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:35,197 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-02-06 13:01:35,204 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:01:35,205 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:01:35,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:35,270 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:35,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:35,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787339040] [2025-02-06 13:01:35,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787339040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:35,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:35,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:01:35,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422074809] [2025-02-06 13:01:35,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:35,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:35,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:35,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:35,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:35,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-02-06 13:01:35,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 57 transitions, 384 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:35,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-02-06 13:01:35,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:35,472 INFO L124 PetriNetUnfolderBase]: 543/1610 cut-off events. [2025-02-06 13:01:35,472 INFO L125 PetriNetUnfolderBase]: For 5474/5506 co-relation queries the response was YES. [2025-02-06 13:01:35,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6048 conditions, 1610 events. 543/1610 cut-off events. For 5474/5506 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10998 event pairs, 234 based on Foata normal form. 30/1638 useless extension candidates. Maximal degree in co-relation 5927. Up to 916 conditions per place. [2025-02-06 13:01:35,481 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 58 selfloop transitions, 6 changer transitions 1/78 dead transitions. [2025-02-06 13:01:35,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 78 transitions, 687 flow [2025-02-06 13:01:35,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:01:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:01:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-02-06 13:01:35,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-06 13:01:35,482 INFO L175 Difference]: Start difference. First operand has 89 places, 57 transitions, 384 flow. Second operand 4 states and 112 transitions. [2025-02-06 13:01:35,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 78 transitions, 687 flow [2025-02-06 13:01:35,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 78 transitions, 680 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 13:01:35,486 INFO L231 Difference]: Finished difference. Result has 93 places, 58 transitions, 421 flow [2025-02-06 13:01:35,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=421, PETRI_PLACES=93, PETRI_TRANSITIONS=58} [2025-02-06 13:01:35,487 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2025-02-06 13:01:35,487 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 58 transitions, 421 flow [2025-02-06 13:01:35,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:35,487 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:35,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 13:01:35,487 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:35,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:35,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2099758807, now seen corresponding path program 1 times [2025-02-06 13:01:35,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:35,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426970469] [2025-02-06 13:01:35,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:35,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:35,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 13:01:35,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:01:35,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:35,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 13:01:35,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:35,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426970469] [2025-02-06 13:01:35,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426970469] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:35,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250185553] [2025-02-06 13:01:35,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:35,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:35,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:35,669 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:35,672 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:35,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 13:01:35,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:01:35,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:35,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:35,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 13:01:35,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:35,773 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:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:35,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:36,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250185553] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:36,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:36,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 27 [2025-02-06 13:01:36,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427354495] [2025-02-06 13:01:36,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:36,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 13:01:36,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:36,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 13:01:36,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2025-02-06 13:01:36,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2025-02-06 13:01:36,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 58 transitions, 421 flow. Second operand has 28 states, 28 states have (on average 18.107142857142858) internal successors, (507), 28 states have internal predecessors, (507), 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,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:36,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2025-02-06 13:01:36,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:37,199 INFO L124 PetriNetUnfolderBase]: 932/1994 cut-off events. [2025-02-06 13:01:37,199 INFO L125 PetriNetUnfolderBase]: For 8626/8688 co-relation queries the response was YES. [2025-02-06 13:01:37,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7859 conditions, 1994 events. 932/1994 cut-off events. For 8626/8688 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 11824 event pairs, 168 based on Foata normal form. 96/2060 useless extension candidates. Maximal degree in co-relation 7733. Up to 344 conditions per place. [2025-02-06 13:01:37,214 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 107 selfloop transitions, 20 changer transitions 0/137 dead transitions. [2025-02-06 13:01:37,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 137 transitions, 1270 flow [2025-02-06 13:01:37,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 13:01:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 13:01:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 295 transitions. [2025-02-06 13:01:37,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5402930402930403 [2025-02-06 13:01:37,216 INFO L175 Difference]: Start difference. First operand has 93 places, 58 transitions, 421 flow. Second operand 13 states and 295 transitions. [2025-02-06 13:01:37,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 137 transitions, 1270 flow [2025-02-06 13:01:37,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 137 transitions, 1251 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-06 13:01:37,224 INFO L231 Difference]: Finished difference. Result has 104 places, 59 transitions, 473 flow [2025-02-06 13:01:37,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=473, PETRI_PLACES=104, PETRI_TRANSITIONS=59} [2025-02-06 13:01:37,225 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2025-02-06 13:01:37,225 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 59 transitions, 473 flow [2025-02-06 13:01:37,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 18.107142857142858) internal successors, (507), 28 states have internal predecessors, (507), 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:37,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:37,225 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] [2025-02-06 13:01:37,242 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:37,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 13:01:37,426 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:37,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:37,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1264923223, now seen corresponding path program 1 times [2025-02-06 13:01:37,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:37,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788291333] [2025-02-06 13:01:37,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:37,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:37,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 13:01:37,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 13:01:37,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:37,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:37,545 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:37,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:37,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788291333] [2025-02-06 13:01:37,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788291333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:37,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:37,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:01:37,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734435540] [2025-02-06 13:01:37,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:37,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:37,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:37,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:37,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:37,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-02-06 13:01:37,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 59 transitions, 473 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:37,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:37,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-02-06 13:01:37,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:37,775 INFO L124 PetriNetUnfolderBase]: 910/2242 cut-off events. [2025-02-06 13:01:37,775 INFO L125 PetriNetUnfolderBase]: For 10517/10572 co-relation queries the response was YES. [2025-02-06 13:01:37,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9007 conditions, 2242 events. 910/2242 cut-off events. For 10517/10572 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 14697 event pairs, 578 based on Foata normal form. 22/2260 useless extension candidates. Maximal degree in co-relation 8869. Up to 1325 conditions per place. [2025-02-06 13:01:37,831 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 67 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2025-02-06 13:01:37,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 85 transitions, 837 flow [2025-02-06 13:01:37,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:01:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:01:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-02-06 13:01:37,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2025-02-06 13:01:37,833 INFO L175 Difference]: Start difference. First operand has 104 places, 59 transitions, 473 flow. Second operand 4 states and 117 transitions. [2025-02-06 13:01:37,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 85 transitions, 837 flow [2025-02-06 13:01:37,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 85 transitions, 771 flow, removed 4 selfloop flow, removed 11 redundant places. [2025-02-06 13:01:37,841 INFO L231 Difference]: Finished difference. Result has 98 places, 61 transitions, 475 flow [2025-02-06 13:01:37,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=475, PETRI_PLACES=98, PETRI_TRANSITIONS=61} [2025-02-06 13:01:37,841 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2025-02-06 13:01:37,841 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 61 transitions, 475 flow [2025-02-06 13:01:37,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:37,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:37,842 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] [2025-02-06 13:01:37,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 13:01:37,842 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:37,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:37,843 INFO L85 PathProgramCache]: Analyzing trace with hash -450715045, now seen corresponding path program 2 times [2025-02-06 13:01:37,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:37,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544633270] [2025-02-06 13:01:37,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:01:37,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:37,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-06 13:01:37,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 38 statements. [2025-02-06 13:01:37,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:01:37,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:37,904 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:37,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:37,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544633270] [2025-02-06 13:01:37,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544633270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:37,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:37,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:01:37,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181074246] [2025-02-06 13:01:37,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:37,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:01:37,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:37,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:01:37,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:01:37,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-02-06 13:01:37,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 61 transitions, 475 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:37,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:37,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-02-06 13:01:37,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:38,104 INFO L124 PetriNetUnfolderBase]: 640/1779 cut-off events. [2025-02-06 13:01:38,104 INFO L125 PetriNetUnfolderBase]: For 9205/9249 co-relation queries the response was YES. [2025-02-06 13:01:38,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7326 conditions, 1779 events. 640/1779 cut-off events. For 9205/9249 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 12043 event pairs, 56 based on Foata normal form. 24/1781 useless extension candidates. Maximal degree in co-relation 7197. Up to 986 conditions per place. [2025-02-06 13:01:38,116 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 55 selfloop transitions, 8 changer transitions 1/79 dead transitions. [2025-02-06 13:01:38,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 79 transitions, 779 flow [2025-02-06 13:01:38,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:01:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:01:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-02-06 13:01:38,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2025-02-06 13:01:38,117 INFO L175 Difference]: Start difference. First operand has 98 places, 61 transitions, 475 flow. Second operand 4 states and 110 transitions. [2025-02-06 13:01:38,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 79 transitions, 779 flow [2025-02-06 13:01:38,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 79 transitions, 771 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 13:01:38,127 INFO L231 Difference]: Finished difference. Result has 102 places, 62 transitions, 523 flow [2025-02-06 13:01:38,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=523, PETRI_PLACES=102, PETRI_TRANSITIONS=62} [2025-02-06 13:01:38,127 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places. [2025-02-06 13:01:38,127 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 62 transitions, 523 flow [2025-02-06 13:01:38,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:38,127 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:38,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 13:01:38,127 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:38,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:38,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1249037156, now seen corresponding path program 2 times [2025-02-06 13:01:38,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:38,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858313698] [2025-02-06 13:01:38,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:01:38,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:38,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-06 13:01:38,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 13:01:38,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:01:38,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-06 13:01:38,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:38,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858313698] [2025-02-06 13:01:38,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858313698] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:38,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302896143] [2025-02-06 13:01:38,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:01:38,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:38,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:38,511 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:38,512 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:38,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-06 13:01:38,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 13:01:38,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:01:38,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:38,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 13:01:38,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:38,626 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,632 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,756 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:01:38,757 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:38,761 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 16 treesize of output 11 [2025-02-06 13:01:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 20 proven. 31 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:38,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:01:39,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302896143] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:39,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:39,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 34 [2025-02-06 13:01:39,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820314808] [2025-02-06 13:01:39,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:39,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 13:01:39,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:39,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 13:01:39,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 13:01:40,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2025-02-06 13:01:40,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 62 transitions, 523 flow. Second operand has 36 states, 36 states have (on average 15.38888888888889) internal successors, (554), 36 states have internal predecessors, (554), 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,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:40,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2025-02-06 13:01:40,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:41,280 INFO L124 PetriNetUnfolderBase]: 1101/2141 cut-off events. [2025-02-06 13:01:41,280 INFO L125 PetriNetUnfolderBase]: For 12500/12578 co-relation queries the response was YES. [2025-02-06 13:01:41,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9210 conditions, 2141 events. 1101/2141 cut-off events. For 12500/12578 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 12182 event pairs, 73 based on Foata normal form. 56/2146 useless extension candidates. Maximal degree in co-relation 9076. Up to 400 conditions per place. [2025-02-06 13:01:41,292 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 137 selfloop transitions, 22 changer transitions 0/168 dead transitions. [2025-02-06 13:01:41,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 168 transitions, 1627 flow [2025-02-06 13:01:41,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 13:01:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 13:01:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 373 transitions. [2025-02-06 13:01:41,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.444047619047619 [2025-02-06 13:01:41,293 INFO L175 Difference]: Start difference. First operand has 102 places, 62 transitions, 523 flow. Second operand 20 states and 373 transitions. [2025-02-06 13:01:41,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 168 transitions, 1627 flow [2025-02-06 13:01:41,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 168 transitions, 1579 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-02-06 13:01:41,303 INFO L231 Difference]: Finished difference. Result has 112 places, 62 transitions, 528 flow [2025-02-06 13:01:41,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=528, PETRI_PLACES=112, PETRI_TRANSITIONS=62} [2025-02-06 13:01:41,303 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 70 predicate places. [2025-02-06 13:01:41,303 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 62 transitions, 528 flow [2025-02-06 13:01:41,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 15.38888888888889) internal successors, (554), 36 states have internal predecessors, (554), 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,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:41,304 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] [2025-02-06 13:01:41,310 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:41,504 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,SelfDestructingSolverStorable20 [2025-02-06 13:01:41,505 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-06 13:01:41,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:41,505 INFO L85 PathProgramCache]: Analyzing trace with hash 268172320, now seen corresponding path program 1 times [2025-02-06 13:01:41,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:41,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663103230] [2025-02-06 13:01:41,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:41,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:41,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 13:01:41,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 13:01:41,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:41,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:01:42,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:42,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663103230] [2025-02-06 13:01:42,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663103230] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:01:42,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462023392] [2025-02-06 13:01:42,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:42,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:01:42,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:42,084 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:01:42,084 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:01:42,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 13:01:42,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 13:01:42,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:42,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:42,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 13:01:42,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:01:42,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:01:42,291 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 27 treesize of output 23 [2025-02-06 13:01:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:01:42,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:01:58,968 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-02-06 13:01:58,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 50 [2025-02-06 13:01:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:01:58,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462023392] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:01:58,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:01:58,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2025-02-06 13:01:58,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073244452] [2025-02-06 13:01:58,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:01:58,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 13:01:58,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:58,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 13:01:58,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=643, Unknown=3, NotChecked=0, Total=756 [2025-02-06 13:02:03,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:07,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:11,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:15,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:19,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:23,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-06 13:02:27,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:31,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:35,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:39,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:43,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:47,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 13:02:51,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]